Extends a CRM-based sparse graph model from vertex-exchangeable to edge-exchangeable framework to achieve extreme sparsity where edges scale near-linearly with nodes.
Edge Exchangeable Graphs: Connectedness, Gaussianity and Completeness
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
fields
math.ST 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Generative Model for Extremely Sparse Edge-Exchangeable Networks
Extends a CRM-based sparse graph model from vertex-exchangeable to edge-exchangeable framework to achieve extreme sparsity where edges scale near-linearly with nodes.