Community structure in social and biological networks
Michelle Girvan,Mark Newman +1 more
Reads0
Chats0
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.Abstract:
A number of recent studies have focused on the statistical properties of networked systems such as social networks and the Worldwide Web. Researchers have concentrated particularly on a few properties that seem to be common to many networks: the small-world property, power-law degree distributions, and network transitivity. In this article, we highlight another property that is found in many networks, the property of community structure, in which network nodes are joined together in tightly knit groups, between which there are only looser connections. We propose a method for detecting such communities, built around the idea of using centrality indices to find community boundaries. We test our method on computer-generated and real-world graphs whose community structure is already known and find that the method detects this known structure with high sensitivity and reliability. We also apply the method to two networks whose community structure is not well known—a collaboration network and a food web—and find that it detects significant and informative community divisions in both cases.read more
Citations
More filters
Journal ArticleDOI
Combining complex networks and data mining: Why and how
Massimiliano Zanin,David Papo,Pedro Sousa,Ernestina Menasalvas,Andrea Nicchi,Elaine Kubik,Stefano Boccaletti +6 more
TL;DR: The starting point of this review is that these two fields can in fact advantageously be used in a synergistic manner, and that this state of affairs should be put down to contingent rather than conceptual differences.
Journal ArticleDOI
Detecting criminal organizations in mobile phone networks
TL;DR: This work provides a theoretical framework for the problem of detecting and characterizing criminal organizations in networks reconstructed from phone call records and introduces an expert system to support law enforcement agencies in the task of unveiling the underlying structure of criminal networks hidden in communication data.
Journal ArticleDOI
Organization of excitable dynamics in hierarchical biological networks.
TL;DR: The results demonstrate that two principal topological aspects of hierarchical networks, node centrality and network modularity, correlate with the network activity patterns at different levels of spontaneous network activation.
Journal ArticleDOI
Cascaded failures in weighted networks.
TL;DR: It is found that the networks in which the weight of each edge is the multiplication of the betweenness centrality of the end nodes had the best robustness against cascaded failures.
Journal ArticleDOI
Functional community analysis of brain: a new approach for EEG-based investigation of the brain pathology.
Mehran Ahmadlou,Hojjat Adeli +1 more
TL;DR: A new methodology for investigation of the SBFC and understanding of the brain based on graph theory and community pattern analysis of functional connectivity graph of thebrain obtained from encephalograms (EEGs).
References
More filters
Journal ArticleDOI
Collective dynamics of small-world networks
TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Journal ArticleDOI
Emergence of Scaling in Random Networks
TL;DR: A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Book
Network Flows: Theory, Algorithms, and Applications
TL;DR: In-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models are presented.
Journal ArticleDOI
A Set of Measures of Centrality Based on Betweenness
TL;DR: A family of new measures of point and graph centrality based on early intuitions of Bavelas (1948) is introduced in this paper, which define centrality in terms of the degree to which a point falls on the shortest path between others and there fore has a potential for control of communication.
Journal ArticleDOI
Exploring complex networks
TL;DR: 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.