Near linear time algorithm to detect community structures in large-scale networks.
TL;DR: This paper investigates a simple label propagation algorithm that uses the network structure alone as its guide and requires neither optimization of a predefined objective function nor prior information about the communities.
Abstract: Community detection and analysis is an important methodology for understanding the organization of various real-world networks and has applications in problems as diverse as consensus formation in social communities or the identification of functional modules in biochemical networks. Currently used algorithms that identify the community structures in large-scale real-world networks require a priori information such as the number and sizes of communities or are computationally expensive. In this paper we investigate a simple label propagation algorithm that uses the network structure alone as its guide and requires neither optimization of a predefined objective function nor prior information about the communities. In our algorithm every node is initialized with a unique label and at every step each node adopts the label that most of its neighbors currently have. In this iterative process densely connected groups of nodes form a consensus on a unique label to form communities. We validate the algorithm by applying it to networks whose community structures are known. We also demonstrate that the algorithm takes an almost linear time and hence it is computationally less expensive than what was possible so far.
Citations
More filters
28 Jul 2005
TL;DR: PfPMP1）与感染红细胞、树突状组胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作�ly.
Abstract: 抗原变异可使得多种致病微生物易于逃避宿主免疫应答。表达在感染红细胞表面的恶性疟原虫红细胞表面蛋白1（PfPMP1）与感染红细胞、内皮细胞、树突状细胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作用。每个单倍体基因组var基因家族编码约60种成员，通过启动转录不同的var基因变异体为抗原变异提供了分子基础。
18,940 citations
TL;DR: This work proposes a heuristic method that is shown to outperform all other known community detection methods in terms of computation time and the quality of the communities detected is very good, as measured by the so-called modularity.
Abstract: We propose a simple method to extract the community structure of large networks. Our method is a heuristic method that is based on modularity optimization. It is shown to outperform all other known community detection method in terms of computation time. Moreover, the quality of the communities detected is very good, as measured by the so-called modularity. This is shown first by identifying language communities in a Belgian mobile phone network of 2.6 million customers and by analyzing a web graph of 118 million nodes and more than one billion links. The accuracy of our algorithm is also verified on ad-hoc modular networks. .
13,519 citations
TL;DR: In this paper, the authors proposed a simple method to extract the community structure of large networks based on modularity optimization, which is shown to outperform all other known community detection methods in terms of computation time.
Abstract: We propose a simple method to extract the community structure of large networks. Our method is a heuristic method that is based on modularity optimization. It is shown to outperform all other known community detection methods in terms of computation time. Moreover, the quality of the communities detected is very good, as measured by the so-called modularity. This is shown first by identifying language communities in a Belgian mobile phone network of 2 million customers and by analysing a web graph of 118 million nodes and more than one billion links. The accuracy of our algorithm is also verified on ad hoc modular networks.
11,078 citations
TL;DR: A thorough exposition of community structure, or clustering, is attempted, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists.
Abstract: The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of the same cluster and comparatively few edges joining vertices of different clusters. Such clusters, or communities, can be considered as fairly independent compartments of a graph, playing a similar role like, e. g., the tissues or the organs in the human body. Detecting communities is of great importance in sociology, biology and computer science, disciplines where systems are often represented as graphs. This problem is very hard and not yet satisfactorily solved, despite the huge effort of a large interdisciplinary community of scientists working on it over the past few years. We will attempt a thorough exposition of the topic, from the definition of the main elements of the problem, to the presentation of most methods developed, with a special focus on techniques designed by statistical physicists, from the discussion of crucial issues like the significance of clustering and how methods should be tested and compared against each other, to the description of applications to real networks.
9,057 citations
Cites methods from "Near linear time algorithm to detec..."
...[322] have designed a simple and fast method based on label propagation....
[...]
TL;DR: A thorough exposition of the main elements of the clustering problem can be found in this paper, with a special focus on techniques designed by statistical physicists, from the discussion of crucial issues like the significance of clustering and how methods should be tested and compared against each other, to the description of applications to real networks.
8,432 citations
References
More filters
28 Jul 2005
TL;DR: PfPMP1）与感染红细胞、树突状组胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作�ly.
Abstract: 抗原变异可使得多种致病微生物易于逃避宿主免疫应答。表达在感染红细胞表面的恶性疟原虫红细胞表面蛋白1（PfPMP1）与感染红细胞、内皮细胞、树突状细胞以及胎盘的单个或多个受体作用，在黏附及免疫逃避中起关键的作用。每个单倍体基因组var基因家族编码约60种成员，通过启动转录不同的var基因变异体为抗原变异提供了分子基础。
18,940 citations
Book•
[...]
01 Sep 1985
7,736 citations
"Near linear time algorithm to detec..." refers background in this paper
...In case of homogeneous networks such as Erdős - Rényi random graphs [31] that do not have community structures, the label propagation algorithm identifies the giant connected component of these graphs as a single community....
[...]
...Even in the case of Erdős - Rényi random graphs [31] with n between 100 and 10000 and average degree 4, which do not have community structures, by iteration 5, 95% of the nodes or more are classified correctly....
[...]
Book•
30 Dec 1991
TL;DR: In this article, the development of social network analysis, tracing its origins in classical sociology and its more recent formulation in social scientific and mathematical work, is described and discussed. But it is argued that the analysis of social networks is not a purely static process.
Abstract: This paper reports on the development of social network analysis, tracing its origins in classical sociology and its more recent formulation in social scientific and mathematical work. It is argued...
6,366 citations
01 Jan 2012
TL;DR: Social networks operate on many levels, from families up to the level of nations, and play a critical role in determining the way problems are solved, organizations are run, and the degree to which individuals achieve their goals.
Abstract: This book introduces the non-specialist reader to the principal ideas, nature and purpose of social network analysis. Social networks operate on many levels, from families up to the level of nations, and play a critical role in determining the way problems are solved, organizations are run, and the degree to which individuals achieve their goals. Social network theory maps these relationships between individual actors. Though relatively new on the scene it has become hugely influential across the social sciences. Assuming no prior knowledge of quantitative sociology, this book presents the key ideas in context through examples and illustrations. Using a structured approach to understanding work in this area, John Scott signposts further reading and online sources so readers can develop their knowledge and skills to become practitioners of this research method. A series of Frequently Asked Questions takes the reader through the main objections raised against social network analysis and answers the various queries that will come up once the reader has worked their way through the book.
5,439 citations
01 Jan 1994
419 citations
"Near linear time algorithm to detec..." refers background in this paper
...Cliques capture the intuitive notion of a community [6] where every node is related to every other node and hence have strong similarities with each other....
[...]
...One of the ways to measure the strength of a community is by comparing the density of edges observed within the community with the density of edges in the network as a whole [6]....
[...]
...Other definitions based on degrees of nodes can be found in [6]....
[...]
...It is usually thought of as a group where nodes are densely inter-connected and sparsely connected to other parts of the network [4, 5, 6]....
[...]