arXiv Analytics

Sign in

arXiv:2202.08829 [math.PR]AbstractReferencesReviewsResources

Cycle structure of random parking functions

J. E. Paguyo

Published 2022-02-17Version 1

We initiate the study of the cycle structure of uniformly random parking functions. Using the combinatorics of parking completions, we compute the asymptotic expected value of the number of cycles of any fixed length. We obtain an upper bound on the total variation distance between the joint distribution of cycle counts and independent Poisson random variables using a multivariate version of Stein's method via exchangeable pairs. Under a mild condition, the process of cycle counts converges in distribution to a process of independent Poisson random variables.

Related articles: Most relevant | Search more
arXiv:1509.04552 [math.PR] (Published 2015-09-15)
Fixed points and cycle structure of random permutations
arXiv:1601.06991 [math.PR] (Published 2016-01-26)
On the Cycle Structure of Mallows Permutations
arXiv:1905.04636 [math.PR] (Published 2019-05-12)
The Cycle Structure of Permutations Without Long Cycles