If a random graph with degree sequence D has o(sqrt(m)) degree-1 vertices and o(m) degree-2 vertices, it is connected with high probability; with no degree-1 or -2 vertices the disconnection probability is O(n^4/m^6).
How to determine if a random graph with a fixed degree sequence has a giant component.Probability Theory and Related Fields, 170(1):263–310
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
What is The Probability That A Random Graph With A Given Degree Sequence is Connected?
If a random graph with degree sequence D has o(sqrt(m)) degree-1 vertices and o(m) degree-2 vertices, it is connected with high probability; with no degree-1 or -2 vertices the disconnection probability is O(n^4/m^6).