Critical Window for Connectivity in the Configuration Model

DOI10.1017/S0963548317000177zbMath1371.05263arXiv1603.03254MaRDI QIDQ5366967

Remco van der Hofstad, Lorenzo Federico

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

connectivity probabilityasymptotic probability

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Asymptotic enumeration (05A16) Connectivity (05C40)

Related Items

The Threshold of Symmetry in Random Graphs with Specified Degree Sequences, Mixing times of random walks on dynamic configuration models, When is a scale-free graph ultra-small?, On the modularity of 3‐regular random graphs and random graphs with given degree sequences, Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity, Connectivity of Poissonian inhomogeneous random multigraphs, Unnamed Item, Unnamed Item, Tight fluctuations of weight-distances in random graphs with infinite-variance degrees, The parabolic Anderson model on a Galton-Watson tree, Limit theorems for assortativity and clustering in null models for scale-free networks

Cites Work

• The largest component in a subcritical random graph with a power law degree distribution
• Tutorial on large deviations for the binomial distribution
• The asymptotic connectivity of labelled regular graphs
• Random Graphs and Complex Networks
• 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
• A critical point for random graphs with a given degree sequence
• Paths in graphs
• The probability that a random multigraph is simple. II
• Unnamed Item
• Unnamed Item