English
Related papers

Related papers: Cycle structure of random parking functions

200 papers

We examine the number of cycles of length k in a permutation, as a function on the symmetric group. We write it explicitly as a combination of characters of irreducible representations. This allows to study formation of long cycles in the…

Probability · Mathematics 2019-12-19 Gil Alon , Gady Kozma

In this paper, we obtain a q-exponential generating function for inversions on parking functions via symmetric function theory and also through a direct bijection to rooted labeled forests. We then apply these techniques to unit interval…

We use Stein's method to obtain bounds on the rate of convergence for a class of statistics in geometric probability obtained as a sum of contributions from Poisson points which are exponentially stabilizing, i.e. locally determined in a…

Probability · Mathematics 2007-05-23 Mathew D. Penrose , J. E. Yukich

A special type of binomial splitting process is studied. Such a process can be used to model a high-dimensional corner parking problem, as well as the depth of random PATRICIA tries (a special class of digital tree data structures). The…

Probability · Mathematics 2013-11-27 Michael Fuchs , Hsien-Kuei Hwang , Yoshiaki Itoh , Hosam H. Mahmoud

We obtain quenched hitting distributions to be compound Poissonian for a certain class of random dynamical systems. The theory is general and designed to accommodate non-uniformly expanding behavior and targets that do not overlap much with…

Dynamical Systems · Mathematics 2024-02-06 Lucas Amorim , Nicolai Haydn , Sandro Vaienti

In this article we consider the cycle structure of compositions of pairs of involutions in the symmetric group S_n chosen uniformly at random. These can be modeled as modified 2-regular graphs, giving rise to exponential generating…

Combinatorics · Mathematics 2009-11-19 Michael Lugo

We study the distribution of cycle lengths in models of nonuniform random permutations with cycle weights. We identify several regimes. Depending on the weights, the length of typical cycles grows like the total number $n$ of elements, or a…

Probability · Mathematics 2011-01-06 Volker Betz , Daniel Ueltschi , Yvan Velenik

We study the asymptotic behavior of the long cycles of a random permutation of $n$ objects with respect to multiplicative measures with polynomial growing cycle weights. We show that the longest cycle and the length differences between the…

Probability · Mathematics 2020-02-04 Dirk Zeindler

We establish a general inequality on the Poisson space, yielding an upper bound for the distance in total variation between the law of a regular random variable with values in the integers and a Poisson distribution. Several applications…

Probability · Mathematics 2012-04-18 Giovanni Peccati

In this paper, we study the total displacement statistic of parking functions from the perspective of cooperative game theory. We introduce parking games, which are coalitional cost-sharing games in characteristic function form derived from…

Combinatorics · Mathematics 2024-11-06 Jennifer Elder , Pamela E. Harris , Jan Kretschmann , J. Carlos Martínez Mori

It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…

Condensed Matter · Physics 2009-10-28 C. Godreche , J. M. Luck , M. R. Evans , D. Mukamel , S. Sandow , E. R. Speer

This paper develops the first class of algorithms that enable unbiased estimation of steady-state expectations for multidimensional reflected Brownian motion. In order to explain our ideas, we first consider the case of compound Poisson…

Probability · Mathematics 2015-10-27 Jose Blanchet , Xinyun Chen

A parking function on $[n]$ creates a permutation in $S_n$ via the order in which the $n$ cars appear in the $n$ parking spaces. Placing the uniform probability measure on the set of parking functions on $[n]$ induces a probability measure…

Probability · Mathematics 2024-06-19 Ross G. Pinsky

Consider a sequence of masses $m_0,m_1,...$ arriving uniformly at random at some points $u_0,u_1,...$ on the unit circle $\mathbb{R}/\mathbb{Z}$ (or on $\mathbb{Z}/n\mathbb{Z}$, in the discrete version). Upon arrival, each mass undergoes a…

Probability · Mathematics 2025-07-02 Jean-François Marckert , Zoé Varin

We present a systematic analysis of quantum Heisenberg-, XY- and interchange models on the complete graph. These models exhibit phase transitions accompanied by spontaneous symmetry breaking, which we study by calculating the generating…

Mathematical Physics · Physics 2021-06-30 Jakob E. Björnberg , Jürg Fröhlich , Daniel Ueltschi

We study the systole of a random surface, where by a random surface we mean a surface constructed by randomly gluing together an even number of triangles. We study two types of metrics on these surfaces, the first one coming from using…

Differential Geometry · Mathematics 2017-05-17 Bram Petri

Parking sequences (a generalization of parking functions) are defined by specifying car lengths and requiring that a car attempts to park in the first available spot after its preference. If it does not fit there, then a collision occurs…

Combinatorics · Mathematics 2023-01-27 Spencer J. Franks , Pamela E. Harris , Kimberly Harry , Jan Kretschmann , Megan Vance

Random events in space and time often exhibit a locally dependent structure. When the events are very rare and dependent structure is not too complicated, various studies in the literature have shown that Poisson and compound Poisson…

Probability · Mathematics 2011-02-22 Aihua Xia , Fuxi Zhang

We prove empirical central limit theorems for the distribution of levels of various random fields defined on high-dimensional discrete structures as the dimension of the structure goes to $\infty$. The random fields considered include costs…

Probability · Mathematics 2012-03-08 Zakhar Kabluchko

A parking function is a sequence $(a_1,\dots, a_n)$ of positive integers such that if $b_1\leq\cdots\leq b_n$ is the increasing rearrangement of $a_1,\dots,a_n$, then $b_i\leq i$ for $1\leq i\leq n$. In this paper we obtain some new results…

Combinatorics · Mathematics 2023-06-16 Richard P. Stanley , Mei Yin