How to determine if a random graph with a fixed degree sequence has a giant component
Preprint
Abstract
For a fixed degree sequence $\mathcal{D}=(d_1,...,d_n)$, let $G(\mathcal{D})$ be a uniformly chosen (simple) graph on $\{1,...,n\}$ where the vertex $i$ has degree $d_i$. In this paper we determine whether $G(\mathcal{D})$ has a giant component, essentially imposing no conditions on $\mathcal{D}$. We simply insist that the sum of the degrees in $\mathcal{D}$ which are not 2 is at least $\lambda(n)$ for some function $\lambda$ going to infinity with $n$. This is a relatively minor technical condition, and the typical structure of $G(\mathcal{D})$ when $\mathcal{D}$ does not satisfy this condition, is simple and also discussed.
Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- An old approach to the giant component problemJournal of Combinatorial Theory, Series B, 2015
- The scaling window for a random graph with a given degree sequenceRandom Structures & Algorithms, 2012
- Critical percolation on random regular graphsRandom Structures & Algorithms, 2009
- The Critical Phase for Random Graphs with a Given Degree SequenceCombinatorics, Probability and Computing, 2008
- Sampling Regular Graphs and a Peer-to-Peer NetworkCombinatorics, Probability and Computing, 2007
- Distances in random graphs with infinite mean degreesExtremes, 2005
- Distances in random graphs with finite variance degreesRandom Structures & Algorithms, 2005
- The cores of random hypergraphs with a given degree sequenceRandom Structures & Algorithms, 2004
- A critical point for random graphs with a given degree sequenceRandom Structures & Algorithms, 1995
- Some problems in the enumeration of labelled graphsBulletin of the Australian Mathematical Society, 1980