{
  "id": "0902.4570",
  "version": "v1",
  "published": "2009-02-26T12:45:15.000Z",
  "updated": "2009-02-26T12:45:15.000Z",
  "title": "The CRT is the scaling limit of unordered binary trees",
  "authors": [
    "Jean-François Marckert",
    "Grégory Miermont"
  ],
  "categories": [
    "math.PR"
  ],
  "abstract": "We prove that a uniform, rooted unordered binary tree with $n$ vertices has the Brownian continuum random tree as its scaling limit for the Gromov-Hausdorff topology. The limit is thus, up to a constant factor, the same as that of uniform plane trees or labeled trees. Our analysis rests on a combinatorial and probabilistic study of appropriate trimming procedures of trees.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2009-02-26T12:45:15.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "scaling limit",
      "brownian continuum random tree",
      "uniform plane trees",
      "analysis rests",
      "rooted unordered binary tree"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2009arXiv0902.4570M"
    }
  }
}