Add to ORKGWe 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.Comment: 22 pages, 1 figure. Final version, to appear in Advances in Applied Mathematic
For a random permutation of n objects, as n → ∞, the process giving the proportion of elements in th...
Suppose that $m$ drivers each choose a preferred parking space in a linear car park with $n$ spaces....
Abstract. The goal of this paper is to analyse the asymptotic behavior of the cycle process and the ...
We consider the notion of classical parking functions by introducing randomness and a new parking pr...
We consider the Ewens measure on the symmetric group conditioned on the event that no cycles of macr...
Using techniques from Poisson approximation, we prove explicit error boundson the number of permutat...
We consider the distribution of cycle counts in a random regular graph, which is closely linked to t...
Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability ...
In the Page parking (or packing) model on a discrete interval (also known as the discrete Rényi pac...
The present work consider a natural discretization of Rényi’s so-called “parking problem”. Let l, n...
Background. A generalization of the A. Rényi’s stochastic parking model is considered. In our model,...
A highly accurate and efficient method to compute the expected values of the count, sum, and squared...
Parking occupancy in the area is defined by three major parameters - the rate of cars arrivals, the ...
We study the model of random permutations of $n$ objects with polynomially growing cycle weights, wh...
Proposed by Daniel Troy (Emeritus). Purdue University-Calumet, Hammond. IN. Let n be a positive int...
For a random permutation of n objects, as n → ∞, the process giving the proportion of elements in th...
Suppose that $m$ drivers each choose a preferred parking space in a linear car park with $n$ spaces....
Abstract. The goal of this paper is to analyse the asymptotic behavior of the cycle process and the ...
We consider the notion of classical parking functions by introducing randomness and a new parking pr...
We consider the Ewens measure on the symmetric group conditioned on the event that no cycles of macr...
Using techniques from Poisson approximation, we prove explicit error boundson the number of permutat...
We consider the distribution of cycle counts in a random regular graph, which is closely linked to t...
Consider an infinite tree with random degrees, i.i.d. over the sites, with a prescribed probability ...
In the Page parking (or packing) model on a discrete interval (also known as the discrete Rényi pac...
The present work consider a natural discretization of Rényi’s so-called “parking problem”. Let l, n...
Background. A generalization of the A. Rényi’s stochastic parking model is considered. In our model,...
A highly accurate and efficient method to compute the expected values of the count, sum, and squared...
Parking occupancy in the area is defined by three major parameters - the rate of cars arrivals, the ...
We study the model of random permutations of $n$ objects with polynomially growing cycle weights, wh...
Proposed by Daniel Troy (Emeritus). Purdue University-Calumet, Hammond. IN. Let n be a positive int...
For a random permutation of n objects, as n → ∞, the process giving the proportion of elements in th...
Suppose that $m$ drivers each choose a preferred parking space in a linear car park with $n$ spaces....
Abstract. The goal of this paper is to analyse the asymptotic behavior of the cycle process and the ...