Hostname: page-component-cb9f654ff-5jtmz Total loading time: 0 Render date: 2025-08-21T16:53:48.095Z Has data issue: false hasContentIssue false

Contiguity and remote contiguity of some random graphs

Published online by Cambridge University Press:  19 August 2025

Bas J. K. Kleijn*
Affiliation:
University of Amsterdam
Stefano Rizzelli*
Affiliation:
University of Padova
*
*Postal address: Korteweg-de Vries Institute of Mathematics, University of Amsterdam, P.O. Box 94248, Amsterdam, 1090 GE, The Netherlands. Email: B.Kleijn@uva.nl
**Postal address: Department of Statistics, University of Padova, Via Battisti, 241, Padova, 35121, Italy. Email: stefano.rizzelli@unipd.it

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.

Information

Type
Original Article
Copyright
© The Author(s), 2025. Published by Cambridge University Press on behalf of Applied Probability Trust

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Bollobás, B., Janson, S. and Riordan, O. (2007). The phase transition in inhomogeneous random graphs. Random Structures Algorithms 31, 3122.10.1002/rsa.20168CrossRefGoogle Scholar
Erdös, P. and Rényi, A. (1959). On random graphs I. Publicationes Mathematicae Debrecen 6, 290297.10.5486/PMD.1959.6.3-4.12CrossRefGoogle Scholar
Falk, M., Padoan, S. A. and Rizzelli, S. (2020). Strong convergence of multivariate maxima. J. Appl. Prob. 57, 314331.10.1017/jpr.2019.100CrossRefGoogle Scholar
Greenwood, P. E. and Shiryaev, A. N. (1985). Contiguity and the Statistical Invariance Principle. Gordon and Breach, Philadelphia, PA.Google Scholar
Janson, S. (1995). Random regular graphs: Asymptotic distributions and contiguity. Combinatorics, Prob. Comput. 4, 369405.10.1017/S0963548300001735CrossRefGoogle Scholar
Janson, S. (2010). Asymptotic equivalence and contiguity of some random graphs. Random Structures Algorithms 36, 2645.10.1002/rsa.20297CrossRefGoogle Scholar
Kleijn, B. J. K. (2021). Frequentist validity of Bayesian limits. Ann. Statist. 49, 182202.10.1214/20-AOS1952CrossRefGoogle Scholar
Le Cam, L. (1960). Locally Asymptotically Normal Families of Distributions: Certain Approximations to Families of Distributions and Their Use in the Theory of Estimation and Testing Hypotheses (Pub. Statist. 3). University of California Press, Berkeley, CA.Google Scholar
Le Cam, L. (1986). Asymptotic Methods in Statistical Decision Theory. Springer, New York.10.1007/978-1-4612-4946-7CrossRefGoogle Scholar
Le Cam, L. and Yang, G. (2000). Asymptotics in Statistics: Some Basic Concepts. Springer, New York.10.1007/978-1-4612-1166-2CrossRefGoogle Scholar
Padoan, S. A. and Rizzelli, S. (2022). Consistency of Bayesian inference for multivariate max-stable distributions. Ann. Statist. 50, 14901518.10.1214/21-AOS2160CrossRefGoogle Scholar
Roussas, G. G. (1972). Contiguity of Probability Measures: Some Applications in Statistics. Cambridge University Press.10.1017/CBO9780511804373CrossRefGoogle Scholar
van der Hofstad, R. (2016). Random Graphs and Complex Networks (Camb. Ser. Statist. Prob. Math. 1). Cambridge University Press.10.1017/9781316779422CrossRefGoogle Scholar