Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 193

The DOI matches its Crossref record; 9 of the 9 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 access
Šubelj, Lovro, Bajec, Marko · 2011 · Physical Review E

Abstract

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.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physreve.83.036103

Cites

9 of 9 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 40

  1. 10.1103/PhysRevE.67.026112 · DOI · Paper page
  2. J. Leskovec, 2009, Internet Mathematics, 6, 29, 10.1080/15427951.2009.10129177 · DOI · Paper page
  3. 10.1073/pnas.0610537104 · DOI · Paper page
  4. 10.1371/journal.pcbi.1000659 · DOI
  5. 10.1103/PhysRevE.70.066111 · DOI · Paper page
  6. 10.1103/PhysRevE.74.036104 · DOI · Paper page
  7. 10.1088/1742-5468/2008/10/P10008 · DOI · Paper page
  8. 10.1103/PhysRevE.80.026129 · DOI · Paper page
  9. 10.1016/j.physa.2009.12.019 · DOI · Paper page
  10. C. Pang, 2009, Proceedings of the International Symposium on Neural Networks
  11. 10.1088/1742-5468/2004/10/P10012 · DOI · Paper page
  12. 10.1073/pnas.0706851105 · DOI · Paper page
  13. 10.1016/j.csda.2007.01.010 · doi:10.1016/j.csda.2007.01.010
  14. 10.1103/PhysRevE.76.036106 · DOI · Paper page
  15. 10.1103/PhysRevE.79.066107 · DOI · Paper page
  16. 10.1103/PhysRevE.81.046114 · DOI · Paper page
  17. X. Liu, 2009, Proceedings of the IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology
  18. 10.1016/j.physa.2008.04.024 · DOI
  19. 10.1103/PhysRevE.77.046112 · DOI · Paper page
  20. 10.1103/PhysRevE.78.046110 · DOI · Paper page
  21. 10.2307/3033543 · DOI · Paper page
  22. 10.1038/30918 · DOI · Paper page
  23. W. W. Zachary, 1977, J. Anthropol. Res., 33, 452, 10.1086/jar.33.4.3629752 · DOI · Paper page
  24. 10.1145/324133.324140 · DOI · Paper page
  25. 10.1038/35036627 · DOI · Paper page
  26. 10.1007/s00265-003-0651-y · DOI · Paper page
  27. 10.1142/S0219525903001067 · DOI · Paper page
  28. 10.1038/35075138 · DOI · Paper page
  29. 10.1103/PhysRevE.68.065103 · DOI · Paper page
  30. L. A. Adamic, 2005, Proceedings of the International Workshop on Link Discovery
  31. 10.1103/PhysRevE.70.056122 · DOI · Paper page
  32. 10.1073/pnas.021544898 · doi:10.1073/pnas.021544898 · Paper page
  33. M. Richardson, 2003, Proceedings of the International Semantic Web Conference
  34. 10.1145/1232722.1232727 · DOI · Paper page
  35. 10.1038/43601 · DOI · Paper page
  36. B. H. Hall, 2001, The NBER Patent Citation Data File: Lessons, Insights and Methodological Tools, 10.3386/w8498 · DOI · Paper page
  37. 10.1088/1742-5468/2005/09/P09008 · DOI · Paper page
  38. 10.1103/PhysRevE.80.056117 · DOI · Paper page
  39. B. Bollobás, 1998, Modern Graph Theory, 10.1007/978-1-4612-0619-4 · DOI · Paper page
  40. J. Leskovec, 2010, Proceedings of the ACM International Conference on World Wide Web

Cited by

See all 193

Metadata

Authors
Šubelj, L., & Bajec, M.
Venue
Physical Review E
Published
2011-03-08
Volume
83
Issue
3
Pages
036103-036103
ISSN
  • 1539-3755 (ISSN-L)
  • 1550-2376
OpenAlex
W2074192627
Cited by
193
References
9
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

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.