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

Abstract

We provide an explicit algorithm for sampling a uniform simple connected random graph with a given degree sequence. By products of this central result include: (i) continuum scaling limits of uniform simple connected graphs with given degree sequence and asymptotics for the number of simple connected graphs with given degree sequence under some regularity conditions, and (ii) scaling limits for the metric space structure of the maximal components in the critical regime of both the configuration model and the uniform simple random graph model with prescribed degree sequence under finite third moment assumption on the degree sequence. As a substantive application we answer a question raised by Cerny and Teixeira by obtaining the metric space scaling limit of maximal components in the vacant set left by random walks on random regular graphs.

44 pages, 5 figures; to appear in Random Structures & Algorithms

References in corpus (6)

• A note on Gromov-Hausdorff-Prokhorov distance between (locally) compact measure spaces
• Critical random graphs: Diameter and mixing time
• Critical window for the configuration model: finite third moment degrees
• Heavy-tailed configuration models at criticality
• The local weak limit of the minimum spanning tree of the complete graph
• Universality for critical heavy-tailed network models: Metric structure of maximal components

Cited by in corpus (4)

• Rigid representations of the multiplicative coalescent with linear deletion
• Geometry of the minimal spanning tree of a random $3$-regular graph
• 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