Contiguity and remote contiguity of some random graphs
Open Access
- 19 August 2025
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 63 (1) , 316-333
Abstract
Asymptotic properties of random graph sequences, like the occurrence of a giant component or full connectivity in Erdös–Rényi graphs, are usually derived with very specific choices for the defining parameters. The question arises as to what extent those parameter choices may be perturbed without losing the asymptotic property. For two sequences of graph distributions, asymptotic equivalence (convergence in total variation) and contiguity have been considered by Janson (2010) and others; here we use so-called remote contiguity to show that connectivity properties are preserved in more heavily perturbed Erdös–Rényi graphs. The techniques we demonstrate here with random graphs also extend to general asymptotic properties, e.g. in more complex large-graph limits, scaling limits, large-sample limits, etc.Keywords
This publication has 12 references indexed in Scilit:
- Consistency of Bayesian inference for multivariate max-stable distributionsThe Annals of Statistics, 2022
- Frequentist validity of Bayesian limitsThe Annals of Statistics, 2021
- Strong convergence of multivariate maximaJournal of Applied Probability, 2020
- Random Graphs and Complex Networks2016
- Asymptotic equivalence and contiguity of some random graphsRandom Structures & Algorithms, 2009
- The phase transition in inhomogeneous random graphsRandom Structures & Algorithms, 2007
- Asymptotics in Statistics2000
- Random Regular Graphs: Asymptotic Distributions and ContiguityCombinatorics, Probability and Computing, 1995
- Asymptotic Methods in Statistical Decision Theory1986
- Contiguity of Probability Measures1972