相关论文: Compositions of random transpositions

We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…

A sorting network is a shortest path from 12...n to n...21 in the Cayley graph of S_n generated by nearest-neighbour swaps. We prove that for a uniform random sorting network, as n->infinity the space-time process of swaps converges to the…

A permutation $\sigma$ describing the relative orders of the first $n$ iterates of a point $x$ under a self-map $f$ of the interval $I=[0,1]$ is called an \emph{order pattern}. For fixed $f$ and $n$, measuring the points $x\in I$ (according…

We establish the equidistribution of the sequence of the averaged pullbacks of a Dirac measure at any value in $\mathbb{C}\setminus\{0\}$ under the derivatives of the iterations of a polynomials $f\in\mathbb{C}[z]$ of degree more than one…

We study the length of cycles of random permutations drawn from the Mallows distribution. Under this distribution, the probability of a permutation $\pi \in \mathbb{S}_n$ is proportional to $q^{\textrm{inv}(\pi)}$ where $0<q\le 1$ and…

We consider a Markov chain on the space of (countable) partitions of the interval [0,1], obtained first by size biased sampling twice (allowing repetitions) and then merging the parts (if the sampled parts are distinct) or splitting the…

Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. The authors of [2] showed that the expected number of distinct consecutive patterns of all lengths $k\in\{1,2,\ldots,n\}$ in $\pi_n$ was $\frac{n^2}{2}(1-o(1))$ as $n\to\infty$,…

We show the convergence of the characteristic polynomial for random permutation matrices sampled from the generalized Ewens distribution. Under this distribution, the measure of a given permutation depends only on its cycle structure,…

The Pitman-Yor process is a random discrete measure. The random weights or masses follow the two-parameter Poisson-Dirichlet distribution with parameters $0<\alpha<1, \theta>-\alpha$. The parameters $\alpha$ and $\theta$ correspond to the…

What is the smallest number of random transpositions (meaning that we swap given pairs of elements with given probabilities) that we can make on an $n$-point set to ensure that each element is uniformly distributed -- in the sense that the…

We discuss how the diffraction theory of a single translation bounded measure or a family of such measures can be understood within the framework of unitary group representations. This allows us to prove an orthogonality feature of measures…

We consider the cycle structure of a random permutation $\sigma$ chosen uniformly from the symmetric group, subject to the constraint that $\sigma$ does not contain cycles of length exceeding $r.$ We prove that under suitable conditions the…

In this paper we study systems of $N$ uniformly expanding coupled maps when $N$ is finite but large. We introduce self-consistent transfer operators that approximate the evolution of measures under the dynamics, and quantify this…

Convergence of order $O(1/\sqrt{n})$ is obtained for the distance in total variation between the Poisson distribution and the distribution of the number of fixed size cycles in generalized random graphs with random vertex weights. The…

We consider iterated function systems on the interval with random perturbation. Let $Y_\epsilon$ be uniformly distributed in $[1- \epsilon, 1 + \epsilon]$ and let $f_i \in C^{1+\alpha}$ be contractions with fixpoints $a_i$. We consider the…

Normal approximations for descents and inversions of permutations of the set $\{1,2,...,n\}$ are well known. A number of sequences that occur in practice, such as the human genome and other genomes, contain many repeated elements. Motivated…

It is well-known that for every $N \geq 1$ and $d \geq 1$ there exist point sets $x_1, \dots, x_N \in [0,1]^d$ whose discrepancy with respect to the Lebesgue measure is of order at most $(\log N)^{d-1} N^{-1}$. In a more general setting,…

We study the characteristic polynomial of random permutation matrices following some measures which are invariant by conjugation, including Ewens' measures which are one-parameter deformations of the uniform distribution on the permutation…

Feller (1945) provided a coupling between the counts of cycles of various sizes in a uniform random permutation of $[n]$ and the spacings between successes in a sequence of $n$ independent Bernoulli trials with success probability $1/n$ at…

Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…