On the normality of giant components

DOI10.1002/rsa.20464zbMath1278.05226OpenAlexW1922039484MaRDI QIDQ2868084

Taral Guldahl Seierstad

Publication date: 23 December 2013

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

Full work available at URL: https://doi.org/10.1002/rsa.20464

zbMATH Keywords

central limit theoremrandom graphdifferential equation methodgiant component

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80)

Related Items

The fluctuations of the giant cluster for percolation on random split trees ⋮ Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs ⋮ Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey

Cites Work

• Unnamed Item
• Birth control for giants
• A central limit theorem via differential equations
• Dependent central limit theorems and invariance principles
• Differential equations for random processes and random graphs
• On the Fluctuations of the Giant Component
• The order of the giant component of random hypergraphs
• On tree census and the giant component in sparse random graphs
• Random Graph Processes with Degree Restrictions
• Connectedness of graphs generated by a random d-process
• Convergence of Achlioptas Processes via Differential Equations with Unique Solutions
• Phase transition of the minimum degree random multigraph process
• The connectivity threshold for the min‐degree random graph process
• On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$