{
  "id": "2410.13152",
  "version": "v1",
  "published": "2024-10-17T02:11:05.000Z",
  "updated": "2024-10-17T02:11:05.000Z",
  "title": "Scaling limits of random graphs",
  "authors": [
    "Louigi Addario-Berry",
    "Christina Goldschmidt"
  ],
  "comment": "27 pages",
  "categories": [
    "math.PR",
    "math.CO"
  ],
  "abstract": "This work will appear as a chapter in a forthcoming volume titled \"Topics in Probabilistic Graph Theory\". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric structure of these random objects in the limit as their size goes to infinity, with distances appropriately rescaled. We start with the simplest setting of random trees, before turning to various examples of random graphs, including the critical Erd\\H{o}s--R\\'enyi random graph.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2024-10-17T02:11:05.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C80",
      "60C05"
    ],
    "keywords": [
      "random graph",
      "scaling limits",
      "large-scale geometric structure",
      "probabilistic graph theory",
      "random objects"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 27,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}