A Bayesian Approach to Network Modularity

09/21/2007
by   Jake M. Hofman, et al.
0

We present an efficient, principled, and interpretable technique for inferring module assignments and for identifying the optimal number of modules in a given network. We show how several existing methods for finding modules can be described as variant, special, or limiting cases of our work, and how the method overcomes the resolution limit problem, accurately recovering the true number of modules. Our approach is based on Bayesian methods for model selection which have been used with success for almost a century, implemented using a variational technique developed only in the past decade. We apply the technique to synthetic and real networks and outline how the method naturally allows selection among competing models.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/09/2016

Nonparametric Bayesian inference of the microcanonical stochastic block model

A principled approach to characterize the hidden structure of networks i...
research
06/25/2020

Statistical inference of assortative community structures

We develop a principled methodology to infer assortative communities in ...
research
11/13/2018

Towards Characterising Bayesian Network Models under Selection

Real-life statistical samples are often plagued by selection bias, which...
research
05/23/2016

Bayesian Model Selection of Stochastic Block Models

A central problem in analyzing networks is partitioning them into module...
research
09/12/2018

Bayesian sparse reconstruction: a brute-force approach to astronomical imaging and machine learning

We present a principled Bayesian framework for signal reconstruction, in...
research
10/16/2019

On the complexity of acyclic modules in automata networks

Modules were introduced as an extension of Boolean automata networks. Th...

Please sign up or login with your details

Forgot password? Click here to reset