Related papers: Random cyclations
We use coupling to study the time taken until the distribution of a statistic on a Markov chain is close to its stationary distribution. Coupling is a common technique used to obtain upper bounds on mixing times of Markov chains, and we…
In the symmetric group on a set of size 2n, let P_{2n} denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as ``pairings'', since each disjoint cycle has length 2). Harer and Zagier explicitly…
We consider a Laplace operator on a random graph consisting of infinitely many loops joined symmetrically by intervals of unit length. The arc lengths of the loops are considered to be independent, identically distributed random variables.…
We present some Markovian approaches to prove universality results for some functions on the symmetric group. Some of those statistics are already studied in [Kammoun, 2018, 2020] but not the general case. We prove, in particular, that the…
The discrete distribution of the length of longest increasing subsequences in random permutations of $n$ integers is deeply related to random matrix theory. In a seminal work, Baik, Deift and Johansson provided an asymptotics in terms of…
We investigate the order of the $r$-th, $1\le r < +\infty$, central moment of the length of the longest common subsequence of two independent random words of size $n$ whose letters are identically distributed and independently drawn from a…
It is well known that the distribution of extreme values of strictly stationary sequences differ from those of independent and identically distributed sequences in that extremal clustering may occur. Here we consider non-stationary but…
For random percolation at p_c, the probability distribution P(n) of the number of spanning clusters (n) has been studied in large scale simulations. The results are compatible with $P(n) \sim \exp(-an^2)$ for all dimensions. We also study…
We consider the distribution of free path lengths, or the distance between consecutive bounces of random particles, in an n-dimensional rectangular box. If each particle travels a distance R, then, as R tends to infinity the free path…
For a random sample of points in $\mathbb{R}$, we consider the number of pairs whose members are nearest neighbors (NN) to each other and the number of pairs sharing a common NN. The first type of pairs are called reflexive NNs whereas…
Using a result of Gessel and Reutenauer, we find a simple formula for the number of cyclic permutations with a given descent set, by expressing it in terms of ordinary descent numbers (i.e., those counting all permutations with a given…
In this report, the explicit probability density functions of the random Euclidean distances associated with equilateral triangles are given, when the two endpoints of a link are randomly distributed in 1) the same triangle, 2) two adjacent…
Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…
We show that the probability that two permutations of $n$ letters have the same number of cycles is \[\sim \frac{1}{2\sqrt{\pi\log{n}}}.\]
Consider the random walk on the permutation group obtained when the step distribution is uniform on a given conjugacy class. It is shown that there is a critical time at which two phase transitions occur simultaneously. On the one hand, the…
It has been known that the distribution of the random distances between two uniformly distributed points within a convex polygon can be obtained based on its chord length distribution (CLD). In this report, we first verify the existing…
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 study the number of values taken by the sums $\sum_{i=u}^{v-1} a_i$, where $a_1,a_2,\dots,a_n$ is a permutation of $1,2,\dots,n$ and $1 \leq u < v \leq n+1$. In particular, we show that for a random choice of a permutation, with high…
We study the length of cycles in the model of spatial random permutations in Euclidean space. In this model, for given length $L$, density $\rho$, dimension $d$ and jump density $\varphi$, one samples $\rho L^d$ particles in a…
An ensemble with random n-body interactions is investigated in the presence of symmetries. A striking emergence of regularities in spectra, ground state spins and isospins is discovered in both odd and even-particle systems. Various types…