arXiv:2412.19752 [math.PR]AbstractReferencesReviewsResources
A random walk among random graphs
Published 2024-12-27Version 1
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.
Comments: are very welcome! Do not hesitate
Related articles: Most relevant | Search more
arXiv:1611.10167 [math.PR] (Published 2016-11-30)
Thresholds for contagious sets in random graphs
Infinite paths and cliques in random graphs
Eigenvectors of random graphs: Nodal domains