Search Results

You are looking at 1 - 3 of 3 items for

  • Author or Editor: Alexey Chuprunov x
Clear All Modify Search

Almost sure limit theorems are presented for random allocations. A general almost sure limit theorem is proved for arrays of random variables. It is applied to obtain almost sure versions of the central limit theorem for the number of empty boxes when the parameters are in the central domain. Almost sure versions of the Poisson limit theorem in the left domain are also proved.

Restricted access

Moment inqualities and strong laws of large numbers are proved for random allocations of balls into boxes. Random broken lines and random step lines are constructed using partial sums of i.i.d. random variables that are modified by random allocations. Functional limit theorems for such random processes are obtained.

Restricted access

Summary An integral analogue of the general almost sure limit theorem is presented. In the theorem, instead of a sequence of random elements, a continuous time random process is involved, moreover, instead of the logarithmical average, the integral of delta-measures is considered. Then the general theorem is applied to obtain almost sure versions of limit theorems for semistable and max-semistable processes, moreover for processes being in the domain of attraction of a stable law or being in the domain of geometric partial attraction of a semistable or a max-semistable law.

Restricted access