Module Detection Algorithms
Module Detection Algorithms is a computational method that identifies densely connected subgroups within complex networks by optimizing partitioning criteria to distinguish modular structures from random connectivity patterns.
166
Publications
34.1K
Citations
490
Authors
305
Institutions
Publications per year
2017–2026
58
Variants
Community Detection Algorithms
Parents
166
Community Structure in Directed Networks
E. A. Leicht, M. E. J. Newman · Physical Review Letters · 2008 · 1.1K citations · Full text
Overlapping community detection at scale
Jaewon Yang, Jure Leskovec · 2013 · 875 citations
1–5 of 166
490
University at Buffalo, State University of New York, United States
7 publications · 434 citations
7
h-index
University at Buffalo, State University of New York, United States
4 publications · 287 citations
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 490
305
University at Buffalo, State University of New York
Buffalo, United States
8 h-index
23 publications
2K citations

Chinese Academy of Sciences
Beijing, China
7 h-index
19 publications
2.5K citations

Xidian University
Xi'an, China
6 h-index
18 publications
602 citations
University of Michigan
Ann Arbor, United States
5 h-index
7 publications
19.6K citations
Institute for Complex Systems
Rome, Italy
4 h-index
7 publications
390 citations
Academy of Mathematics and Systems Science
Beijing, China
4 h-index
13 publications
2K citations
University of Oxford
Oxford, United Kingdom
4 h-index
10 publications
1.8K citations
University of California, Los Angeles
Los Angeles, United States
4 h-index
5 publications
235 citations
1–8 of 305
PRE · 9 publications · 7.3K citations
9
h-index
8 publications · 344 citations
8
h-index
8 publications · 597 citations
8
h-index
6 publications · 290 citations
6
h-index
4 publications · 392 citations
4
h-index
1–5