A binomial splitting process in connection with corner parking problems

zbMath1321.60012arXiv1307.5610MaRDI QIDQ5176515

Hsien-Kuei Hwang, Michael Fuchs, Yoshiaki Itoh, Hosam M. Mahmoud

Publication date: 26 February 2015

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

zbMATH Keywords

asymptotic approximationbinomial distributionparking problemdigital treede-Poissonizationperiodic fluctuation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Central limit and other weak theorems (60F05) Combinatorial probability (60C05)

Related Items (1)

From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mellin transforms and asymptotics: Harmonic sums
• The number of distinct values in a geometrically distributed sample
• Analytical depoissonization and its applications
• Analysis of an asymmetric leader election algorithm
• Local limit theorems for finite and infinite urn models
• An analytic approach to the asymptotic variance of trie statistics and related structures
• A Generalisation of Stirling's Formula.
• Convergence of some leader election algorithms
• Asymptotic variance of random symmetric digital search trees
• Paths in a random digital tree: limiting distributions
• Random sequential coding by Hamming distance
• Limiting Distribution for the Depth in PATRICIA Tries
• Perpetuities in Fair Leader Election Algorithms

This page was built for publication: A binomial splitting process in connection with corner parking problems