A random walk among random graphs
Probability
2024-12-30 v1 Combinatorics
Abstract
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\'e--Galton--Watson random trees. Part II: Erd\"os--R\'enyi 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.
Cite
@article{arxiv.2412.19752,
title = {A random walk among random graphs},
author = {Nicolas Curien},
journal= {arXiv preprint arXiv:2412.19752},
year = {2024}
}
Comments
are very welcome! Do not hesitate