skip to content
 

Estimating the number of communities in a network

Presented by: 
Gesine Reinert University of Oxford
Date: 
Wednesday 27th July 2016 - 09:30 to 10:00
Venue: 
INI Seminar Room 1
Abstract: 
Community detection has been a main topic in the analysis of networks. While there exist a range of powerful and flexible methods for dividing a network into a specified number of communities, it is an open question how to determine exactly how many communities one should use. We answer this question based on a combination of methods from Bayesian analysis and statistical physics. We demonstrate the approach on a range of real-world examples with known community structure, finding that it is able to determine the number of communities correctly in every case.  

This is joint work with Mark Newman (University of Michigan) 
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.
Presentation Material: 
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons