Sparse graphs using exchangeable random measures

01/06/2014
by   François Caron, et al.
0

Statistical network modeling has focused on representing the graph as a discrete structure, namely the adjacency matrix, and considering the exchangeability of this array. In such cases, the Aldous-Hoover representation theorem (Aldous, 1981;Hoover, 1979 applies and informs us that the graph is necessarily either dense or empty. In this paper, we instead consider representing the graph as a measure on R_+^2. For the associated definition of exchangeability in this continuous space, we rely on the Kallenberg representation theorem (Kallenberg, 2005). We show that for certain choices of such exchangeable random measures underlying our graph construction, our network process is sparse with power-law degree distribution. In particular, we build on the framework of completely random measures (CRMs) and use the theory associated with such processes to derive important network properties, such as an urn representation for our analysis and network simulation. Our theoretical results are explored empirically and compared to common network models. We then present a Hamiltonian Monte Carlo algorithm for efficient exploration of the posterior distribution and demonstrate that we are able to recover graphs ranging from dense to sparse--and perform associated tests--based on our flexible CRM-based formulation. We explore network properties in a range of real datasets, including Facebook social circles, a political blogosphere, protein networks, citation networks, and world wide web networks, including networks with hundreds of thousands of nodes and millions of edges.

READ FULL TEXT

page 35

page 37

research
02/05/2016

Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities

We propose a novel statistical model for sparse networks with overlappin...
research
05/17/2020

Truncated Self-Product Measures in Edge-Exchangeable Networks

Edge-exchangeable probabilistic network models generate edges as an i.i....
research
03/22/2016

Completely random measures for modeling power laws in sparse graphs

Network data appear in a number of applications, such as online social n...
research
11/20/2017

Non-exchangeable random partition models for microclustering

Many popular random partition models, such as the Chinese restaurant pro...
research
02/27/2019

Nonnegative Bayesian nonparametric factor models with completely random measures for community detection

We present a Bayesian nonparametric Poisson factorization model for mode...
research
12/20/2017

A comprehensive statistical study of metabolic and protein-protein interaction network properties

Understanding the mathematical properties of graphs underling biological...
research
07/28/2017

Centrality measures for graphons

Graphs provide a natural mathematical abstraction for systems with pairw...

Please sign up or login with your details

Forgot password? Click here to reset