University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > Sampling sufficiency for determining modularity.

## Sampling sufficiency for determining modularity.Add to your list(s) Download to your calendar using vCal - Fiona Skerman (University of Bristol)
- Thursday 16 January 2020, 15:00-16:00
- Watson LTC.
If you have a question about this talk, please contact Richard Montgomery. Modularity is used in popular algorithms for community detection. For a given network G, each partition of the vertices has a modularity score, with higher values indicating that the partition better
captures community structure in G. The (max) modularity q We analyse when community structure of an underlying network can be determined from its observed network. In a natural model where we suppose edges in an underlying graph G appear with some probability in our observed graph G’ we describe how high a sampling probability we need to infer the community structure of the underlying network. Joint work with Colin McDiarmid. This talk is part of the Combinatorics and Probability Seminar series. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsCentre for Computational Biology Seminar Series Type the title of a new list here Applied Mathematics Seminar Series## Other talksOn Hamilton cycles in highly symmetric graphs TBA Generalised hydrodynamics and universalities of transport in integrable (and non-integrable) spin chains Best Response Dynamics on Random Graphs Gaussian processes techniques for non-linear multidimensional dynamical systems TBA |