Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees

DOI10.1002/rsa.20880zbMath1445.05096arXiv1608.07153OpenAlexW2963590975MaRDI QIDQ5113952

Sanchayan Sen, Shankar Bhamidi

Publication date: 19 June 2020

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.07153

zbMATH Keywords

Gromov-Hausdorff distanceBrownian excursionsgraph enumerationcritical random graphsconfiguration modelmultiplicative coalescentvacant setsGromov-weak topologycontinuum random treesgraphs with prescribed degree sequenceWright's constants

Mathematics Subject Classification ID

Probability measures on topological spaces (60B05) Random graphs (graph-theoretic aspects) (05C80) Processes in random environments (60K37) Random walks on graphs (05C81)

Related Items

Universality for critical heavy-tailed network models: metric structure of maximal components ⋮ A probabilistic approach to the leader problem in random graphs ⋮ On breadth‐first constructions of scaling limits of random graphs and random unicellular maps ⋮ Convergence of blanket times for sequences of random walks on critical random graphs ⋮ Stable graphs: distributions and line-breaking construction ⋮ Multisource invasion percolation on the complete graph ⋮ Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes ⋮ Unnamed Item ⋮ Scaling Limits of Random Trees and Random Graphs ⋮ Geometry of the minimal spanning tree of a random 3-regular graph ⋮ Universal height and width bounds for random trees ⋮ The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees