Edge Exchangeable Graphs: Connectedness, Gaussianity and Completeness
Probability
2026-05-07 v2
Abstract
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.
Keywords
Cite
@article{arxiv.2501.09511,
title = {Edge Exchangeable Graphs: Connectedness, Gaussianity and Completeness},
author = {Edward Eriksson},
journal= {arXiv preprint arXiv:2501.09511},
year = {2026}
}