{
  "id": "0712.1375",
  "version": "v2",
  "published": "2007-12-09T23:17:44.000Z",
  "updated": "2008-01-20T22:44:39.000Z",
  "title": "Commutation relations and Markov chains",
  "authors": [
    "Jason Fulman"
  ],
  "comment": "37 pages; referee suggestions implemented, discuss up-down chains as well, slightly better bounds in Props. 5.6, 7.6",
  "categories": [
    "math.PR",
    "math.CO"
  ],
  "abstract": "It is shown that the combinatorics of commutation relations is well suited for analyzing the convergence rate of certain Markov chains. Examples studied include random walk on irreducible representations, a local random walk on partitions whose stationary distribution is the Ewens distribution, and some birth-death chains.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2008-01-20T22:44:39.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "markov chains",
      "commutation relations",
      "local random walk",
      "convergence rate",
      "stationary distribution"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 37,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2007arXiv0712.1375F"
    }
  }
}