Asymptotic normality in random graphs with given vertex degrees

DOI10.1002/rsa.20905zbMath1451.05212arXiv1812.08063OpenAlexW3028470672WikidataQ126379194 ScholiaQ126379194MaRDI QIDQ5128753

Svante Janson

Publication date: 26 October 2020

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

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

zbMATH Keywords

method of momentsconfiguration modelasymptotic normality of giant componentrandom graph with given degrees, number of tree components.simple random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30)

Related Items

Random graphs with given vertex degrees and switchings, A stochastic SIR network epidemic model with preventive dropping of edges, Central limit theorems for SIR epidemics and percolation on configuration model random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic behavior of some statistics in Ewens random permutations
• Susceptibility of random graphs with given vertex degrees
• How to determine if a random graph with a fixed degree sequence has a giant component
• Asymptotic normality of the size of the giant component via a random walk
• Generating simple random graphs with prescribed degree distribution
• Asymptotic normality of the \(k\)-core in random graphs
• The asymptotic distribution of short cycles in random regular graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• A central limit theorem for decomposable random variables with applications to random graphs
• Central limit theorems in the configuration model
• Counting connected graphs inside-out
• Weighted dependency graphs
• The asymptotic variance of the giant component of configuration model random graphs
• Limit laws for self-loops and multiple edges in the configuration model
• An old approach to the giant component problem
• Monotonicity, asymptotic normality and vertex degrees in random graphs
• The Phase Transition in the Configuration Model
• On a Method of Calculation of Semi-Invariants
• The Probability That a Random Multigraph is Simple
• A new approach to the giant component problem
• Poisson convergence and random graphs
• On tree census and the giant component in sparse random graphs
• 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 probability that a random multigraph is simple. II
• Law of large numbers for the SIR epidemic on a random graph with given degrees
• On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$
• Probability: A Graduate Course