Strong convergence on weakly logarithmic combinatorial assemblies
From MaRDI portal
Publication:626865
DOI10.1016/j.disc.2010.12.014zbMath1269.60009arXiv0903.1051MaRDI QIDQ626865
Publication date: 18 February 2011
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0903.1051
almost sure convergence; additive function; total variation distance; iterated logarithm law; random combinatorial structure
60F15: Strong limit theorems
60C05: Combinatorial probability
11K65: Arithmetic functions in probabilistic number theory
05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Total variation approximation for random assemblies and a functional limit theorem
- An analogue of Feller's theorem for logarithmic combinatorial assemblies
- An analytic method in probabilistic combinatorics
- A functional limit theorem on powers of random permutations
- The law of the iterated logarithm for random permutations
- Moments of sums of independent random variables
- Logarithmic combinatorial structures: A probabilistic approach
- Limit processes with independent increments for the Ewens sampling formula
- Limits of logarithmic combinatorial structures.
- The convergence rate to the normal law of a certain variable defined on random polynomials
- The law of iterated logarithm for logarithmic combinatorial assemblies
- The Strassen law of iterated logarithm for combinatorial assemblies
- Distribution of the logarithm of the order of a random permutation
- Explicit Limits of Total Variation Distance in Approximations of Random Logarithmic Assemblies by Related Poisson Processes
- Order statistics for decomposable combinatorial structures
- Mappings on Decomposable Combinatorial Structures: Analytic Approach
- Total Variation Asymptotics for Refined Poisson Process Approximations of Random Logarithmic Assemblies
- The General Form of the So-Called Law of the Iterated Logarithm
- Generalized moments of additive functions