On the cut-off phenomenon for the transitivity of randomly generated subgroups

André Galligo 1 Laurent Miclo 2
1 GALAAD - Geometry, algebra, algorithms
CRISAM - Inria Sophia Antipolis - Méditerranée , UNS - Université Nice Sophia Antipolis, CNRS - Centre National de la Recherche Scientifique : UMR6621
Abstract : Consider $K\geq2$ independent copies of the random walk on the symmetric group $S_N$ starting from the identity and generated by the products of either independent uniform transpositions or independent uniform neighbor transpositions. At any time $n\in\NN$, let $G_n$ be the subgroup of $S_N$ generated by the $K$ positions of the chains. In the uniform transposition model, we prove that there is a cut-off phenomenon at time $N\ln(N)/(2K)$ for the non-existence of fixed point of $G_n$ and for the transitivity of $G_n$, thus showing that these properties occur before the chains have reached equilibrium. In the uniform neighbor transposition model, a transition for the non-existence of a fixed point of $G_n$ appears at time of order $N^{1+\frac 2K}$ (at least for $K\geq3$), but there is no cut-off phenomenon. In the latter model, we recover a cut-off phenomenon for the non-existence of a fixed point at a time proportional to $N$ by allowing the number $K$ to be proportional to $\ln(N)$. The main tools of the proofs are spectral analysis and coupling techniques.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [16 references]  Display  Hide  Download

Contributor : Laurent Miclo <>
Submitted on : Monday, September 13, 2010 - 6:53:33 PM
Last modification on : Friday, April 12, 2019 - 4:22:49 PM
Document(s) archivé(s) le : Tuesday, December 14, 2010 - 2:28:11 AM


Files produced by the author(s)


  • HAL Id : hal-00384188, version 2


André Galligo, Laurent Miclo. On the cut-off phenomenon for the transitivity of randomly generated subgroups. Random Structures & Algorithms, 2012, 40 (2), pp.189-219. ⟨hal-00384188v2⟩



Record views


Files downloads