Scaling limits of random graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866912075186438144 |
|---|---|
| author | Addario-Berry, Louigi Goldschmidt, Christina |
| author_facet | Addario-Berry, Louigi Goldschmidt, Christina |
| contents | 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ős--Rényi random graph. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_13152 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Scaling limits of random graphs Addario-Berry, Louigi Goldschmidt, Christina Probability Combinatorics 05C80, 60C05 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ős--Rényi random graph. |
| title | Scaling limits of random graphs |
| topic | Probability Combinatorics 05C80, 60C05 |
| url | https://arxiv.org/abs/2410.13152 |