Convergence in Mallows distance is of particular interest when heavy-tailed distributions are considered. For 1≦α<2, it constitutes an alternative technique to derive central limit type theorems for non-Gaussian α-stable laws. In this note, we further explore the connection between Mallows distance and convergence in distribution. Conditions for their equivalence are presented.
We prove the almost sure central limit theorem for martingales via an original approach which uses the Carleman moment theorem together with the convergence of moments of martingales. Several statistical applications to autoregressive and branching processes are also provided.
is also valid, where (dk) is a logarithmic weight sequence and DN = ∑k=1Ndk. In this paper we extend the last result for a very large class of weight sequences (dk), leading to considerably sharper results. We show that logarithmic weights, used traditionally in a.s. central limit theory,
are far from optimal and the theory remains valid with averaging procedures much closer to, in some cases even identical with,
We study the asymptotic behaviour of the trace (the sum of the diagonal parts) τn = τn(ω) of a plane partition ω of the positive integer n, assuming that ω is chosen uniformly at random from the set of all such partitions. We prove that (τn − c0n2/3)/c1n1/3 log1/2n converges weakly, as n → ∞, to the standard normal distribution, where c0 = ζ(2)/ [2ζ(3)]2/3, c1 = √(1/3/) [2ζ(3)]1/3 and ζ(s) = Σj=1∞j−s.
LetSn be the partial sums of ?-mixing stationary random variables and letf(x) be a real function. In this note we give sufficient conditions under which the logarithmic average off(Sn/sn) converges almost surely to ?-88f(x)dF(x). We also obtain strong approximation forH(n)=?k=1nk-1f(Sk/sk)=logn ?-88f(x)dF(x) which will imply the asymptotic normality ofH(n)/log1/2n. But for partial sums of i.i.d. random variables our results will be proved under weaker moment condition than assumed for ?-mixing random variables.
For everyk≥1 consider the waiting time until each pattern of lengthk over a fixed alphabet of sizen appears at least once in an infinite sequence of independent, uniformly distributed random letters. Lettingn→∞ we determine the limiting finite dimensional joint distributions of these waiting times after suitable normalization and
provide an estimate for the rate of convergence. It will turn out that these waiting times are getting independent.
Based on a stochastic extension of Karamata’s theory of slowly varying functions, necessary and sufficient conditions are
established for weak laws of large numbers for arbitrary linear combinations of independent and identically distributed nonnegative
random variables. The class of applicable distributions, herein described, extends beyond that for sample means, but even
for sample means our theory offers new results concerning the characterization of explicit norming sequences. The general
form of the latter characterization for linear combinations also yields a surprising new result in the theory of slow variation.
Merging asymptotic expansions are established for the distribution functions of suitably centered and normed linear combinations
of winnings in a full sequence of generalized St. Petersburg games, where a linear combination is viewed as the share of any
one of n cooperative gamblers who play with a pooling strategy. The expansions are given in terms of Fourier-Stieltjes transforms
and are constructed from suitably chosen members of the classes of subsequential semistable infinitely divisible asymptotic
distributions for the total winnings of the n players and from their pooling strategy, where the classes themselves are determined by the two parameters of the game. For
all values of the tail parameter, the expansions yield best possible rates of uniform merge. Surprisingly, it turns out that
for a subclass of strategies, not containing the averaging uniform strategy, our merging approximations reduce to asymptotic
expansions of the usual type, derived from a proper limiting distribution. The Fourier-Stieltjes transforms are shown to be
numerically invertible in general and it is also demonstrated that the merging expansions provide excellent approximations
even for very small n.