An analogue of Feller's theorem for logarithmic combinatorial assemblies

DOI10.1007/s10986-008-9024-6zbMath1222.11102OpenAlexW2037365878MaRDI QIDQ736133

J. Norkūnienė, Eugenijus Manstavicius

Publication date: 27 October 2009

Published in: Lithuanian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10986-008-9024-6

zbMATH Keywords

law of iterated logarithmrandom combinatorial structurecomponent sizelower classlower class random combinatorial structureupper class

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Partitions of sets (05A18) Combinatorial probability (60C05) Arithmetic functions in probabilistic number theory (11K65)

Related Items (2)

Strong convergence on weakly logarithmic combinatorial assemblies ⋮ Total variation approximation for random assemblies and a functional limit theorem

Cites Work

• The law of the iterated logarithm for random permutations
• Logarithmic combinatorial structures: A probabilistic approach
• Limits of logarithmic combinatorial structures.
• The law of iterated logarithm for logarithmic combinatorial assemblies
• The Strassen law of iterated logarithm for combinatorial assemblies
• Mappings on Decomposable Combinatorial Structures: Analytic Approach
• The General Form of the So-Called Law of the Iterated Logarithm
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An analogue of Feller's theorem for logarithmic combinatorial assemblies