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

random graphsvertex degreesusceptibilitymean cluster size

Mathematics Subject Classification ID

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

(13)

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