Almost sure versions of limit theorems for random allocations with the random number of cells
From MaRDI portal
Publication:694359
DOI10.1134/S199508021003011XzbMATH Open1270.60037OpenAlexW2057880176MaRDI QIDQ694359FDOQ694359
Authors: Alexey Chuprunov, L. P. Terekhova 
Publication date: 12 December 2012
Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s199508021003011x
Recommendations
- Almost sure limit theorems for random allocations
- Limit theorems for the number of empty cells
- Local limit theorem for the number of empty cells in a scheme of random equiprobable allocations
- An analogue of the generalised allocation scheme: limit theorems for the number of cells containing a given number of particles
- Inequalities and limit theorems for random allocations
Central limit and other weak theorems (60F05) Strong limit theorems (60F15) Combinatorial probability (60C05)
Cites Work
- A universal result in almost sure central limit theory.
- On Strong Versions of the Central Limit Theorem
- An almost everywhere central limit theorem
- Title not available (Why is that?)
- An almost sure functional limit theorem for the domain of geometric partial attraction of semistable laws
- On almost sure limit theorems
- Limit theorems for the number of empty cells
Cited In (5)
- On the probability of the event: in $n$ generalized allocation schemes the volume of each cell does not exceed $r$
- Poisson limit theorems for number of given value cells in non-homogeneous generalized allocation scheme
- Title not available (Why is that?)
- Inequalities and limit theorems for random allocations
- Almost sure limit theorems for random allocations
This page was built for publication: Almost sure versions of limit theorems for random allocations with the random number of cells
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q694359)
