Susceptibility in subcritical random graphs

DOI10.1063/1.2982848MaRDI QIDQ3624667zbMATH OpenOpenAlexFDO

Authors Svante Janson, Malwina Luczak

Publication date 30 April 2009

Published in Journal of Mathematical Physics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Abstract: We study the evolution of the susceptibility in the subcritical random graph $G(n,p)$ as $n$ tends to infinity. We obtain precise asymptotics of its expectation and variance, and show it obeys a law of large numbers. We also prove that the scaled fluctuations of the susceptibility around its deterministic limit converge to a Gaussian law. We further extend our results to higher moments of the component size of a random vertex, and prove that they are jointly asymptotically normal.

Recommendations

• Susceptibility of random graphs with given vertex degrees
• Susceptibility in inhomogeneous random graphs
• Random subgraphs of finite graphs: I. The scaling window under the triangle condition
• scientific article; zbMATH DE number 6327467
• The evolution of subcritical Achlioptas processes

Cites work

• A derivation of the Borel distribution
• A functional limit theorem for random graphs with applications to subgraph count statistics
• A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
• Asymptotic normality of the \(k\)-core in random graphs
• Ballots, queues and random graphs
• Birth control for giants
• Brownian excursions, critical random graphs and the multiplicative coalescent
• Functional limit theorems for multitype branching processes and generalized Pólya urns.
• Probability: A Graduate Course
• Random graph dynamics
• The Multiplicative Process
• The total progeny in a branching process and a related random walk
• Univariate Discrete Distributions

Cited in

(20)

• Central limit theorems in the configuration model
• A moment-generating formula for Erdős-Rényi component sizes
• On the critical probability in percolation
• Geometry of the minimal spanning tree of a random 3-regular graph
• Noise sensitivity of critical random graphs
• Asymptotic analysis for the number of subgraphs of a given size in temporal random graphs.
• Random subgraph counts and U-statistics: multivariate normal approximation via exchangeable pairs and embedding
• Susceptibility in inhomogeneous random graphs
• Modularity of Erdős-Rényi random graphs
• Central limit theorem for statistics of subcritical configuration models
• Susceptibility of random graphs with given vertex degrees
• Bounded-size rules: the barely subcritical regime
• Goodness-of-fit test for count distributions with finite second moment
• A probabilistic approach to the leader problem in random graphs
• A variant of the Erdős–Rényi random graph process
• Parking on Cayley trees and frozen Erdős-Rényi
• Mean-field Potts and random-cluster dynamics from high-entropy initializations
• Noise sensitivity of the minimum spanning tree of the complete graph
• Phase transitions for modified Erdős--Rényi processes
• Cutoff for the Swendsen-Wang dynamics on the complete graph

This page was built for publication: Susceptibility in subcritical random graphs

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