On breadth‐first constructions of scaling limits of random graphs and random unicellular maps

DOI10.1002/rsa.21076zbMath1522.05438arXiv1908.04403OpenAlexW4206347932MaRDI QIDQ6052477

Publication date: 17 October 2023

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

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

zbMATH Keywords

scaling limit Gromov-Hausdorff distance critical random graphs Erdős-Rényi random graph unicellular maps continuum random trees breadth-first construction depth-first construction

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Discrete-time Markov processes on general state spaces (60J05) Combinatorial probability (60C05)

Related Items (1)

Global lower mass-bound for critical configuration models in the heavy-tailed regime

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Cycle structure of percolation on high-dimensional tori
Hypercube percolation
Critical random graphs: limiting constructions and distributional properties
Random graph asymptotics on high-dimensional tori. II: volume, diameter and mixing time
The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
Continuum limit of critical inhomogeneous random graphs
Rates of convergence to Brownian local time
The continuum random tree. I
Grossissements de filtrations: exemples et applications. Séminaire de Calcul Stochastique 1982/83, Université Paris VI
Random graph asymptotics on high-dimensional tori
Height and diameter of Brownian tree
The structure of unicellular maps, and a connection between maps of positive genus and planar labelled trees
Random trees and applications
Brownian excursion area, wright's constants in graph enumeration, and other Brownian areas
Factoring \(n\)-cycles and counting maps of given genus
The depth first processes of Galton-Watson trees converge to the same Brownian excursion
The scaling limit of the minimum spanning tree of the complete graph
The exploration process of inhomogeneous continuum random trees, and an extension of Jeulin's local time identity
Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees
The continuum random tree. III
Component sizes for large quantum Erdős-Rényi graph near criticality
The continuum limit of critical random graphs
Probability and real trees. Ecole d'Eté de Probabilités de Saint-Flour XXXV -- 2005. Lecture given at the Saint-Flour probability summer school, July 6--23, 2005.
Counting rooted maps by genus. I
Probability laws related to the Jacobi theta and Riemann zeta functions, and Brownian excursions
Strong invariance for local times
The number of connected sparsely edged graphs
Enumerating graphs and Brownian motion
On the profile of random trees
Geometry of the vacant set left by random walk on random graphs, Wright's constants, and critical random graphs with prescribed degrees

This page was built for publication: On breadth‐first constructions of scaling limits of random graphs and random unicellular maps