Modularity and community structure in networks.

@article{Newman2006ModularityAC,
  title={Modularity and community structure in networks.},
  author={Mark E. J. Newman},
  journal={Proceedings of the National Academy of Sciences of the United States of America},
  year={2006},
  volume={103 23},
  pages={
          8577-82
        }
}
  • M. Newman
  • Published 17 February 2006
  • Computer Science
  • Proceedings of the National Academy of Sciences of the United States of America
Many networks of interest in the sciences, including social networks, computer networks, and metabolic and regulatory networks, are found to divide naturally into communities or modules. [] Key Method Here I show that the modularity can be expressed in terms of the eigenvectors of a characteristic matrix for the network, which I call the modularity matrix, and that this expression leads to a spectral algorithm for community detection that returns results of demonstrably higher quality than competing methods…

Figures and Tables from this paper

Finding community structure in networks using the eigenvectors of matrices.
  • M. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2006
TLDR
A modularity matrix plays a role in community detection similar to that played by the graph Laplacian in graph partitioning calculations, and a spectral measure of bipartite structure in networks and a centrality measure that identifies vertices that occupy central positions within the communities to which they belong are proposed.
Z-Score-Based Modularity for Community Detection in Networks
TLDR
A new quality function for community detection called Z-modularity is obtained that measures the Z-score of a given partition with respect to the fraction of the number of edges within communities and mitigates the resolution limit of the original modularity in certain cases.
Graph spectra and the detectability of community structure in networks
TLDR
Using methods from random matrix theory, the spectra of networks that display community structure are calculated, and it is shown that spectral modularity maximization is an optimal detection method in the sense that no other method will succeed in the regime where the modularity method fails.
Community identification in networks with unbalanced structure.
TLDR
This paper introduces a metric to characterize the community structure better than other metrics in this situation, and proposes a method to infer the number of communities, which may solve the resolution limit problem.
The Importance of Community
TLDR
The role of modularity in organizing the collective dynamics of social networks is explored, which may have important implications for understanding the process of consensus formation through individuals affecting the opinions of their neighbours via interactions through the links of the social network.
Asymptotic distribution of modularity in networks
TLDR
For a specific partition of a given network, it is shown that the distribution of modularity under a null hypothesis of free labeling is asymptotically normal when the size of the network gets large.
Walk-modularity and community structure in networks
TLDR
A natural generalization of modularity based on the difference between the actual and expected number of walks within clusters, which is referred to as walk-modularity, is explored and returns significantly improved results compared to traditional modularity maximization.
Modularity-based community detection in large networks: An empirical evaluation
  • Haoming Li, Wenye Li, Jiaqi Tan
  • Computer Science
    2014 IEEE International Conference on Information and Automation (ICIA)
  • 2014
TLDR
This work applied a constrained power method for modularity optimization for large-scale networks and was able to find the community structures on a desktop computer with a single CPU in less than one hour yet with high accuracy, the first result reported in literature by conventional computing approaches.
Finding network communities using modularity density
TLDR
A detailed analysis of a recently proposed function, namely modularity density, is presented, showing that it does not incur in the drawbacks suffered by traditional modularity, and that it can identify networks without ground-truth community structure, deriving its analytical dependence on link density in generic random graphs.
A Comparison of Methods for Community Detection in Large Scale Networks
TLDR
The main goal of this work is to show a comparative study of some of the state-of-art methods for community detection in large scale networks using modularity maximization, taking into account not just the quality of the provided partitioning, but the computational cost associated to the method.
...
...

References

SHOWING 1-10 OF 62 REFERENCES
Finding and evaluating community structure in networks.
  • M. Newman, M. Girvan
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
TLDR
It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.
Defining and identifying communities in networks.
TLDR
This article proposes a local algorithm to detect communities which outperforms the existing algorithms with respect to computational cost, keeping the same level of reliability and applies to a network of scientific collaborations, which, for its size, cannot be attacked with the usual methods.
Community structure in social and biological networks
  • M. Girvan, M. Newman
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
TLDR
This article proposes a method for detecting communities, built around the idea of using centrality indices to find community boundaries, and tests it on computer-generated and real-world graphs whose community structure is already known and finds that the method detects this known structure with high sensitivity and reliability.
Detecting community structure in networks
TLDR
A number of more recent algorithms that appear to work well with real-world network data, including algorithms based on edge betweenness scores, on counts of short loops in networks and on voltage differences in resistor networks are described.
Finding community structure in very large networks.
TLDR
A hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a network with n vertices and m edges is O (md log n) where d is the depth of the dendrogram describing the community structure.
Fast algorithm for detecting community structure in networks.
  • M. Newman
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
TLDR
An algorithm is described which gives excellent results when tested on both computer-generated and real-world networks and is much faster, typically thousands of times faster, than previous algorithms.
The Structure and Function of Complex Networks
TLDR
Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
Community detection in complex networks using extremal optimization.
  • J. Duch, A. Arenas
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2005
TLDR
The method outperforms the optimal modularity found by the existing algorithms in the literature and is feasible to be used for the accurate identification of community structure in large complex networks.
Subnetwork hierarchies of biochemical pathways
TLDR
A method to decompose biochemical networks into subnetworks based on the global geometry of the network is presented and is applied to 43 organisms from the WIT database.
Network motifs: simple building blocks of complex networks.
TLDR
Network motifs, patterns of interconnections occurring in complex networks at numbers that are significantly higher than those in randomized networks, are defined and may define universal classes of networks.
...
...