An analogue of Feller's theorem for logarithmic combinatorial assemblies
DOI10.1007/S10986-008-9024-6zbMATH Open1222.11102OpenAlexW2037365878MaRDI QIDQ736133FDOQ736133
Authors: J. Norkūnienė, Eugenijus Manstavičius 
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
Recommendations
law of iterated logarithmrandom combinatorial structurecomponent sizelower classlower class random combinatorial structureupper class
Central limit and other weak theorems (60F05) Partitions of sets (05A18) Combinatorial probability (60C05) Arithmetic functions in probabilistic number theory (11K65)
Cites Work
- Logarithmic combinatorial structures: A probabilistic approach
- The General Form of the So-Called Law of the Iterated Logarithm
- Title not available (Why is that?)
- Limits of logarithmic combinatorial structures.
- Mappings on Decomposable Combinatorial Structures: Analytic Approach
- The law of the iterated logarithm for random permutations
- The law of iterated logarithm for logarithmic combinatorial assemblies
- The Strassen law of iterated logarithm for combinatorial assemblies
- Title not available (Why is that?)
- The law of iterated logarithm for combinatorial multisets
Cited In (5)
- The Strassen law of iterated logarithm for combinatorial assemblies
- A logical approach to asymptotic combinatorics I. First order properties
- Combinatorial logarithm and point-determining cographs
- Strong convergence on weakly logarithmic combinatorial assemblies
- Total variation approximation for random assemblies and a functional limit theorem
This page was built for publication: An analogue of Feller's theorem for logarithmic combinatorial assemblies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q736133)
