A new approach to the giant component problem

DOI10.1002/rsa.20231zbMath1177.05110arXiv0707.1786MaRDI QIDQ3619612

Publication date: 8 April 2009

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

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

zbMATH Keywords

random graph; empirical distribution; giant component; death process

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

05C07: Vertex degrees

Related Items

Nonuniversality of weighted random graphs with infinite variance degree, Unnamed Item, A New Random Graph Model with Self-Optimizing Nodes: Connectivity and Diameter, Percolation on Random Graphs with a Fixed Degree Sequence, A functional central limit theorem for SI processes on configuration model graphs, Random graphs with given vertex degrees and switchings, Asymptotic normality in random graphs with given vertex degrees, First passage percolation on sparse random graphs with boundary weights, Component structure of the configuration model: Barely supercritical case, The front of the epidemic spread and first passage percolation, Law of large numbers for the SIR epidemic on a random graph with given degrees, Critical Window for Connectivity in the Configuration Model, On local weak limit and subgraph counts for sparse random graphs, Phase transition in random intersection graphs with communities, Locality of random digraphs on expanders, Metastability of the Potts ferromagnet on random regular graphs, Largest component of subcritical random graphs with given degree sequence, Diffusion and cascading behavior in random networks, The component sizes of a critical random graph with given degree sequence, Near-critical SIR epidemic on a random graph with given degrees, A weighted configuration model and inhomogeneous epidemics, How to determine if a random graph with a fixed degree sequence has a giant component, The largest component in a subcritical random graph with a power law degree distribution, The tail does not determine the size of the giant, When is a scale-free graph ultra-small?, Critical random graphs and the differential equations technique, Weighted distances in scale-free configuration models, First passage percolation on random graphs with finite mean degrees, Number of edges in inhomogeneous random graphs, Explicit bounds for critical infection rates and expected extinction times of the contact process on finite random graphs, Global lower mass-bound for critical configuration models in the heavy-tailed regime, The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees, Rare event asymptotics for exploration processes for random graphs, Depth first exploration of a configuration model, Chase-escape on the configuration model, Universality for critical heavy-tailed network models: metric structure of maximal components, Percolation on complex networks: theory and application, Preferential attachment without vertex growth: emergence of the giant component, The diameter of weighted random graphs, An old approach to the giant component problem, The structure of typical clusters in large sparse random configurations, Ising critical exponents on random trees and graphs, Critical percolation on scale-free random graphs: new universality class for the configuration model, Critical behavior in inhomogeneous random graphs, A general critical condition for the emergence of a giant component in random graphs with given degrees, Critical window for the vacant set left by random walk on random regular graphs, The scaling window for a random graph with a given degree sequence, Birds of a feather or opposites attract - effects in network modelling, Giant Component in Random Multipartite Graphs with Given Degree Sequences

Cites Work