Contiguity and remote contiguity of some random graphs

Abstract

Asymptotic properties of random graph sequences, like occurrence of a giant component or full connectivity in Erdős-Rényi graphs, are usually derived with very specific choices for defining parameters. The question arises to which extent those parameters choices may be perturbed, without losing the asymptotic property. Writing $(P_n)$ and $(Q_n)$ for two sequences of graph distributions, asymptotic equivalence (convergence in total-variation) and contiguity ($P_n(A_n)=o(1) \implies Q_n(A_n)=o(1)$) have been considered by (Janson, 2010) and others; here we use so-called remote contiguity (for some fixed $a_n\downarrow 0$, $P_n(A_n)=o(a_n) \implies Q_n(A_n)=o(1)$) to show that connectivity properties are preserved in more heavily perturbed Erdős-Rényi graphs. The techniques we demonstrate with random graphs here, extend to general asymptotic properties, e.g. in more complex large-graph limits, scaling limits, large-sample limits, etc.

Theorems & Definitions (27)

• Theorem 2.1
• Lemma 3.1
• Proposition 3.2
• Remark 3.3
• Lemma 3.4
• Lemma 3.5
• Lemma 3.6
• Lemma 3.7
• Remark 3.8
• Corollary 3.9