Susceptibility of random graphs with given vertex degrees

DOI10.4310/JOC.2010.V1.N4.A2MaRDI QIDQ547869zbMATH OpenFDO

Authors Svante Janson

Publication date 27 June 2011

Published in Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

mean cluster sizerandom graphssusceptibilityvertex degree

Mathematics Subject Classification ID

Vertex degrees (05C07) Random graphs (graph-theoretic aspects) (05C80) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Abstract: We study the susceptibility, i.e., the mean cluster size, in random graphs with given vertex degrees. We show, under weak assumptions, that the susceptibility converges to the expected cluster size in the corresponding branching process. In the supercritical case, a corresponding result holds for the modified susceptibility ignoring the giant component and the expected size of a finite cluster in the branching process; this is proved using a duality theorem. The critical behaviour is studied. Examples are given where the critical exponents differ on the subcritical and supercritical sides.

Recommendations

• Susceptibility in inhomogeneous random graphs
• Susceptibility in subcritical random graphs
• The Critical Phase for Random Graphs with a Given Degree Sequence
• Random subgraphs of finite graphs: I. The scaling window under the triangle condition
• A critical point for random graphs with a given degree sequence

Cited in

(15)

• Mesoscopic scales in hierarchical configuration models
• Global lower mass-bound for critical configuration models in the heavy-tailed regime
• Universality for critical heavy-tailed network models: metric structure of maximal components
• Heavy-tailed configuration models at criticality
• Preferential attachment without vertex growth: emergence of the giant component
• Critical percolation on scale-free random graphs: new universality class for the configuration model
• Duality in inhomogeneous random graphs, and the cut metric
• Susceptibility in subcritical random graphs
• Susceptibility in inhomogeneous random graphs
• Asymptotic normality in random graphs with given vertex degrees
• Central limit theorem for statistics of subcritical configuration models
• Random subgraphs of finite graphs: I. The scaling window under the triangle condition
• Universal `winner-takes-it-all' phenomenon in scale-free random graphs
• Phase transitions for modified Erdős--Rényi processes
• Near-critical bipartite configuration models and their associated intersection graphs

This page was built for publication: Susceptibility of random graphs with given vertex degrees

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