Some limit theorems for the cell load in the generalized allocation scheme
Let \(\eta(N-s)\) denotes the \((N-s)\)th-order statistics from the allocation scheme. In this paper, the authors consider the generalized allocation scheme and study the asymptotic behaviors of the extreme \(\eta(N-s).\) They establish asymptotic representations and large and moderate deviations for \(\eta(N-s).\) The paper extends the results of \textit{A. N. Chuprunov} and \textit{I. Fazekas} [Discrete Math. Appl. 22, No. 1, 101--122 (2012; Zbl 1274.60088); translation from Diskretn. Mat. 24, No. 1, 140--158 (2012)].
- An analogue of the generalised allocation scheme: limit theorems for the maximum cell load
- Number of cells containing a given number of particles in a generalized allocation scheme
- An analogue of the generalised allocation scheme: limit theorems for the number of cells containing a given number of particles
- Local limit theorems for generalized scheme of allocation of particles into ordered cells
- Some limit theorems for generalized allocation schemes
- An analogue of the generalised allocation scheme: limit theorems for the maximum cell load
- An analogue of the generalised allocation scheme: limit theorems for the number of cells containing a given number of particles
- scientific article; zbMATH DE number 1222135 (Why is no real title available?)
- scientific article; zbMATH DE number 1231233 (Why is no real title available?)
- scientific article; zbMATH DE number 1158743 (Why is no real title available?)
- scientific article; zbMATH DE number 3309746 (Why is no real title available?)
- Inequalities for the $r$th Absolute Moment of a Sum of Random Variables, $1 \leqq r \leqq 2$
- On the limit distributions of the degrees of vertices in configuration graphs with a bounded number of edges
- On the limit distributions of the vertex degrees of conditional internet graphs
- On the maximum size of a tree in the Galton-Watson forest with a bounded number of vertices
- Probability inequalities.
- Probability. Theory and examples.
- Random graphs of Internet type and the generalised allocation scheme
- Splitting a Single State of a Stationary Process into Markovian States
- The conditional maximum of Poisson random variables
This page was built for publication: Some limit theorems for the cell load in the generalized allocation scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674416)