A random walk among random graphs
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916543714033664 |
|---|---|
| author | Curien, Nicolas |
| author_facet | Curien, Nicolas |
| contents | Lecture notes of a master course given at Orsay between 2019-2024. Topics covered include Part I: One-dimensional random walks, cycle lemma and Bienaymé--Galton--Watson random trees. Part II: Erdös--Rényi random graphs, three proofs of the emergence of the giant component. Part III: Random recursive tree, random permutations and continuous time embedding techniques. Intended for publication. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_19752 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A random walk among random graphs Curien, Nicolas Probability Combinatorics Lecture notes of a master course given at Orsay between 2019-2024. Topics covered include Part I: One-dimensional random walks, cycle lemma and Bienaymé--Galton--Watson random trees. Part II: Erdös--Rényi random graphs, three proofs of the emergence of the giant component. Part III: Random recursive tree, random permutations and continuous time embedding techniques. Intended for publication. |
| title | A random walk among random graphs |
| topic | Probability Combinatorics |
| url | https://arxiv.org/abs/2412.19752 |