Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2501.09511 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915982270791680 |
|---|---|
| author | Eriksson, Edward |
| author_facet | Eriksson, Edward |
| contents | We characterize some asymptotic properties of edge exchangeable random graphs in terms of the measure used to generate them. In particular, we give a necessary and sufficient condition for eventual forever connectedness, a sufficient condition for asymptotic normality of the vertex count, and a necessary and sufficient condition for the produced graph to be eventually forever almost complete. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_09511 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Edge Exchangeable Graphs: Connectedness, Gaussianity and Completeness Eriksson, Edward Probability 60C05 We characterize some asymptotic properties of edge exchangeable random graphs in terms of the measure used to generate them. In particular, we give a necessary and sufficient condition for eventual forever connectedness, a sufficient condition for asymptotic normality of the vertex count, and a necessary and sufficient condition for the produced graph to be eventually forever almost complete. |
| title | Edge Exchangeable Graphs: Connectedness, Gaussianity and Completeness |
| topic | Probability 60C05 |
| url | https://arxiv.org/abs/2501.09511 |