{
  "id": "math/0609171",
  "version": "v2",
  "published": "2006-09-06T09:00:24.000Z",
  "updated": "2007-10-24T07:37:52.000Z",
  "title": "Analysis of top-swap shuffling for genome rearrangements",
  "authors": [
    "Nayantara Bhatnagar",
    "Pietro Caputo",
    "Prasad Tetali",
    "Eric Vigoda"
  ],
  "comment": "Published in at http://dx.doi.org/10.1214/105051607000000177 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)",
  "journal": "Annals of Applied Probability 2007, Vol. 17, No. 4, 1424-1445",
  "doi": "10.1214/105051607000000177",
  "categories": [
    "math.PR"
  ],
  "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.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2007-10-24T07:37:52.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "60J27",
      "92D10"
    ],
    "keywords": [
      "top-swap shuffling",
      "top-swap chain",
      "relaxation time",
      "primary markov chain",
      "top-swap markov chain"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2006math......9171B"
    }
  }
}