Statistically optimal graph partition method based on modularity

Graph theory provides a formal framework to investigate the functional and structural connectome of the brain. We extend previous work on modularity-based graph partitioning methods that are able to detect network community structures. We estimate the conditional expected network, provide exact analytical solutions for a Gaussian random network, and also demonstrate that this network is the best unbiased linear estimator even when the Gaussian assumption is violated. We use the conditional expected network to partition graphs, and demonstrate its performance in simulations, a real network dataset, and a structural brain connectivity network.

[1]  Maurizio Corbetta,et al.  The human brain is intrinsically organized into dynamic, anticorrelated functional networks. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[2]  O. Sporns,et al.  Mapping the Structural Core of Human Cerebral Cortex , 2008, PLoS biology.

[3]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[4]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[5]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[7]  V. Carchiolo,et al.  Extending the definition of modularity to directed graphs with overlapping communities , 2008, 0801.1647.

[8]  M. P. van den Heuvel,et al.  Normalized Cut Group Clustering of Resting-State fMRI Data , 2008, PloS one.