Approximation by the Dickman distribution and quasi-log arithmic combinatorial structures

DOI10.1214/EJP.v16-881zbMath1225.60018arXiv1007.5269MaRDI QIDQ638411

Bruno Nietlispach, Andrew David Barbour

Publication date: 9 September 2011

Published in: Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.5269

zbMATH Keywords

logarithmic combinatorial structuresDickman's distributionMineka coupling

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05) Asymptotic enumeration (05A16)

Related Items (4)

Restrictive patterns of combinatorial structures via comparative analysis ⋮ Convergence to scale-invariant Poisson processes and applications in Dickman approximation ⋮ Non-asymptotic distributional bounds for the Dickman approximation of the running time of the Quickselect algorithm ⋮ Dickman approximation in simulation, summations and perpetuities

This page was built for publication: Approximation by the Dickman distribution and quasi-log arithmic combinatorial structures