An elementary approach to component sizes in critical random graphs

DOI10.1017/jpr.2022.13zbMath1503.05109arXiv2101.06625OpenAlexW4308918461MaRDI QIDQ5049906

Umberto De Ambroggio

Publication date: 14 November 2022

Published in: Journal of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

random walkballot theorem

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Sums of independent random variables; random walks (60G50) Combinatorial probability (60C05) Random walks on graphs (05C81)

Related Items (3)

Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems ⋮ The probability of unusually large components for critical percolation on random \(d\)-regular graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Component evolution in random intersection graphs
• The critical random graph, with martingales
• A note on the component structure in random intersection graphs with tunable clustering
• Evolution of a modified binomial random graph by agglomeration
• On the largest component of the random graph at a nearcritical stage
• Connected components in random graphs with given expected degree sequences
• Critical behavior in inhomogeneous random graphs
• The phase transition in random graphs: A simple proof
• Asymptotic equivalence and contiguity of some random graphs
• Critical percolation on random regular graphs
• The Hitting Time Theorem Revisited
• The Volume of the Giant Component of a Random Graph with Given Expected Degrees
• RANDOM INTERSECTION GRAPHS WITH TUNABLE DEGREE DISTRIBUTION AND CLUSTERING
• The Structure of a Random Graph at the Point of the Phase Transition
• Critical percolation on random regular graphs
• The Average Distance in a Random Graph with Given Expected Degrees
• Inhomogeneous random graphs, isolated vertices, and Poisson approximation
• The vertex degree distribution of random intersection graphs
• The probability of unusually large components in the near-critical Erdős–Rényi graph
• The phase transition in inhomogeneous random graphs
• On a conditionally Poissonian graph process

This page was built for publication: An elementary approach to component sizes in critical random graphs