On the Spread of Random Graphs

DOI10.1017/S0963548314000248zbMath1301.60010arXiv0902.1156MaRDI QIDQ5495672

Svante Janson, Louigi Addario-Berry, Colin J. H. McDiarmid

Publication date: 6 August 2014

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

random graphspreadrandom regular graphsmall world

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Matchings in random regular bipartite digraphs
• Size and connectivity of the \(k\)-core of a random graph
• An asymptotic isoperimetric inequality
• Renormalization group analysis of the small-world network model
• Negative association of random variables, with applications
• The sub-Gaussian constant and concentration inequalities
• A simple solution to the k‐core problem
• Component behavior near the critical point of the random graph process
• Cycles in a random graph near the critical point
• Balls and bins: A study in negative dependence
• Diameters in Supercritical Random Graphs Via First Passage Percolation
• The Diameter of Sparse Random Graphs
• Collective dynamics of ‘small-world’ networks