On Hamilton cycles in Erdős‐Rényi subgraphs of large graphs

Given a graph Γ_n=(V,E) on n vertices and m edges, we define the Erd?s‐Rényi graph process with host Γ_n as follows. A permutation e₁,…,e_m of E is chosen uniformly at random, and for t ≤ m we let Γ_n,t=(V,{e₁,…,e_t}). Suppose the minimum degree of Γ_n is δ(Γ_n) ≥ (1/2+ε)n for some constant ε>0. Then with high probability (An event holds with high probability (whp) if as n→∞.), Γ_n,t becomes Hamiltonian at the same moment that its minimum degree reaches 2. Given 0 ≤ p ≤ 1 let Γ_n,p be the Erd?s‐Rényi subgraph of Γ_n, obtained by retaining each edge independently with probability p. When δ(Γ_n) ≥ (1/2+ε)n, we provide a threshold for Hamiltonicity in Γ_n,p.     

Limiting shape of the depth first search tree in an Erdős‐Rényi graph

We show that the profile of the tree constructed by the depth first search algorithm in the giant component of an Erd?s‐Rényi graph with N vertices and connection probability c/N with c > 1 converges to an explicit deterministic shape. This makes it possible to exhibit a long nonintersecting path of length , where ρ_c is the density of the giant component and Li₂ denotes the dilogarithm function.     

Exponential sums of nonlinear congruential pseudorandom number generators with Rédei functions

The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. We give new bounds of exponential sums with sequences of iterations of Rédei functions over prime finite fields, which are much stronger than bounds known for general nonlinear congruential pseudorandom number generators.     

An application of rosenthal's moment inequality to the strong law of large numbers

We apply a moment inequality of H.P. Rosenthal to get various generalizations of a theorem of Brunk-Chung-Prohoroff. In particular, we show that the strong law hols provided $\text{∑}\text{n=1}\text{∞}\text{n}{}^{\mathrm{?2p}}\text{E(X}{}_{\mathrm{n}}\text{}{}^{\mathrm{2p}}\text{) < ∞}$ and $\text{∑}\text{n=1}\text{∞}\text{n}{}^{\mathrm{?2?p}}\text{(E(}\text{X}\text{n}\text{2}\text{))}{}^{\mathrm{p}}\text{< ∞}$ for one p ? 1.     

Rényi-type empirical processes

We develop a theory of asymptotics for Rényi-type weighted empirical and quantile processes and statistics via characterising their possible limiting behaviour in the middle and on the tails. In case of moderate weight functions tail limiting behaviour is found to be Gaussian, while heavily weighted tail empirical and uniform quantile processes are characterised by their respective Poisson process and exponential sums like asymptotic behaviour.     

关于M值随机序列的一个普遍成立的强大数定理

利用区间剖分法构造几乎处处收敛的鞅,得到了一个对任意M-值随机变量序列普遍成立的强极限定理,作为推论得到一个精细的Borel—Cantelli引理．     

A strong law for weighted sums of i.i.d. random variables

A strong law is proved for weighted sumsS _n=a _in X _i whereX _i are i.i.d. and {a _in} is an array of constants. When sup(n ^–1|a _in | ^q )^1/q <, 1<q andX _i are mean zero, we showE|X| ^p <,p ^l+q ^–1=1 impliesS _n /n 0. Whenq= this reduces to a result of Choi and Sung who showed that when the {a _in} are uniformly bounded,EX=0 andE|X|< impliesS _n /n 0. The result is also true whenq=1 under the additional assumption that lim sup |a _in |n ^–1 logn=0. Extensions to more general normalizing sequences are also given. In particular we show that when the {a _in} are uniformly bounded,E|X|^1/< impliesS _n /n 0 for >1, but this is not true in general for 1/2<<1, even when theX _i are symmetric. In that case the additional assumption that (x ^1/ log^1/–1 x)P(|X|x)0 asx provides necessary and sufficient conditions for this to hold for all (fixed) uniformly bounded arrays {a _in}.     

The Rényi–Ulam pathological liar game with a fixed number of lies

The q-round Rényi–Ulam pathological liar game with k lies on the set [n]{1,…,n} is a 2-player perfect information zero sum game. In each round Paul chooses a subset A[n] and Carole either assigns 1 lie to each element of A or to each element of [n]A. Paul wins if after q rounds there is at least one element with k or fewer lies. The game is dual to the original Rényi–Ulam liar game for which the winning condition is that at most one element has k or fewer lies. Define to be the minimum n such that Paul can win the q-round pathological liar game with k lies and initial set [n]. For fixed k we prove that is within an absolute constant (depending only on k) of the sphere bound, ; this is already known to hold for the original Rényi–Ulam liar game due to a result of J. Spencer.     

A two-sided estimate in the Hsu-Robbins-Erdös law of large numbers

Let X₁, X₂, … be independent identically distributed random variables. Then, Hsu and Robbins (1947) together with Erdös (1949, 1950) have proved that

,

if and only if E[X²₁] < ∞ and E[X₁] = 0. We prove that there are absolute constants C₁, C₂ (0, ∞) such that if X₁, X₂, … are independent identically distributed mean zero random variables, then

c₁λ⁻² E[X₁²·1_{|X1|λ}]S(λ)C₂λ⁻² E[X₁²·1_{|X1|λ}]

,

for every λ > 0.     

On the (p,q)$(p,q)$-type strong law of large numbers for sequences of independent random variables

Li, Qi, and Rosalsky (Trans. Amer. Math. Soc., 368 (2016), no. 1, 539–561) introduced a refinement of the Marcinkiewicz–Zygmund strong law of large numbers (SLLN), the so-called $(p,q)$-type SLLN, where and $q>0$. They obtained sets of necessary and sufficient conditions for this new type SLLN for two cases: , $q>p$, and . Results for the case where and remain open problems. This paper gives a complete solution to these problems. We consider random variables taking values in a real separable Banach space $\mathbf{B}$, but the results are new even when $\mathbf{B}$ is the real line. Furthermore, the conditions for a sequence of random variables $\left\{X_n,n\ge 1\right\}$ satisfying the $(p,q)$-type SLLN are shown to provide an exact characterization of stable type p Banach spaces.     

A strong law of large numbers for generalized random sets from the viewpoint of empirical processes

In this article we prove a strong law of large numbers for Borel measurable nonseparably valued random elements in the case of generalized random sets.

     

Some strong laws of large numbers for blockwise martingale difference sequences in martingale type p Banach spaces

For a blockwise martingale difference sequence of random elements {Vn , n ≥ 1} taking values in a real separable martingale type p (1 ≤ p ≤ 2) Banach space, conditions are provided for strong laws of large numbers of the form limn→∞∑ n i=1 Vi /gn = 0 almost surely to hold where the constants gn ↑∞. A result of Hall and Heyde [Martingale Limit Theory and Its Application, Academic Press, New York, 1980, p. 36] which was obtained for sequences of random variables is extended to a martingale type p (1 p ≤ 2) Banach space setting and to hold with a Marcinkiewicz-Zygmund type normalization. Illustrative examples and counterexamples are provided.     

Asymptotic properties of Cramér-Smirnov statistics—A new approach

Let Y₁,…, Y_n be independent identically distributed random variables with distribution function F(x, θ), θ = (θ′₁, θ′₂), where θ_i (i = 1, 2) is a vector of p_i components, p = p₁ + p₂ and for θI, an open interval in ^p, F(x, θ) is continuous. In the present paper the author shows that the asymptotic distribution of modified Cramér-Smirnov statistic under H_n: θ₁ = θ₁₀ + n^−1/2γ, θ₂ unspecified, where γ is a given vector independent of n, is the distribution of a sum of weighted noncentral χ₁² variables whose weights are eigenvalues of a covariance function of a Gaussian process and noncentrality parameters are Fourier coefficients of the mean function of the Gaussian process. Further, the author exploits the special form of the covariance function by using perturbation theory to obtain the noncentrality parameters and the weights. The technique is applicable to other goodness-of-fit statistics such as U² [G. S. Watson, Biometrika 48 (1961), 109–114].     

The Bézout equation for functions of log‐type growth in convex domains of finite type

The aim of this paper is to solve a division problem for the algebra of functions, which are holomorphic in a domain D ? C ⁿ, n > 1, and grow near the boundary not faster than some power of –log dist(z, bD). The domain D is assumed to be smoothly bounded and convex of finite d'Angelo type (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A countable Fréchet–Urysohn space of uncountable character

We shall construct a countable Fréchet–Urysohn α₄ not α₃ space X such that all finite powers of X are Fréchet–Urysohn.