An old approach to the giant component problem

DOI10.1016/j.jctb.2015.03.002zbMath1315.05123arXiv1209.3691OpenAlexW3098786156MaRDI QIDQ2347852

Béla Bollobás, Oliver Riordan

Publication date: 10 June 2015

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

random graphssprinklingconfiguration modelgiant component

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items

Epidemic spreading and equilibrium social distancing in heterogeneous networks, Mesoscopic scales in hierarchical configuration models, Depth first exploration of a configuration model, Chase-escape on the configuration model, A Dynamic Contagion Risk Model with Recovery Features, Phase transition in random intersection graphs with communities, Contagion risks and security investment in directed networks, Locality of random digraphs on expanders, Largest component of subcritical random graphs with given degree sequence, On the Method of Typical Bounded Differences, Random graphs with given vertex degrees and switchings, Asymptotic normality in random graphs with given vertex degrees, How to determine if a random graph with a fixed degree sequence has a giant component, Giant Component in Random Multipartite Graphs with Given Degree Sequences, Component structure of the configuration model: Barely supercritical case, The probability that a random multigraph is simple. II, Counting triangles in power-law uniform random graphs, Percolation on Random Graphs with a Fixed Degree Sequence, On local weak limit and subgraph counts for sparse random graphs, Critical percolation on random regular graphs

Cites Work

• Unnamed Item
• Edge percolation on a random regular graph of low degree
• On percolation in random graphs with given vertex degrees
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• The Phase Transition in the Configuration Model
• The scaling window for a random graph with a given degree sequence
• A new approach to the giant component problem
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• A critical point for random graphs with a given degree sequence
• The phase transition in inhomogeneous random graphs
• The Critical Phase for Random Graphs with a Given Degree Sequence
• Thek-Core and Branching Processes
• Percolation on Sparse Random Graphs with Given Degree Sequence
• The giant component threshold for random regular graphs with edge faults H. Prodinger