Random graphs with given vertex degrees and switchings

DOI10.1002/rsa.20911zbMath1451.05211arXiv1901.09744OpenAlexW3006106000MaRDI QIDQ5120739

Svante Janson

Publication date: 16 September 2020

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

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

zbMATH Keywords

asymptotic normalityrandom graphsswitchingscontiguityconfiguration model

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Vertex degrees (05C07)

Related Items

Making multigraphs simple by a sequence of double edge swaps, Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity, Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs, Central limit theorems for SIR epidemics and percolation on configuration model random graphs, Central limit theorem for statistics of subcritical configuration models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to determine if a random graph with a fixed degree sequence has a giant component
• Generating simple random graphs with prescribed degree distribution
• Enumeration of graphs with a heavy-tailed degree sequence
• 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
• Central limit theorems in the configuration model
• The asymptotic variance of the giant component of configuration model random graphs
• An old approach to the giant component problem
• Random Graphs and Complex Networks
• The Phase Transition in the Configuration Model
• The scaling window for a random graph with a given degree sequence
• Asymptotic equivalence and contiguity of some random graphs
• Uniform generation of random regular graphs of moderate degree
• The Probability That a Random Multigraph is Simple
• A new approach to the giant component problem
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• Uniform generation of random graphs with power-law degree sequences
• A critical point for random graphs with a given degree sequence
• Uniform Generation of Random Regular Graphs
• Asymptotic normality in random graphs with given vertex degrees
• Component structure of the configuration model: Barely supercritical case
• The probability that a random multigraph is simple. II
• On the Chromatic Number of Random Graphs with a Fixed Degree Sequence
• Probability: A Graduate Course
• Generating random regular graphs