Abstract
We prove tight bounds on the relaxation time of the so-called L-reversal chain, which was introduced by R. Durrett as a stochastic model for the evolution of chromosome chains. The process is described as follows. We have n distinct letters on the vertices of the n-cycle (ℤ mod n); at each step, a connected subset of the graph is chosen uniformly at random among all those of length at most L, and the current permutation is shuffled by reversing the order of the letters over that subset. We show that the relaxation time τ(n, L), defined as the inverse of the spectral gap of the associated Markov generator, satisfies
Citation
N. Cancrini. P. Caputo. F. Martinelli. "Relaxation time of L-reversal chains and other chromosome shuffles." Ann. Appl. Probab. 16 (3) 1506 - 1527, August 2006. https://doi.org/10.1214/105051606000000295
Information