Fast unfolding of communities in large networks
By Vincent D. Blondel, Jean-Loup Guillaume, Renaud Lambiotte, Etienne Lefebvre. 2008
20,244 citations recorded by the source corpus.
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.
Subfields: Computer Networks and Communications, Statistical and Nonlinear Physics, Algorithms & Complexity, Network Science & Complex Systems
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Santo Fortunato
- Binghui Wang
- Neil Zhenqiang Gong
- Olaf Sporns
- Tiago P. Peixoto
- Ludo Waltman
- Nees Jan van Eck
- Marc Barthelemy
In Statistical and Nonlinear Physics
- Olaf Sporns
- Santo Fortunato
- D. Bassett
- Jure Leskovec
- Richard F. Betzel
- Darko Hric
- M. A. Porter
- Ludo Waltman
In Algorithms & Complexity
- Olaf Sporns
- Ludo Waltman
- Nees Jan van Eck
- David M. Beskow
- M. A. Porter
- Marc Barthelemy
- Peter J. Mucha
- Santo Fortunato
In Network Science & Complex Systems
- Olaf Sporns
- Ludo Waltman
- Nees Jan van Eck
- Santo Fortunato
- Mark Newman
- Marc Barthelemy
- D. Bassett
- E. Bullmore
Citations in the corpus
- Debiasing Community Detection: The Importance of Lowly Connected Nodes (2019, methodology): “We use two state-of-the-art approaches, CESNA [21], and the Louvain method [3].”
- Stereotyping and Bias in the Flickr30K Dataset (2016, methodology): “Following this, I applied Louvain clustering (Blondel et al., 2008) to the coreference graph, resulting in clusters of expressions that refer to similar entities.”
- Community detection in graphs (2009, methodology): “Blondel et al. have analyzed a network of mobile phone 87 communications between users of a Belgian phone operator (Blondel et al., 2008).”
- Song recommendation with non-negative matrix factorization and graph total variation (2016, methodology): “The quality of the playlist graph is measured by partitioning the graph using the standard Louvain’s method [21].”
- DeepST: identifying spatial domains in spatial transcriptomics by deep learning (2022, methodology): “Traditional non-spatial clustering algorithms, such as K-means and Louvain (4), take gene expression data as input, resulting in clusters that hardly correspond with tissue sections.”
- Green supply chain management: A review and bibliometric analysis (2015, background): “, 2004) of networks, identifying topics, interrelations, an increasing attention from scholars turning it into a critical resear (Blondel et al., 2008).”
- Intrinsic and task-evoked network architectures of the human brain. (2014, positive): “(B) A standard community detection approach (Blondel et al., 2008) was used to partition multitask and resting-state FC into putative functional brain systems.”
- Using Geodesic Space Density Gradients for Network Community Detection (2017, methodology): “[4], Markov Cluster algorithm (MCL) [48], Infomap [47], Cfinder [42], fast greedy modularity optimization by Clauset et al.”
- From Local to Global: A Graph RAG Approach to Query-Focused Summarization (2024, background): “…we focus on a previously unexplored quality of graphs in this context: their inherent modularity (Newman, 2006) and the ability of community detection algorithms to partition graphs into modular communities of closely-related nodes (e.g., Louvain, Blondel et al., 2008; Leiden, Traag et al., 2019).”