skip to content
 

Sparse and modular networks using exchangeable random measures

Presented by: 
Francois Caron University of Oxford
Date: 
Monday 11th July 2016 - 15:30 to 16:00
Venue: 
INI Seminar Room 1
Abstract: 
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, it is well known that the graph is necessarily either dense (the number of edges scales quadratically with the number of nodes) or trivially empty.
Here, we instead consider representing the graph as a measure on the plane. For the associated definition of exchangeability, we rely on the Kallenberg representation theorem (Kallenberg, 1990). For certain choices of such exchangeable random measures underlying the graph construction, the network process is sparse with power-law degree distribution, and can accommodate an overlapping block-structure.
A Markov chain Monte Carlo algorithm is derived for efficient exploration of the posterior distribution and allows to recover the structure of a range of networks ranging from dense to sparse based on our flexible formulation.

Joint work with Emily Fox and Adrien Todeschini
http://arxiv.org/abs/1401.1137
http://arxiv.org/pdf/1602.02114

The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons