Related papers: Compositions of random transpositions

The number of comparisons X_n used by Quicksort to sort an array of n distinct numbers has mean mu_n of order n log n and standard deviation of order n. Using different methods, Regnier and Roesler each showed that the normalized variate…

An involution is a bijection that is its own inverse. Given a permutation $\sigma$ of $[n],$ let $\mathsf{invol}(\sigma)$ denote the number of ways $\sigma$ can be expressed as a composition of two involutions of $[n].$ We prove that the…

In the local, characteristic 0, non archimedean case, we consider distributions on GL(n+1) which are invariant under the adjoint action of GL(n). We prove that such distributions are invariant by transposition. This implies that an…

We prove that there exists a positive constant \epsilon such that if \log n / n \le p \le n^{-1+\epsilon}, then asymptotically almost surely the random graph G ~ G(n,p) contains a collection of \lfloor \delta(G)/2 \rfloor edge-disjoint…

We study the distribution of partial sums of Rademacher random multiplicative functions $(f(n))_n$ evaluated at polynomial arguments. We show that for a polynomial $P\in \mathbb Z[x]$ that is a product of at least two distinct linear…

We use representation theory of the symmetric group S_n to prove Poisson limit theorems for the distribution of fixed points for three types of non-uniform permutations. First, we give results for the commutator of g and x where g and x are…

The authors consider the length, $l_N$, of the length of the longest increasing subsequence of a random permutation of $N$ numbers. The main result in this paper is a proof that the distribution function for $l_N$, suitably centered and…

We show that in any dimension $d\ge1$, the cycle-length process of stationary random stirring (or, random interchange) on the lattice torus converges to the canonical Markovian split-and-merge process with the invariant (and reversible)…

Given an increasing sequence of integers a(n), it is known (due to Weyl) that for almost all reals t, the fractional parts of the dilated sequence t*a(n) are uniformly distributed in the unit interval. Some effort has been made recently to…

We compute the limiting distributions of the lengths of the longest monotone subsequences of random (signed) involutions with or without conditions on the number of fixed points (and negated points) as the sizes of the involutions tend to…

A metric probability space $(\Omega,d)$ obeys the ${\it concentration\; of\; measure\; phenomenon}$ if subsets of measure $1/2$ enlarge to subsets of measure close to 1 as a transition parameter $\epsilon$ approaches a limit. In this paper…

We consider cocycles obtained by composing sequences of transfer operators with positive weights, associated with uniformly expanding maps (possibly having countably many branches) and depending upon parameters. Assuming $C^k$ regularity…

The 1/[-i\omega + D(\omega, q)q^2] diffusion pole in the localized phase transfers to the 1/\omega Berezinskii-Gorkov singularity, which can be analyzed by the instanton method (M V. Sadovskii, 1982; J. L. Cardy, 1978). Straightforward use…

We propose a "decomposition method" to prove non-asymptotic bound for the convergence of empirical measures in various dual norms. The main point is to show that if one measures convergence in duality with sufficiently regular observables,…

Let $f = \sum_{k=0}^n \varepsilon_k z^k$ be a random polynomial, where $\varepsilon_0,\ldots ,\varepsilon_n$ are iid standard Gaussian random variables, and let $\zeta_1,\ldots,\zeta_n$ denote the roots of $f$. We show that the point…

In the first paper in this series we estimated the probability that a random permutation $\pi\in\mathcal{S}_n$ has a fixed set of a given size. In this paper, we elaborate on the same method to estimate the probability that $\pi$ has $m$…

Let G \subset \R^k be a convex polyhedral cone with vertex at the origin given as the intersection of half spaces {G_i, i= 1, ..., N}, where n_i and d_i denote the inward normal and direction of constraint associated with G_i, respectively.…

A tuple $(G_1,\dots,G_n)$ of graphs on the same vertex set of size $n$ is said to be Hamilton-universal if for every map $\chi: [n]\to[n]$ there exists a Hamilton cycle whose $i$-th edge comes from $G_{\chi(i)}$. Bowtell, Morris, Pehova and…

We define a generalized Golomb--Dickman constant $\lambda_{\theta}$ as the limiting expected proportion of the longest cycle in random permutations under the Ewens measure with parameter $\theta > 0$. Exploiting the independence properties…

Selecting N random points in a unit square corresponds to selecting a random permutation. By putting 5 types of symmetry restrictions on the points, we obtain subsets of permutations : involutions, signed permutations and signed…