The continuum limit of critical random graphs

DOI10.1007/S00440-010-0325-4MaRDI QIDQ2428503zbMATH OpenOpenAlexFDO

Authors Louigi Addario-Berry, Nicolas Broutin, Christina Goldschmidt

Publication date 26 April 2012

Published in Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00440-010-0325-4

zbMATH Keywords

bijectioncontinuum random treediameterdistances in critical random graphsGromov-Hausdorff distancerandom graphsrandom walksscaling limits

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Random walks on graphs (05C81) Combinatorial probability (60C05)

Recommendations

• Critical random graphs: limiting constructions and distributional properties
• Scaling limit for the random walk on the largest connected component of the critical random graph
• Continuum limit of critical inhomogeneous random graphs
• A local limit theorem for the critical random graph
• Scaling limit of dynamical percolation on critical Erdős-Rényi random graphs

Cites work

• A combinatorial theorem for stochastic processes
• A course in metric geometry
• A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
• A Unified View of Graph Searching
• Brownian excursion area, wright's constants in graph enumeration, and other Brownian areas
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Component behavior near the critical point of the random graph process
• Critical percolation on random regular graphs
• Critical random graphs and the structure of a minimum spanning tree
• Critical random graphs: Diameter and mixing time
• Critical random graphs: limiting constructions and distributional properties
• Critical random hypergraphs: the emergence of a giant set of identifiable vertices
• Depth-First Search and Linear Graph Algorithms
• Depth-first search as a combinatorial correspondence
• Diameters in supercritical random graphs via first passage percolation
• Enumerating graphs and Brownian motion
• scientific article; zbMATH DE number 1713116 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 5730481 (Why is no real title available?)
• scientific article; zbMATH DE number 3688413 (Why is no real title available?)
• scientific article; zbMATH DE number 19286 (Why is no real title available?)
• scientific article; zbMATH DE number 1515832 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 1380601 (Why is no real title available?)
• scientific article; zbMATH DE number 1859371 (Why is no real title available?)
• scientific article; zbMATH DE number 798854 (Why is no real title available?)
• scientific article; zbMATH DE number 227027 (Why is no real title available?)
• scientific article; zbMATH DE number 3274494 (Why is no real title available?)
• Introduction to algorithms
• On a random graph with immigrating vertices: Emergence of the giant component
• On the fluctuations of sums of random variables
• On the height of trees
• On the largest component of the random graph at a nearcritical stage
• 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.
• Random graphs.
• Random real trees
• Random trees and applications
• Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
• The average height of binary trees and other simple trees
• The continuum random tree. I
• The continuum random tree. III
• The critical random graph, with martingales
• The depth first processes of Galton-Watson trees converge to the same Brownian excursion
• The diameter of sparse random graphs
• The diameter of sparse random graphs
• The Distribution of Heights of Binary Trees and Other Simple Trees
• The distribution of the maximum Brownian excursion
• The Evolution of Random Graphs
• The number of connected sparsely edged graphs
• The Structure of a Random Graph at the Point of the Phase Transition
• The total progeny in a branching process and a related random walk
• Uniform bounds for exponential moment of maximum of a Dyck path

Cited in

(71)

• A local limit theorem for the critical random graph
• Exceptional times of the critical dynamical Erdős-Rényi graph
• The scaling limits of the minimal spanning tree and invasion percolation in the plane
• Scaling limits of stochastic processes associated with resistance forms
• The hyperbolic Brownian plane
• Feller property of the multiplicative coalescent with linear deletion
• Network models: structure and function. Abstracts from the workshop held December 10--16, 2017
• Critical random graphs and the differential equations technique
• The size of the giant component in random hypergraphs: a short proof
• Geometry of the minimal spanning tree of a random 3-regular graph
• Limits of multiplicative inhomogeneous random graphs and Lévy trees: limit theorems
• Global lower mass-bound for critical configuration models in the heavy-tailed regime
• Limits of multiplicative inhomogeneous random graphs and Lévy trees: the continuum graphs
• The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees
• Depth first exploration of a configuration model
• Universality for critical heavy-tailed network models: metric structure of maximal components
• Scaling limit of dynamical percolation on critical Erdős-Rényi random graphs
• The eternal multiplicative coalescent encoding via excursions of Lévy-type processes
• Critical percolation on scale-free random graphs: new universality class for the configuration model
• Noise sensitivity of critical random graphs
• Scaling limits of random graphs from subcritical classes: extended abstract
• Tail bounds for the height and width of a random tree with a given degree sequence
• A new encoding of coalescent processes: applications to the additive and multiplicative cases
• Scaling limits of random trees and random graphs
• Scaling limits of random graphs from subcritical classes
• Scaling limit for the random walk on the largest connected component of the critical random graph
• Critical random forests
• The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs
• Diameters in supercritical random graphs via first passage percolation
• Scaling limits and influence of the seed graph in preferential attachment trees
• Anomalous Behavior of Random Walks on Disordered Media
• Critical window for the vacant set left by random walk on the configuration model
• Big jobs arrive early: from critical queues to random graphs
• The probability of unusually large components in the near-critical Erdős-Rényi graph
• Speeding up non-Markovian first-passage percolation with a few extra edges
• Asymptotics of trees with a prescribed degree sequence and applications
• The critical window in random digraphs
• Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems
• A probabilistic approach to the leader problem in random graphs
• On breadth‐first constructions of scaling limits of random graphs and random unicellular maps
• Random graphs: combinatorics, complex networks and disordered systems. Abstracts from the workshop held March 26--31, 2023
• Convergence of blanket times for sequences of random walks on critical random graphs
• The scaling limit of a critical random directed graph
• The probability of unusually large components for critical percolation on random d-regular graphs
• Exact enumeration of satisfiable 2-SAT formulae
• Stable graphs: distributions and line-breaking construction
• Anatomy of a Gaussian giant: supercritical level-sets of the free field on regular graphs
• Scaling Limits of Markov-Branching Trees and Applications
• Multisource invasion percolation on the complete graph
• Models of random subtrees of a graph
• Distances in \(\frac{1}{\|x-y\|^{2d}}\) percolation models for all dimensions
• Geometry of the minimal spanning tree in the heavy-tailed regime: new universality classes
• Critical random graphs: limiting constructions and distributional properties
• On moments of multiplicative coalescents
• The scaling limit of random cubic planar graphs
• Scaling limit of the cluster size distribution for the random current measure on the complete graph
• Epidemics on critical random graphs with heavy-tailed degree distribution
• The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
• Continuum limit of critical inhomogeneous random graphs
• Scaling of components in critical long-range geometric random graphs on the 2-dim torus
• Aging and sub-aging for Bouchaud trap models on resistance metric spaces
• Settling time analysis of a continuum model with finite-time target tracking
• Asymptotic tracking of a continuum target through a continuum model on Riemannian manifolds
• Behavior of the distance exponent for \(\frac{1}{|x-y|^{2d}}\) long-range percolation
• Multiscale genesis of a tiny giant for percolation on scale-free random graphs
• Continuum modeling and analysis of collective motion on Riemannian manifolds
• Scaling limits and universality: critical percolation on weighted graphs converging to an L^3 graphon
• Large random intersection graphs inside the critical window and triangle counts
• Critical cluster volumes in hierarchical percolation
• Subgraph densities and scaling limits of random graphs with a prescribed modular decomposition
• Continuity of the integrated density of states on random length metric graphs

This page was built for publication: The continuum limit of critical random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2428503)