The law of iterated logarithm for logarithmic combinatorial assemblies
From MaRDI portal
Publication:2471650
Cites work
- Additive and multiplicative functions on random permutations
- Asymptotics of poisson approximation to random discrete distributions: an analytic approach
- Brownian motion for random permutations
- scientific article; zbMATH DE number 3452922 (Why is no real title available?)
- scientific article; zbMATH DE number 3104489 (Why is no real title available?)
- Limit processes with independent increments for the Ewens sampling formula
- Logarithmic combinatorial structures: A probabilistic approach
- On some problems of a statistical group-theory. I
- On the law of the iterated logarithm
- Ordered Cycle Lengths in a Random Permutation
- The convergence rate to the normal law of a certain variable defined on random polynomials
- The law of the iterated logarithm for random permutations
- Total Variation Asymptotics for Refined Poisson Process Approximations of Random Logarithmic Assemblies
Cited in
(6)- A logical approach to asymptotic combinatorics I. First order properties
- The law of the iterated logarithm for random permutations
- The log-behavior of ménage numbers
- The Strassen law of iterated logarithm for combinatorial assemblies
- Strong convergence on weakly logarithmic combinatorial assemblies
- An analogue of Feller's theorem for logarithmic combinatorial assemblies
This page was built for publication: The law of iterated logarithm for logarithmic combinatorial assemblies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471650)
