{
  "id": "0908.1141",
  "version": "v1",
  "published": "2009-08-08T00:45:54.000Z",
  "updated": "2009-08-08T00:45:54.000Z",
  "title": "A sharp analysis of the mixing time for random walk on rooted trees",
  "authors": [
    "Jason Fulman"
  ],
  "comment": "13 pages",
  "categories": [
    "math.CO",
    "math.PR"
  ],
  "abstract": "We define an analog of Plancherel measure for the set of rooted unlabeled trees on n vertices, and a Markov chain which has this measure as its stationary distribution. Using the combinatorics of commutation relations, we show that order n^2 steps are necessary and suffice for convergence to the stationary distribution.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2009-08-08T00:45:54.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "random walk",
      "sharp analysis",
      "rooted trees",
      "mixing time",
      "stationary distribution"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 13,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009arXiv0908.1141F"
    }
  }
}