1) La descarga del recurso depende de la página de origen
2) Para poder descargar el recurso, es necesario ser usuario registrado en Universia

Opción 1: Descargar recurso

Opción 2: Descargar recurso

Detalles del recurso


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^{\operatorname{inv}(\pi)}$ where $q>0$ and $\operatorname{inv}(\pi)$ is the number of inversions in $\pi$. ¶ We focus on the case that $q<1$ and show that the expected length of the cycle containing a given point is of order $\min\{(1-q)^{-2},n\}$. This marks the existence of two asymptotic regimes: with high probability, when $n$ tends to infinity with $(1-q)^{-2}\ll n$ then all cycles have size $o(n)$ whereas when $n$ tends to infinity with $(1-q)^{-2}\gg n$ then macroscopic cycles, of size proportional to $n$, emerge. In the second regime, we prove that the distribution of normalized cycle lengths follows the Poisson–Dirichlet law, as in a uniformly random permutation. The results bear formal similarity with a conjectured localization transition for random band matrices. ¶ Further results are presented for the variance of the cycle lengths, the expected diameter of cycles and the expected number of cycles. The proofs rely on the exact sampling algorithm for the Mallows distribution and make use of a special diagonal exposure process for the graph of the permutation.

Pertenece a

Project Euclid (Hosted at Cornell University Library)  


Gladkich, Alexey -  Peled, Ron - 

Id.: 71074666

Idioma: inglés  - 

Versión: 1.0

Estado: Final

Tipo:  application/pdf - 

Palabras claveMallows permutations - 

Tipo de recurso: Text  - 

Tipo de Interactividad: Expositivo

Nivel de Interactividad: muy bajo

Audiencia: Estudiante  -  Profesor  -  Autor  - 

Estructura: Atomic

Coste: no

Copyright: sí

: Copyright 2018 Institute of Mathematical Statistics

Formatos:  application/pdf - 

Requerimientos técnicos:  Browser: Any - 

Relación: [References] 0091-1798
[References] 2168-894X

Fecha de contribución: 10-mar-2018


* doi:10.1214/17-AOP1202

Otros recursos del mismo autor(es)

  1. Exponential decay of loop lengths in the loop $O(n)$ model with large $n$ International audience

Otros recursos de la mismacolección

  1. Interlacements and the wired uniform spanning forest We extend the Aldous–Broder algorithm to generate the wired uniform spanning forests (WUSFs) of infi...
  2. Exponentially concave functions and a new information geometry A function is exponentially concave if its exponential is concave. We consider exponentially concave...
  3. SPDE limit of the global fluctuations in rank-based models We consider systems of diffusion processes (“particles”) interacting through their ranks (also refer...
  4. First-passage percolation on Cartesian power graphs We consider first-passage percolation on the class of “high-dimensional” graphs that can be written ...
  5. Quasi-symmetries of determinantal point processes The main result of this paper is that determinantal point processes on $\mathbb{R}$ corresponding to...

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.