Analysis of top-swap shuffling for genome rearrangements

From MaRDI portal
Publication:2467609

DOI10.1214/105051607000000177zbMATH Open1135.92024arXivmath/0609171OpenAlexW3102151384MaRDI QIDQ2467609FDOQ2467609

Prasad Tetali, Nayantara Bhatnagar, Pietro Caputo, Eric Vigoda

Publication date: 28 January 2008

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: We study Markov chains which model genome rearrangements. These models are useful for studying the equilibrium distribution of chromosomal lengths, and are used in methods for estimating genomic distances. The primary Markov chain studied in this paper is the top-swap Markov chain. The top-swap chain is a card-shuffling process with n cards divided over k decks, where the cards are ordered within each deck. A transition consists of choosing a random pair of cards, and if the cards lie in different decks, we cut each deck at the chosen card and exchange the tops of the two decks. We prove precise bounds on the relaxation time (inverse spectral gap) of the top-swap chain. In particular, we prove the relaxation time is Theta(n+k). This resolves an open question of Durrett.


Full work available at URL: https://arxiv.org/abs/math/0609171





Cites Work


Cited In (6)






This page was built for publication: Analysis of top-swap shuffling for genome rearrangements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467609)