2008
DOI: 10.1088/1742-5468/2008/10/p10008
|View full text |Cite
|
Sign up to set email alerts
|

Fast unfolding of communities in large networks

Abstract: 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 o… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

55
12,241
2
289

Year Published

2013
2013
2022
2022

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 15,717 publications
(13,280 citation statements)
references
References 52 publications
55
12,241
2
289
Order By: Relevance
“…For each element of the set S * for 1, q m = we shall construct a set of index elements by formula (8). As a result, we shall obtain:…”
Section: A Methods For the Clustering Of Publications Of Scientists Bymentioning
confidence: 99%
See 1 more Smart Citation
“…For each element of the set S * for 1, q m = we shall construct a set of index elements by formula (8). As a result, we shall obtain:…”
Section: A Methods For the Clustering Of Publications Of Scientists Bymentioning
confidence: 99%
“…The task on the graph clustering has been studied rather sufficiently and there are many methods to solve this problem. One of the algorithms for solving a graph clustering problem is the algorithm Louvain, which is described in article [8]. This algorithm implements a method for maximizing graph modularity and can be used for rapid clustering of graphs with large dimensionality.…”
Section: Literature Review and Problem Statementmentioning
confidence: 99%
“…In particular, since information about team members are not provided on GitHub (we know that all the developers in the network are involved in the same project, but we do not know how the workload is distributed among them), we ran a modularity algorithm, based on the algorithms developed by Blonde [5] and Lambiotte [17], to obtain the communities (teams in this specific case) present in the network. Blonde et al [5] proposed a method to extract the community structure of large networks. It is a heuristic method that is based on modularity optimisation.…”
Section: Issue Collaboration Graphmentioning
confidence: 99%
“…The brain has many such modules where, for instance, neurons in the occipital lobe link mostly to other neurons within that lobe, but also integrate with other regions of the brain allowing the broader coordination and assimilation of vision [51][52][53]. Here, I used the Gephi [44] implementation of the Louvain method [54] to study the BMB program, searching for the optimal partition under the formation of two communities.…”
Section: Connected Components and Other Knowledge Communitiesmentioning
confidence: 99%