Related papers: Random permutations without macroscopic cycles

We consider a class of random loop models (including the random interchange process) that are parametrised by a time parameter $\beta\geq 0$. Intuitively, larger $\beta$ means more randomness. In particular, at $\beta=0$ we start with loops…

We consider random permutation matrices following a one-parameter family of deformations of the uniform distribution, called Ewens' measures, and modifications of these matrices where the entries equal to one are replaced by i.i.d uniform…

Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.

This paper investigates the exact number of limit cycles given by the averaging theory of first order for the piecewise smooth integrable non-Hamiltonian system \begin{eqnarray*} (\dot{x},\ \dot{y})=\begin{cases} (-y(x+a)^2+\varepsilon…

Let $\a$ be a complex random variable with mean zero and bounded variance $\sigma^{2}$. Let $N_{n}$ be a random matrix of order $n$ with entries being i.i.d. copies of $\a$. Let $\lambda_{1}, ..., \lambda_{n}$ be the eigenvalues of…

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…

Central limit theorems are established for the sum, over a spatial region, of observations from a linear process on a $d$-dimensional lattice. This region need not be rectangular, but can be irregularly-shaped. Separate results are…

Define the non-overlapping return time of a random process to be the number of blocks that we wait before a particular block reappears. We prove a Central Limit Theorem based on these return times. This result has applications to entropy…

We present some results on the proportion of permutations of length $n$ containing certain mesh patterns as $n$ grows large, and give exact enumeration results in some cases. In particular, we focus on mesh patterns where entire rows and…

Given a periodic point $\omega$ in a $\psi$-mixing shift with countable alphabet, the sequence $\{S_{n}\}$ of random variables counting the number of multiple returns to shrinking cylindrical neighborhoods of $\omega$ is considered.…

We propose an extension of the Ewens measure on permutations by choosing the cycle weights to be asymptotically proportional to the degree of the symmetric group. This model is primarily motivated by a natural approximation to the so-called…

Bukh and Zhou conjectured that the expectation of the length of the longest common subsequence of two i.i.d random permutations of size $n$ is greater than $\sqrt{n}$. We prove in this paper that there exists a universal constant $n_1$ such…

This paper is interested in independent sets (or equivalently, cliques) in uniform random cographs. We also study their permutation analogs, namely, increasing subsequences in uniform random separable permutations. First, we prove that,…

We prove a central limit theorem for non-commutative random variables in a von Neumann algebra with a tracial state: Any non-commutative polynomial of averages of i.i.d. samples converges to a classical limit. The proof is based on a…

A permutation sequence $(\sigma_n)_{n \in \mathbb{N}}$ is said to be convergent if, for every fixed permutation $\tau$, the density of occurrences of $\tau$ in the elements of the sequence converges. We prove that such a convergent sequence…

We discuss both simple and more subtle connections between the numbers of permutations and full cycles with some restrictions,in particular, between the numbers of permutations and full cycles with prescribed up-down structure.

We study the asymptotic behavior of cycles of uniformly random parking functions. Our results are multifold: we obtain an explicit formula for the number of parking functions with a prescribed number of cyclic points and show that the…

A locally uniform random permutation is generated by sampling $n$ points independently from some absolutely continuous distribution $\rho$ on the plane and interpreting them as a permutation by the rule that $i$ maps to $j$ if the $i$th…

We derive a large deviation principle for random permutations induced by probability measures of the unit square, called permutons. These permutations are called $\mu$-random permutations. We also introduce and study a new general class of…

The main result is the following Theorem: Let p=p(n) be such that p(n) in [0,1] for all n and either p(n)<< n^{-1} or for some positive integer k, n^{-1/k}<< p(n)<< n^{-1/(k+1)} or for all epsilon >0, n^{- epsilon}<< p(n) and n^{-…