A local limit theorem for the critical random graph

DOI10.1214/ECP.v14-1451zbMath1185.05129MaRDI QIDQ1038943

Tobias Müller, Wouter Kager, Remco van der Hofstad

Publication date: 20 November 2009

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/223629

zbMATH Keywords

local limit theoremERdoes-Renyi random graphs

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Related Items (7)

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 ⋮ A moment-generating formula for Erdős-Rényi component sizes ⋮ Cluster tails for critical power-law inhomogeneous random graphs ⋮ Critical epidemics, random graphs, and Brownian motion with a parabolic drift ⋮ The probability of unusually large components in the near-critical Erdős–Rényi graph ⋮ Correction to: ``Random graph asymptotics on high-dimensional tori. II: Volume, diameter and mixing time

This page was built for publication: A local limit theorem for the critical random graph