The law of iterated logarithm for combinatorial multisets

MaRDI QIDQ3173779zbMATH OpenFDO

Authors J. Norkūnienė

Publication date 10 October 2011

zbMATH Keywords

law of iterated logarithmcombinatorial multisets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Strong limit theorems (60F15) Combinatorial probability (60C05)

Recommendations

• The Strassen law of iterated logarithm for combinatorial assemblies
• Total variation asymptotics for independent process approximations of logarithmic multisets and selections
• ASYMPTOTIC ENUMERATION AND LOGICAL LIMIT LAWS FOR EXPANSIVE MULTISETS AND SELECTIONS
• A Poisson * Geometric Convolution Law for the Number of Components in Unlabelled Combinatorial Structures
• scientific article; zbMATH DE number 6533395

Cited in

(8)

• Asymptotic enumeration and limit laws for multisets: the subexponential case
• The Strassen law of iterated logarithm for combinatorial assemblies
• The strong circular law: A combinatorial view
• On multisets, interpolated multiple zeta values and limit laws
• The log-behavior of ménage numbers
• Iterated combinatorial density theorems
• ASYMPTOTIC ENUMERATION AND LOGICAL LIMIT LAWS FOR EXPANSIVE MULTISETS AND SELECTIONS
• An analogue of Feller's theorem for logarithmic combinatorial assemblies

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3173779)