{
  "id": "0901.4278",
  "version": "v1",
  "published": "2009-01-27T16:36:11.000Z",
  "updated": "2009-01-27T16:36:11.000Z",
  "title": "Note: Random-to-front shuffles on trees",
  "authors": [
    "Anders Björner"
  ],
  "comment": "6 pages, 4 figures; to appear in Electronic Communications in Probability",
  "categories": [
    "math.PR",
    "math.CO"
  ],
  "abstract": "A Markov chain is considered whose states are orderings of an underlying fixed tree and whose transitions are local \"random-to-front\" reorderings, driven by a probability distribution on subsets of the leaves. The eigenvalues of the transition matrix are determined using Brown's theory of random walk on semigroups.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2009-01-27T16:36:11.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "60J10",
      "60C05",
      "05E99"
    ],
    "keywords": [
      "random-to-front shuffles",
      "markov chain",
      "probability distribution",
      "transition matrix",
      "browns theory"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 6,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}