The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Detecting community structure in complex networks via node similarity
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
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
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
Hierarchical Organization of Modularity in Metabolic Networks
Ravasz, E., Somera, A. L., Mongru, D. A., Oltvai, Z. N., & Barabási, A.-L. (2002) · Science · doi:10.1126/science.1073374 · Cited by 4,224
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 · cited 1×
“They first compute the intensity of link between each pair nodes based on different methods, such as edge betweenness [5,9], edge clustering coefficient [10], dissimilarity index [11], information centrality [12], similarity based on randomwalks [13], clustering centrality [14], and so on.”
MethodThe emergent properties of a dolphin social network
Lusseau, D. (2003) · Proceedings of the Royal Society of London. Series B: Biological Sciences · doi:10.1098/rsbl.2003.0057 · Cited by 844
Cited by
Link prediction in complex networks: A survey
Lü, L., & Zhou, T. (2011) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2010.11.027 · Cited by 2,819
Lü, L., Medo, M., Yeung, C. H., Zhang, Y.-C., Zhang, Z.-K., & Zhou, T. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.02.006 · Cited by 995
Mining Brand Perceptions from Twitter Social Networks
Culotta, A., & Cutler, J. (2016) · Marketing Science · doi:10.1287/mksc.2015.0968 · Cited by 254
Metadata
- Authors
- Pan, Y., Li, D.-H., Liu, J.-G., & Liang, J.-Z.
- Venue
- Physica A: Statistical Mechanics and its Applications
- Publisher
- Elsevier BV
- Published
- 2010-07
- Volume
- 389
- Issue
- 14
- Pages
- 2849-2857
- ISSN
- 0378-4371 (ISSN-L)
- OpenAlex
- W2045864404
- Cited by
- 165
- References
- 6
- FWCI
- 4.85
- Type
- journal article
- Language
- en
- Open access
- closed
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.