The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Narrow scope for resolution-limit-free community detection
Open accessAbstract
Detecting communities in large networks has drawn much attention over the years. While modularity remains one of the more popular methods of community detection, the so-called resolution limit remains a significant drawback. To overcome this issue, it was recently suggested that instead of comparing the network to a random null model, as is done in modularity, it should be compared to a constant factor. However, it is unclear what is meant exactly by "resolution-limit-free," that is, not suffering from the resolution limit. Furthermore, the question remains what other methods could be classified as resolution-limit-free. In this paper we suggest a rigorous definition and derive some basic properties of resolution-limit-free methods. More importantly, we are able to prove exactly which class of community detection methods are resolution-limit-free. Furthermore, we analyze which methods are not resolution-limit-free, suggesting there is only a limited scope for resolution-limit-free community detection methods. Finally, we provide such a natural formulation, and show it performs superbly.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fast unfolding of communities in large networks
Blondel, V. D., Guillaume, J.-L., Lambiotte, R., & Lefebvre, E. (2008) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2008/10/p10008 · Cited by 21,424
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Functional cartography of complex metabolic networks
Guimerà, R., & Nunes Amaral, L. A. (2005) · Nature · doi:10.1038/nature03288 · Cited by 3,983
Near linear time algorithm to detect community structures in large-scale networks
Raghavan, U. N., Albert, R., & Kumara, S. (2007) · Physical Review E · doi:10.1103/physreve.76.036106 · Cited by 3,502
Lazer, D., Pentland, A., Adamic, L., Aral, S., Barabási, A.-L., Brewer, D., Christakis, N., Contractor, N., Fowler, J., Gutmann, M., et al. (2009) · Science · doi:10.1126/science.1167742 · Cited by 3,365
Benchmark graphs for testing community detection algorithms
Lancichinetti, A., Fortunato, S., & Radicchi, F. (2008) · Physical Review E · doi:10.1103/physreve.78.046110 · Cited by 3,051
Resolution limit in community detection
Fortunato, S., & Barthélemy, M. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0605965104 · Cited by 3,024
Community detection algorithms: A comparative analysis
Lancichinetti, A., & Fortunato, S. (2009) · Physical Review E · doi:10.1103/physreve.80.056117 · Cited by 2,177
Cited by
From Louvain to Leiden: guaranteeing well-connected communities
Traag, V. A., Waltman, L., & van Eck, N. J. (2019) · Scientific Reports · doi:10.1038/s41598-019-41695-z · Cited by 5,635
“In this paper, we show that the Louvain algorithm has a major problem, for both modularity and CPM.”
BackgroundMethodInfluentialSelf-citationCitation-based clustering of publications using CitNetExplorer and VOSviewer
van Eck, N. J., & Waltman, L. (2017) · Scientometrics · doi:10.1007/s11192-017-2300-7 · Cited by 2,664
Community detection in networks: a user guide
Fortunato, S., & Hric, D. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.09.002 · Cited by 2,086
A smart local moving algorithm for large-scale modularity-based community detection
Waltman, L., & van Eck, N. J. (2013) · The European Physical Journal B · doi:10.1140/epjb/e2013-40829-0 · Cited by 1,088
A new methodology for constructing a publication‐level classification system of science
Waltman, L., & van Eck, N. J. (2012) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.22748 · Cited by 661
Betzel, R. F., & Bassett, D. S. (2017) · NeuroImage · doi:10.1016/j.neuroimage.2016.11.006 · Cited by 587
A single-cell atlas of chromatin accessibility in the human genome
Zhang, K., Hocker, J. D., Miller, M., Hou, X., Chiou, J., Poirion, O. B., Qiu, Y., Li, Y. E., Gaulton, K. J., Wang, A., et al. (2021) · Cell · doi:10.1016/j.cell.2021.10.024 · Cited by 502
Limits of modularity maximization in community detection
Lancichinetti, A., & Fortunato, S. (2011) · Physical Review E · doi:10.1103/physreve.84.066122 · Cited by 495
Robust detection of dynamic community structure in networks
Bassett, D. S., Porter, M. A., Wymbs, N. F., Grafton, S. T., Carlson, J. M., & Mucha, P. J. (2013) · Chaos: An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.4790830 · Cited by 425
Random Walks, Markov Processes and the Multiscale Modular Organization of Complex Networks
Lambiotte, R., Delvenne, J.-C., & Barahona, M. (2014) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2015.2391998 · Cited by 398
Faskowitz, J., Esfahlani, F. Z., Jo, Y., Sporns, O., & Betzel, R. F. (2020) · Nature Neuroscience · doi:10.1038/s41593-020-00719-y · Cited by 324
Community Detection via Maximization of Modularity and Its Variants
Chen, M., Kuzmin, K., & Szymanski, B. K. (2014) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2014.2307458 · Cited by 301
Reconfiguration of Cortical Networks in MDD Uncovered by Multiscale Community Detection with fMRI
He, Y., Lim, S., Fortunato, S., Sporns, O., Zhang, L., Qiu, J., Xie, P., & Zuo, X.-N. (2018) · Cerebral Cortex · doi:10.1093/cercor/bhx335 · Cited by 54
“By adjusting the value of γ from low to high, one can detect few large-size communities to more numerous small-size communities, which also corresponds to the “constant Potts model” (Traag et al. 2011) suitable for networks based on correlation matrices (MacMahon and Garlaschelli 2015).”
BackgroundMagnetic eigenmaps for community detection in directed networks
Fanuel, M., Alaíz, C. M., & Suykens, J. A. K. (2017) · Physical Review E · doi:10.1103/physreve.95.022302 · Cited by 50
“Indeed, a general framework was developed in [5], and later, a specific Potts model was explained to have no resolution limit [6].”
BackgroundFarooqui, A., Tazyeen, S., Ahmed, M. M., Alam, A., Ali, S., Malik, M. Z., Ali, S., & Ishrat, R. (2018) · Scientific Reports · doi:10.1038/s41598-018-28375-0 · Cited by 30
Community detection in network neuroscience
Betzel, R. F. (2020) · arXiv · doi:10.48550/arxiv.2011.06723 · Cited by 24
Metadata
- Authors
- Traag, V. A., Van Dooren, P., & Nesterov, Y.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2011-07-29
- Volume
- 84
- Issue
- 1
- Pages
- 016114-016114
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2033947830
- Cited by
- 353
- References
- 31
- FWCI
- 10.95
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.