A Generalization of the Erdős–Turán Law for the Order of Random Permutation
From MaRDI portal
Publication:2911070
DOI10.1017/S0963548312000247zbMath1248.60014arXiv1104.4953MaRDI QIDQ2911070
Alexander Marynych, Alexander V. Gnedin, Aleksander M. Iksanov
Publication date: 12 September 2012
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.4953
Related Items
A functional limit theorem for general shot noise processes, Functional limit theorems for the number of occupied boxes in the Bernoulli sieve, Limit theorems for the logarithm of the order of a random \(A\)-mapping, Block size in geometric(\(p\))-biased permutations, Central limit theorem for the least common multiple of a uniformly sampled \(m\)-tuple of integers
Cites Work
- Unnamed Item
- Unnamed Item
- On the number of empty boxes in the Bernoulli sieve. II.
- Coherent random permutations with biased record statistics
- Random permutations with cycle weights
- The Bernoulli sieve revisited
- Random permutations and Brownian motion
- The Bernoulli sieve
- Regenerative composition structures
- Limit processes with independent increments for the Ewens sampling formula
- Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
- Limit Theorems for Combinatorial Structures via Discrete Process Approximations
- Separable Statistics in a Polynomial Scheme. II
- Entropy computations via analytic depoissonization
- Three Sampling Formulas
- On some problems of a statistical group-theory. III
- Maxima of sums of random variables and suprema of stable processes