Sparse Graphs Using Exchangeable Random Measures
Abstract
Statistical network modelling has focused on representing the graph as a discrete structure, namely the adjacency matrix. When assuming exchangeability of this array—which can aid in modelling, computations and theoretical analysis—the Aldous–Hoover theorem informs us that the graph is necessarily either dense or empty. We instead consider representing the graph as an exchangeable random measure and appeal to the Kallenberg representation theorem for this object. We explore using completely random measures (CRMs) to define the exchangeable random measure, and we show how our CRM construction enables us to achieve sparse graphs while maintaining the attractive properties of exchangeability. We relate the sparsity of the graph to the Lévy measure defining the CRM. For a specific choice of CRM, our graphs can be tuned from dense to sparse on the basis of a single parameter. We present a scalable Hamiltonian Monte Carlo algorithm for posterior inference, which we use to analyse network properties in a range of real data sets, including networks with hundreds of thousands of nodes and millions of edges.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Sep 23, 2017
- Source ID
- 10.1111/rssb.12233
Entities
People
- Emily B. Fox
- François Caron
Organizations
- Air Force Office of Scientific Research
- Alan Turing Institute
- University of Oxford
- University of Washington