Related papers: On the Cycle Structure of Mallows Permutations

We study how the inversion statistic is influenced by fixed points in a permutation. %The expected number of inversions in a uniformly random permutation in $S_n$ is $\frac{n(n-1)}4$. For each $n\in\mathbb{N}$, and each $k\in\{0,1,\cdots,…

A single permutation, seen as union of disjoint cycles, represents a regular graph of degree two. Consider $d$ many independent random permutations and superimpose their graph structures. It is a common model of a random regular (multi-)…

We have studied numerically the random interchange model and related loop models on the three-dimensional cubic lattice. We have determined the transition time for the occurrence of long loops. The joint distribution of the lengths of long…

The statistical distribution of levels of an integrable system is claimed to be a Poisson distribution. In this paper, we numerically generate an ensemble of N dimensional random diagonal matrices as a model for regular systems. We evaluate…

We consider self-loops and multiple edges in the configuration model as the size of the graph tends to infinity. The interest in these random variables is due to the fact that the configuration model, conditioned on being simple, is a…

We introduce a rather natural family of non-uniform distributions on $PF_n$, $n\in\mathbb{N}$, the set of parking functions of length $n$. One of the motivations for this comes from a similar situation in the context of integer partitions.…

Brooks and Makover introduced an approach to studying the global geometric quantities (in particular, the first eigenvalue of the Laplacian, injectivity radius and diameter) of a ``typical'' compact Riemann surface of large genus based on…

We show that a slight modification of a theorem of Ruzmaikina and Aizenman on competing particle systems on the real line leads to a characterization of Poisson-Dirichlet distributions $PD(a,0)$. Precisely, let $s$ be a proper random…

Dokos et. al. studied the distribution of two statistics over permutations $\mathfrak{S}_n$ of $\{1,2,\dots, n\}$ that avoid one or more length three patterns. A permutation $\sigma\in\mathfrak{S}_n$ contains a pattern…

Statistical lattice ensembles of loops in three or more dimensions typically have phases in which the longest loops fill a finite fraction of the system. In such phases it is natural to ask about the distribution of loop lengths. We show…

We investigate the asymptotic properties of permutations drawn from the Luce model, a natural probabilistic framework in which permutations are generated sequentially by sampling without replacement, with selection probabilities…

We study Mallows random permutations conditioned to avoid a given pattern $\alpha$ of length~$3$. When the bias parameter is of the form $e^{\beta/n}$, we prove that these permutations converge to a non-trivial explicit deterministic…

We present a simple formula for the expected number of inversions in a permutation of size $n$ obtained by applying $t$ random (not necessarily adjacent) transpositions to the identity permutation. More general, for any finite irreducible…

Let $G_{k,n}$ be a group of permutations of $kn$ objects which permutes things independently in disjoint blocks of size $k$ and then permutes the blocks. We investigate the probabilistic and/or enumerative aspects of random elements of…

For a word $\pi$ and integer $i$, we define $L^i(\pi)$ to be the length of the longest subsequence of the form $i(i+1)\cdots j$, and we let $L(\pi):=\max_i L^i(\pi)$. In this paper we estimate the expected values of $L^1(\pi)$ and $L(\pi)$…

We study the length of short cycles on uniformly random metric maps (also known as ribbon graphs) of large genus using a Teichm\"uller theory approach. We establish that, as the genus tends to infinity, the length spectrum converges to a…

We describe the limit (for two topologies) of large uniform random square permutations, i.e., permutations where every point is a record. The starting point for all our results is a sampling procedure for asymptotically uniform square…

The analysis of Tables of particle properties shows that the probability distribution of the results of physical measurements is far from the conventional Gaussian $\rho(\xi)=exp(-\xi^2/2) $, but is more likely to follow the simple…

Each connected component of a mapping $\{1,2,...,n\}\rightarrow\{1,2,...,n\}$ contains a unique cycle. The largest such component can be studied probabilistically via either a delay differential equation or an inverse Laplace transform. The…

We study the shrinking Pearson random walk in two dimensions and greater, in which the direction of the Nth is random and its length equals lambda^{N-1}, with lambda<1. As lambda increases past a critical value lambda_c, the endpoint…