Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2402.11334 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914683392360448 |
|---|---|
| author | Kleijn, B. J. K. Rizzelli, S. |
| author_facet | Kleijn, B. J. K. Rizzelli, S. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_11334 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Contiguity and remote contiguity of some random graphs Kleijn, B. J. K. Rizzelli, S. Probability 05C80, 05C40, 60B10, 60G30 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. |
| title | Contiguity and remote contiguity of some random graphs |
| topic | Probability 05C80, 05C40, 60B10, 60G30 |
| url | https://arxiv.org/abs/2402.11334 |