The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Unfolding communities in large complex networks: Combining defensive and offensive label propagation for core extraction
Open accessAbstract
Label propagation has proven to be a fast method for detecting communities in large complex networks. Recent developments have also improved the accuracy of the approach; however, a general algorithm is still an open issue. We present an advanced label propagation algorithm that combines two unique strategies of community formation, namely, defensive preservation and offensive expansion of communities. The two strategies are combined in a hierarchical manner to recursively extract the core of the network and to identify whisker communities. The algorithm was evaluated on two classes of benchmark networks with planted partition and on 23 real-world networks ranging from networks with tens of nodes to networks with several tens of millions of edges. It is shown to be comparable to the current state-of-the-art community detection algorithms and superior to all previous label propagation algorithms, with comparable time complexity. In particular, analysis on real-world networks has proven that the algorithm has almost linear complexity, O(m¹·¹⁹), and scales even better than the basic label propagation algorithm (m is the number of edges in the network).
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Centrality in social networks conceptual clarification
Freeman, L. C. (1978) · Social Networks · doi:10.1016/0378-8733(78)90021-7 · Cited by 17,062
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
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
Uncovering the overlapping community structure of complex networks in nature and society
Palla, G., Derényi, I., Farkas, I., & Vicsek, T. (2005) · Nature · doi:10.1038/nature03607 · Cited by 5,373
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
Defining and identifying communities in networks
Radicchi, F., Castellano, C., Cecconi, F., Loreto, V., & Parisi, D. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0400054101 · Cited by 2,450
Performance of modularity maximization in practical contexts
Good, B. H., de Montjoye, Y.-A., & Clauset, A. (2010) · Physical Review E · doi:10.1103/physreve.81.046106 · Cited by 937
Research works printed but not linked: 41
- 10.1103/PhysRevE.67.026112 · DOI · Paper page
- J. Leskovec, 2009, Internet Mathematics, 6, 29, 10.1080/15427951.2009.10129177 · DOI · Paper page
- 10.1073/pnas.0610537104 · DOI · Paper page
- 10.1371/journal.pcbi.1000659 · DOI
- 10.1073/pnas.122653799 · DOI · Paper page
- 10.1103/PhysRevE.70.066111 · DOI · Paper page
- 10.1103/PhysRevE.74.036104 · DOI · Paper page
- 10.1088/1742-5468/2008/10/P10008 · DOI · Paper page
- 10.1103/PhysRevE.80.026129 · DOI · Paper page
- 10.1016/j.physa.2009.12.019 · DOI · Paper page
- C. Pang, 2009, Proceedings of the International Symposium on Neural Networks
- 10.1088/1742-5468/2004/10/P10012 · DOI · Paper page
- 10.1073/pnas.0706851105 · DOI · Paper page
- 10.1016/j.csda.2007.01.010 · doi:10.1016/j.csda.2007.01.010
- 10.1103/PhysRevE.76.036106 · DOI · Paper page
- 10.1103/PhysRevE.79.066107 · DOI · Paper page
- 10.1103/PhysRevE.81.046114 · DOI · Paper page
- X. Liu, 2009, Proceedings of the IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology
- 10.1016/j.physa.2008.04.024 · DOI
- 10.1103/PhysRevE.77.046112 · DOI · Paper page
- 10.1103/PhysRevE.78.046110 · DOI · Paper page
- 10.2307/3033543 · DOI · Paper page
- 10.1038/30918 · DOI · Paper page
- W. W. Zachary, 1977, J. Anthropol. Res., 33, 452, 10.1086/jar.33.4.3629752 · DOI · Paper page
- 10.1145/324133.324140 · DOI · Paper page
- 10.1038/35036627 · DOI · Paper page
- 10.1007/s00265-003-0651-y · DOI · Paper page
- 10.1142/S0219525903001067 · DOI · Paper page
- 10.1038/35075138 · DOI · Paper page
- 10.1103/PhysRevE.68.065103 · DOI · Paper page
- L. A. Adamic, 2005, Proceedings of the International Workshop on Link Discovery
- 10.1103/PhysRevE.70.056122 · DOI · Paper page
- 10.1073/pnas.021544898 · doi:10.1073/pnas.021544898 · Paper page
- M. Richardson, 2003, Proceedings of the International Semantic Web Conference
- 10.1145/1232722.1232727 · DOI · Paper page
- 10.1038/43601 · DOI · Paper page
- B. H. Hall, 2001, The NBER Patent Citation Data File: Lessons, Insights and Methodological Tools, 10.3386/w8498 · DOI · Paper page
- 10.1088/1742-5468/2005/09/P09008 · DOI · Paper page
- 10.1103/PhysRevE.80.056117 · DOI · Paper page
- B. Bollobás, 1998, Modern Graph Theory, 10.1007/978-1-4612-0619-4 · DOI · Paper page
- J. Leskovec, 2010, Proceedings of the ACM International Conference on World Wide Web
Cited by
Pham, D., Tan, X., Balderson, B., Xu, J., Grice, L. F., Yoon, S., Willis, E. F., Tran, M., Lam, P. Y., Raghubar, A., et al. (2023) · Nature Communications · doi:10.1038/s41467-023-43120-6 · Cited by 730
Review of Drug Repositioning Approaches and Resources
Xue, H., Li, J., Xie, H., & Wang, Y. (2018) · International Journal of Biological Sciences · doi:10.7150/ijbs.24612 · Cited by 614
An ultra high-throughput method for single-cell joint analysis of open chromatin and transcriptome
Zhu, C., Yu, M., Huang, H., Juric, I., Abnousi, A., Hu, R., Lucero, J., Behrens, M. M., Hu, M., & Ren, B. (2019) · Nature Structural & Molecular Biology · doi:10.1038/s41594-019-0323-x · Cited by 344
Hücker, S. M., Fehlmann, T., Werno, C., Weidele, K., Lüke, F., Schlenska-Lange, A., Klein, C. A., Keller, A., & Kirsch, S. (2021) · Nature Communications · doi:10.1038/s41467-021-24611-w · Cited by 89
Spatial patterns of CTCF sites define the anatomy of TADs and their boundaries
Nanni, L., Ceri, S., & Logie, C. (2020) · Genome Biology · doi:10.1186/s13059-020-02108-x · Cited by 88
Metadata
- Authors
- Šubelj, L., & Bajec, M.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2011-03-08
- Volume
- 83
- Issue
- 3
- Pages
- 036103-036103
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2074192627
- Cited by
- 193
- References
- 8
- FWCI
- 7.72
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Unfolding communities in large complex networks: Combining defensive and offensive label propagation for core extraction. https://app.cochat.ai/papers/10.1103/physreve.83.036103
- The paper
- Šubelj, L., & Bajec, M. (2011). Unfolding communities in large complex networks: Combining defensive and offensive label propagation for core extraction. Physical Review E. https://doi.org/10.1103/physreve.83.036103
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.