Completely random measures for modeling power laws in sparse graphs
Diana Cai, Tamara Broderick

TL;DR
This paper introduces a new framework using completely random measures to model power-law behaviors in sparse graphs, addressing the need for scalable models that reflect real-world network properties.
Contribution
It proposes a novel graph generative model based on completely random measures that considers instantiating existing atoms as data grows, extending prior work by Caron and Fox.
Findings
Model exhibits desirable asymptotic power-law behavior
Framework captures both existing members and new nodes in networks
Simulations support the model's scalability and power-law properties
Abstract
Network data appear in a number of applications, such as online social networks and biological networks, and there is growing interest in both developing models for networks as well as studying the properties of such data. Since individual network datasets continue to grow in size, it is necessary to develop models that accurately represent the real-life scaling properties of networks. One behavior of interest is having a power law in the degree distribution. However, other types of power laws that have been observed empirically and considered for applications such as clustering and feature allocation models have not been studied as frequently in models for graph data. In this paper, we enumerate desirable asymptotic behavior that may be of interest for modeling graph data, including sparsity and several types of power laws. We outline a general framework for graph generative models…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Stochastic processes and statistical mechanics · Bayesian Methods and Mixture Models
