The Strassen law of iterated logarithm for combinatorial assemblies
From MaRDI portal
Publication:2471671
DOI10.1007/S10986-007-0013-YzbMATH Open1138.60314OpenAlexW1563766705MaRDI QIDQ2471671FDOQ2471671
Authors: J. Norkūnienė
Publication date: 18 February 2008
Published in: Lithuanian Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10986-007-0013-y
Recommendations
- An analogue of Feller's theorem for logarithmic combinatorial assemblies
- Strassen's law of the iterated logarithm for the Lorenz curves
- Law of the iterated logarithm in the Strassen formulation and additive functions
- The law of the iterated logarithm for additive functionals of Markov chains
- The law of iterated logarithm for combinatorial multisets
Functional limit theorems; invariance principles (60F17) Partitions of sets (05A18) Combinatorial probability (60C05)
Cites Work
- Logarithmic combinatorial structures: A probabilistic approach
- Title not available (Why is that?)
- Asymptotics of poisson approximation to random discrete distributions: an analytic approach
- Additive and multiplicative functions on random permutations
- The law of the iterated logarithm for random permutations
- Limit processes with independent increments for the Ewens sampling formula
- The law of iterated logarithm for logarithmic combinatorial assemblies
- Brownian motion for random permutations
- Title not available (Why is that?)
- Total Variation Asymptotics for Refined Poisson Process Approximations of Random Logarithmic Assemblies
- Title not available (Why is that?)
- The law of iterated logarithm for combinatorial multisets
- Functional approach in the divisor distribution problems
Cited In (8)
- The law of the iterated logarithm for degree distributions of some biological copy-networks
- Law of the iterated logarithm in the Strassen formulation and additive functions
- The strong circular law: A combinatorial view
- The law of the iterated logarithm for random interval homeomorphisms
- Asymptotic laws for compositions derived from transformed subordinators
- An analogue of Feller's theorem for logarithmic combinatorial assemblies
- Strong convergence on weakly logarithmic combinatorial assemblies
- The law of iterated logarithm for combinatorial multisets
This page was built for publication: The Strassen law of iterated logarithm for combinatorial assemblies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2471671)