Asymptotic behaviour of the first positions of uniform parking functions
Etienne Bellin

TL;DR
This paper investigates the asymptotic distribution of initial positions in uniform parking functions, showing they become independent and uniform under certain conditions, with implications for related statistics.
Contribution
It provides new asymptotic results and bounds for the initial positions of uniform parking functions, extending previous work with improved convergence rates.
Findings
First positions are asymptotically i.i.d. and uniform under specified conditions
Established bounds for convergence rates of initial parking positions
Derived limit theorems for sums and maxima of initial parking positions
Abstract
In this paper we study the asymptotic behavior of a random uniform parking function of size . We show that the first places of are asymptotically i.i.d. and uniform on , for the total variation distance when , and for the Kolmogorov distance when , improving results of Diaconis & Hicks. Moreover we give bounds for the rate of convergence, as well as limit theorems for some statistics like the sum or the maximum of the first parking places. The main tool is a reformulation using conditioned random walks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Advanced Graph Theory Research · Complexity and Algorithms in Graphs
