The law of iterated logarithm for logarithmic combinatorial assemblies

DOI10.1007/s10986-006-0040-0zbMath1132.05006OpenAlexW1577305979MaRDI QIDQ2471650

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-006-0040-0

zbMATH Keywords

strong convergenceadditive functionthe law of iterated logarithmcombinatorial assembly

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorial probability (60C05)

Related Items (3)

Strong convergence on weakly logarithmic combinatorial assemblies ⋮ The Strassen law of iterated logarithm for combinatorial assemblies ⋮ An analogue of Feller's theorem for logarithmic combinatorial assemblies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The law of the iterated logarithm for random permutations
• Additive and multiplicative functions on random permutations
• Logarithmic combinatorial structures: A probabilistic approach
• Limit processes with independent increments for the Ewens sampling formula
• The convergence rate to the normal law of a certain variable defined on random polynomials
• Asymptotics of poisson approximation to random discrete distributions: an analytic approach
• Total Variation Asymptotics for Refined Poisson Process Approximations of Random Logarithmic Assemblies
• On some problems of a statistical group-theory. I
• Ordered Cycle Lengths in a Random Permutation
• On the law of the iterated logarithm

This page was built for publication: The law of iterated logarithm for logarithmic combinatorial assemblies