Fast algorithm for detecting community structure in networks.

@article{Newman2004FastAF,
  title={Fast algorithm for detecting community structure in networks.},
  author={Mark E. J. Newman},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  year={2004},
  volume={69 6 Pt 2},
  pages={
          066133
        }
}
  • M. Newman
  • Published 22 September 2003
  • Computer Science, Medicine, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
Many networks display community structure--groups of vertices within which connections are dense but between which they are sparser--and sensitive computer algorithms have in recent years been developed for detecting this structure. These algorithms, however, are computationally demanding, which limits their application to small networks. Here we describe an algorithm which gives excellent results when tested on both computer-generated and real-world networks and is much faster, typically… 

Figures and Topics from this paper

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.
A very fast algorithm for detecting community structures in complex networks
TLDR
A new algorithm is proposed, which uses only local information to analyze community structures in complex networks and demonstrates excellent detection results and very fast processing performance, much faster than the existing comparable algorithms of the same kind.
An Algorithm to Find Overlapping Community Structure in Networks
TLDR
A new algorithm for discovering overlapping communities in networks is presented, by extending Girvan and Newman's well-known algorithm based on the betweennesscentrality measure, which performs hierarchical clustering -- partitioning a network into any desired number of clusters -- but allows them to overlap.
Overview of Algorithms for Detecting Community Structure in Complex Networks
Community structure is a very important property of complex networks. Detecting communities in networks is of great importance in biology, computer science, sociology and so on. In recent years, a
Overview of Algorithms for Detecting Community Structure in Complex Networks
TLDR
Focusing on the improved methods based on the modularity function, the algorithms which can detect overlapping and hierarchical community structure in networks, and the benchmark in detecting communities are reviewed.
A Fast Algorithm to Find Overlapping Communities in Networks
  • S. Gregory
  • Mathematics, Computer Science
    ECML/PKDD
  • 2008
TLDR
This work presents an improved algorithm, CONGA, that could detect overlapping communities using the new concept of split betweenness, which is especially effective in discovering small-diameter communities in large networks, and has a time complexity of only O(nlog n) for sparse networks.
On Community Detection in Very Large Networks
TLDR
New data structures and a new implementation of a well known agglomerative greedy algorithm to find community structure in large networks, the CNM algorithm are proposed and results show that the improved data structures speedup the method by a large factor, making it competitive with other state of the art algorithms.
A class of improved algorithms for detecting communities in complex networks
Detecting communities in complex networks is of considerable importance for understanding both the structure and function of the networks. Here, we propose a class of improved algorithms for
Finding Community Structure Based on Subgraph Similarity
TLDR
This paper proposes a new metric to quantify the structural similarity between subgraphs, based on which an algorithm for community identification is designed, and proposes a hybrid algorithm that can simultaneously enhance modularity and save computational time compared with the CNM algorithm.
Detecting Communities in Massive Networks Based on Local Community Attractive Force Optimization
  • Qi Ye, B. Wu, Yuan Gao, Bai Wang
  • Mathematics, Computer Science
    2010 International Conference on Advances in Social Networks Analysis and Mining
  • 2010
TLDR
A heuristic algorithm to extract the community structure in large networks based on local community attractive force optimization whose time complexity is near linear and space complexity is linear is proposed.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 45 REFERENCES
Finding and evaluating community structure in networks.
  • M. Newman, M. Girvan
  • Computer Science, Physics
    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.
Community structure in social and biological networks
  • M. Girvan, M. Newman
  • Physics, 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.
The Structure and Function of Complex Networks
  • M. Newman
  • Physics, Computer Science
    SIAM Rev.
  • 2003
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.
The structure of scientific collaboration networks.
  • M. Newman
  • Medicine, Physics
    Proceedings of the National Academy of Sciences of the United States of America
  • 2001
TLDR
It is shown that these collaboration networks form "small worlds," in which randomly chosen pairs of scientists are typically separated by only a short path of intermediate acquaintances.
Email as spectroscopy: automated discovery of community structure within organizations
TLDR
A betweenness centrality algorithm is used that can rapidly find communities within a graph representing information flows that is effective at identifying true communities, both formal and informal, within these scale-free graphs.
Statistical mechanics of complex networks
TLDR
A simple model based on these two principles was able to reproduce the power-law degree distribution of real networks, indicating a heterogeneous topology in which the majority of the nodes have a small degree, but there is a significant fraction of highly connected nodes that play an important role in the connectivity of the network.
Self-similar community structure in a network of human interactions.
TLDR
The results reveal the self-organization of the network into a state where the distribution of community sizes is self-similar, suggesting that a universal mechanism, responsible for emergence of scaling in other self-organized complex systems, as, for instance, river networks, could also be the underlying driving force in the formation and evolution of social 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.
The emergent properties of a dolphin social network
  • D. Lusseau
  • Computer Science, Physics
    Proceedings of the Royal Society of London. Series B: Biological Sciences
  • 2003
TLDR
Despite its small size, the Doubtful Sound community of bottlenose dolphins has the same characteristics of a scale-free power-law network, and the ability for two individuals to be in contact is unaffected by the random removal of individuals.
Exploring complex networks
TLDR
This work aims to understand how an enormous network of interacting dynamical systems — be they neurons, power stations or lasers — will behave collectively, given their individual dynamics and coupling architecture.
...
1
2
3
4
5
...