• "60F05"
• All content
Clear All

# A moment approach for the almost sure central limit theorem for martingales

Studia Scientiarum Mathematicarum Hungarica
Authors: Bernard Bercu and Jean-Claude Fort

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.

Restricted access

# On the universal A.S. central limit theorem

Acta Mathematica Hungarica
Author: S. Hörmann

## Abstract

Let (X k) be a sequence of independent r.v.’s such that for some measurable functions gk : R kR a weak limit theorem of the form

\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$g_k (X_1 , \ldots ,X_k )\xrightarrow{\mathcal{L}}G$$ \end{document}
holds with some distribution function G. By a general result of Berkes and Csáki (“universal ASCLT”), under mild technical conditions the strong analogue
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\frac{1} {{D_N }}\sum\limits_{k = 1}^N {d_k I\left\{ {g_k (X_1 , \ldots ,X_k ) \leqq x} \right\} \to G(x)} a.s.$$ \end{document}
is also valid, where (d k) is a logarithmic weight sequence and D N = ∑k=1 N d k. In this paper we extend the last result for a very large class of weight sequences (d k), 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, ordinary averages.

Restricted access

# A note on asymptotics of linear combinations of iid random variables

Periodica Mathematica Hungarica
Author: Péter Kevei

## Abstract

Let X1,X2, ... be iid random variables, and let a n = (a 1,n, ..., a n,n) be an arbitrary sequence of weights. We investigate the asymptotic distribution of the linear combination

\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$S_{a_n }$$ \end{document}
= a 1,n X 1 + ... + a n,n X n under the natural negligibility condition limn→∞ max{|a k,n|: k = 1, ..., n} = 0. We prove that if
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$S_{a_n }$$ \end{document}
is asymptotically normal for a weight sequence a n, in which the components are of the same magnitude, then the common distribution belongs to
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\mathbb{D}$$ \end{document}
(2).

Restricted access

# Conditions for equivalence between Mallows distance and convergence to stable laws

Acta Mathematica Hungarica
Authors: Chang C. Y. Dorea and Debora B. Ferreira

## Abstract

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.

Restricted access

# The limiting distribution of the trace of a random plane partition

Acta Mathematica Hungarica
Authors: E. Kamenov and L. Mutafchiev

## Abstract

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 (τ nc 0 n 2/3)/c 1 n 1/3 log1/2 n converges weakly, as n → ∞, to the standard normal distribution, where c 0 = ζ(2)/ [2ζ(3)]2/3, c 1 = √(1/3/) [2ζ(3)]1/3 and ζ(s) = Σj=1 j s.

Restricted access

# A strong approximation for logarithmic averages of partial sums of random variables

Periodica Mathematica Hungarica
Author: G. Hurelbaatar

LetS n 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(S n/sn) converges almost surely to ?-8 8 f(x)dF(x). We also obtain strong approximation forH(n)=?k=1 n k -1 f(S k/sk)=logn ?-8 8 f(x)dF(x) which will imply the asymptotic normality ofH(n)/log1/2 n. 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.

Restricted access

# Asymptotic independence of maximum waiting times for increasing alphabet

Periodica Mathematica Hungarica
Author: T. Móri

## Abstract

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.

Restricted access

# A functional CLT for the L 2 modulus of continuity of local time

Periodica Mathematica Hungarica
Author: Jay Rosen

## Abstract

We show that as processes in (c, d, t) ∈ C(R 2 × R + 1)

\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\frac{{\int_c^d {(L_t^{x + h} - L_t^x )^2 dx - 4h} \int_c^d {L_t^x dx} }} {{h^{3/2} }}\mathop \Rightarrow \limits^\mathcal{L} \left( {\frac{{64}} {3}} \right)^{1/2} \int_c^d {L_t^x d\eta (x)}$$ \end{document}
as h → 0 for Brownian local time L t x. Here η(x) is an independent two-sided Brownian motion.

Restricted access

# Weak laws of large numbers for cooperative gamblers

Periodica Mathematica Hungarica
Authors: Sándor Csörgő and Gordon Simons

## Abstract

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.

Restricted access

# Merging asymptotic expansions for cooperative gamblers in generalized St. Petersburg games

Acta Mathematica Hungarica
Authors: S. Csörgő and P. Kevei

## Abstract

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.

Restricted access