Critical random graphs and the differential equations technique

DOI10.1007/s13226-017-0249-0zbMath1384.05137OpenAlexW2782271697MaRDI QIDQ1745674

Shankar Bhamidi, Sanchayan Sen, Amarjit Budhiraja

Publication date: 18 April 2018

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13226-017-0249-0

zbMATH Keywords

branching processescritical random graphsconfiguration modelbounded-size rulesmultiplicative coalescentcontinuum random treeinhomogeneous random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cites Work

• On the largest component in the subcritical regime of the Bohman-Frieze process
• A note on the Gromov-Hausdorff-Prokhorov distance between (locally) compact metric measure spaces
• Achlioptas process phase transitions are continuous
• The component sizes of a critical random graph with given degree sequence
• The augmented multiplicative coalescent, bounded size rules and critical dynamics of random graphs
• Critical window for the configuration model: finite third moment degrees
• Phase transitions for modified Erdős--Rényi processes
• The continuum random tree. I
• Rayleigh processes, real trees, and root growth with re-grafting
• Birth control for giants
• Random trees and applications
• Brownian excursion area, wright's constants in graph enumeration, and other Brownian areas
• Differential equation approximations for Markov chains
• On percolation in random graphs with given vertex degrees
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Strong approximation theorems for density dependent Markov chains
• The asymptotic number of labeled graphs with given degree sequences
• Brownian excursions, critical random graphs and the multiplicative coalescent
• The scaling limit of the minimum spanning tree of the complete graph
• Differential equations for random processes and random graphs
• The continuum random tree. III
• The continuum limit of critical random graphs
• Avoiding a giant component
• The Phase Transition in the Configuration Model
• Critical percolation on random regular graphs
• The evolution of subcritical Achlioptas processes
• Percolation
• A new approach to the giant component problem
• The Evolution of Random Graphs
• Component behavior near the critical point of the random graph process
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• Aggregation models with limited choice and the multiplicative coalescent
• The birth of the giant component
• The phase transition in inhomogeneous random graphs
• The Phase Transition in the Erdős-Rényi Random Graph Process
• Percolation on Sparse Random Graphs with Given Degree Sequence
• Explosive Percolation in Random Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Critical random graphs and the differential equations technique