On the normality of giant components

DOI10.1002/RSA.20464zbMATH Open1278.05226OpenAlexW1922039484MaRDI QIDQ2868084FDOQ2868084

Authors: 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

Recommendations

• The limit distribution of the size of a giant component in an Internet-type random graph
• Asymptotic normality of the size of the giant component in a random hypergraph
• A new approach to the giant component problem
• Giant components in random graphs
• Asymptotic normality of the size of the giant component via a random walk

zbMATH Keywords

central limit theoremrandom graphdifferential equation methodgiant component

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Dependent central limit theorems and invariance principles
• Differential equations for random processes and random graphs
• The order of the giant component of random hypergraphs
• Random Graph Processes with Degree Restrictions
• Birth control for giants
• The connectivity threshold for the min‐degree random graph process
• On the fluctuations of the giant component
• On tree census and the giant component in sparse random graphs
• On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$
• Connectedness of graphs generated by a random d-process
• A central limit theorem via differential equations
• Phase transition of the minimum degree random multigraph process
• Convergence of Achlioptas processes via differential equations with unique solutions

Cited In (7)

• On the fluctuations of the giant component
• Asymptotic normality of the size of the giant component in a random hypergraph
• Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs
• The limit distribution of the size of a giant component in an Internet-type random graph
• The fluctuations of the giant cluster for percolation on random split trees
• Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey
• Asymptotic normality of the size of the giant component via a random walk

This page was built for publication: On the normality of giant components

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