Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

A phase transition in the random transposition random walk

Abstract : Our work is motivated by Bourque-Pevzner's simulation study of the effectiveness of the parsimony method in studying genome rearrangement, and leads to a surprising result about the random transposition walk in continuous time on the group of permutations on $n$ elements starting from the identity. Let $D_t$ be the minimum number of transpositions needed to go back to the identity element from the location at time $t$. $D_t$ undergoes a phase transition: for $0 < c ≤ 1$, the distance $D_cn/2 ~ cn/2$, i.e., the distance increases linearly with time; for $c > 1$, $D_cn/2 ~ u(c)n$ where u is an explicit function satisfying $u(x) < x/2$. Moreover we describe the fluctuations of $D_{cn/2}$ about its mean at each of the three stages (subcritical, critical and supercritical). The techniques used involve viewing the cycles in the random permutation as a coagulation-fragmentation process and relating the behavior to the Erdős-Rényi random graph model.
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Wednesday, August 12, 2015 - 9:08:13 AM
Last modification on : Thursday, March 17, 2022 - 10:08:37 AM
Long-term archiving on: : Friday, November 13, 2015 - 11:38:07 AM


Publisher files allowed on an open archive




Nathanael Berestycki, Rick Durrett. A phase transition in the random transposition random walk. Discrete Random Walks, DRW'03, 2003, Paris, France. pp.17-26, ⟨10.46298/dmtcs.3343⟩. ⟨hal-00001309v3⟩



Record views


Files downloads