Critical window for connectivity in the configuration model

Research output: Contribution to journalArticleAcademicpeer-review

7 Citations (Scopus)

Abstract

We identify the asymptotic probability of a configuration model CMn(d) producing a connected graph within its critical window for connectivity that is identified by the number of vertices of degree 1 and 2, as well as the expected degree. In this window, the probability that the graph is connected converges to a non-trivial value, and the size of the complement of the giant component weakly converges to a finite random variable. Under a finite second moment condition we also derive the asymptotics of the connectivity probability conditioned on simplicity, from which follows the asymptotic number of simple connected graphs with a prescribed degree sequence.

Original languageEnglish
Pages (from-to)660-680
Number of pages21
JournalCombinatorics, Probability and Computing
Volume26
Issue number5
DOIs
Publication statusPublished - 1 Sep 2017

Fingerprint Dive into the research topics of 'Critical window for connectivity in the configuration model'. Together they form a unique fingerprint.

  • Cite this