The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Identifying and ranking influential spreaders in complex networks by neighborhood coreness
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Fortunato, S. (2010) · Physics Reports · doi:10.1016/j.physrep.2009.11.002 · Cited by 11,293
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Error and attack tolerance of complex networksPreprint
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · Cited by 6,467
Epidemic Spreading in Scale-Free Networks
Pastor-Satorras, R., & Vespignani, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3200 · Cited by 5,731
Finding community structure in networks using the eigenvectors of matrices
Newman, M. E. J. (2006) · Physical Review E · doi:10.1103/physreve.74.036104 · Cited by 4,761
An Information Flow Model for Conflict and Fission in Small Groups
Zachary, W. W. (1977) · Journal of Anthropological Research · doi:10.1086/jar.33.4.3629752 · Cited by 4,704
Spread of epidemic disease on networks
Newman, M. E. J. (2002) · Physical Review E · doi:10.1103/physreve.66.016128 · Cited by 3,218
Identification of influential spreaders in complex networks
Kitsak, M., Gallos, L. K., Havlin, S., Liljeros, F., Muchnik, L., Stanley, H. E., & Makse, H. A. (2010) · Nature Physics · doi:10.1038/nphys1746 · Cited by 3,212
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
The Centrality Index of a Graph
Sabidussi, G. (1966) · Psychometrika · doi:10.1007/bf02289527 · Cited by 2,476
Graph evolution: Densification and shrinking diameters
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217301 · Cited by 2,461
A measure of betweenness centrality based on random walks
Newman, M. E. J. (2005) · Social Networks · doi:10.1016/j.socnet.2004.11.009 · Cited by 2,461
Lusseau, D., Schneider, K., Boisseau, O. J., Haase, P., Slooten, E., & Dawson, S. M. (2003) · Behavioral Ecology and Sociobiology · doi:10.1007/s00265-003-0651-y · Cited by 2,277
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
Community detection in complex networks using extremal optimization
Duch, J., & Arenas, A. (2005) · Physical Review E · doi:10.1103/physreve.72.027104 · Cited by 1,549
Self-similar community structure in a network of human interactions
Guimerà, R., Danon, L., Díaz-Guilera, A., Giralt, F., & Arenas, A. (2003) · Physical Review E · doi:10.1103/physreve.68.065103 · Cited by 1,515
Identifying influential nodes in complex networks
Chen, D., Lü, L., Shang, M.-S., Zhang, Y.-C., & Zhou, T. (2012) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2011.09.017 · Cited by 1,210
GLEISER, P. M., & DANON, L. (2003) · Advances in Complex Systems · doi:10.1142/s0219525903001067 · Cited by 1,032
THE TREATMENT OF TIES IN RANKING PROBLEMS
KENDALL, M. G. (1945) · Biometrika · doi:10.1093/biomet/33.3.239 · Cited by 809
Models of social networks based on social distance attachment
Boguñá, M., Pastor-Satorras, R., Díaz-Guilera, A., & Arenas, A. (2004) · Physical Review E · doi:10.1103/physreve.70.056122 · Cited by 769
A model of Internet topology using k-shell decomposition
Carmi, S., Havlin, S., Kirkpatrick, S., Shavitt, Y., & Shir, E. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0701175104 · Cited by 760
Thresholds for Epidemic Spreading in Networks
Castellano, C., & Pastor-Satorras, R. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.218701 · Cited by 721
k-Core Organization of Complex Networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.040601 · Cited by 709
An O(m) Algorithm for Cores Decomposition of Networks
Batagelj, V., & Zaveršnik, M. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0310049 · Cited by 627
Ranking spreaders by decomposing complex networks
Zeng, A., & Zhang, C.-J. (2013) · Physics Letters A · doi:10.1016/j.physleta.2013.02.039 · Cited by 448
A Computer Method for Calculating Kendall's Tau with Ungrouped Data
Knight, W. R. (1966) · Journal of the American Statistical Association · doi:10.1080/01621459.1966.10480879 · Cited by 324
Graph Evolution: Densification and Shrinking Diameters
Leskovec, J., Kleinberg, J. M., & Faloutsos, C. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.physics/0603229 · Cited by 300
A k-shell decomposition method for weighted networks
Garas, A., Schweitzer, F., & Havlin, S. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/8/083030 · Cited by 280
Ranking the spreading influence in complex networks
Liu, J.-G., Ren, Z.-M., & Guo, Q. (2013) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2013.04.037 · Cited by 258
Identifying influential nodes in complex networks with community structure
Zhang, X., Zhu, J., Wang, Q., & Zhao, H. (2013) · Knowledge-Based Systems · doi:10.1016/j.knosys.2013.01.017 · Cited by 220
Generalized CoresPreprint
Batagelj, V., & Zaveršnik, M. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0202039 · Cited by 199
Streaming algorithms for k-core decomposition
Sarıyüce, A. E., Gedik, B., Jacques-Silva, G., Wu, K., & Çatalyürek, Ü. V. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2536336.2536344 · Cited by 187
Distributed k-Core Decomposition
Montresor, A., De Pellegrini, F., & Miorandi, D. (2013) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2012.124 · Cited by 181
A k-shell decomposition method for weighted networks
Garas, A., Schweitzer, F., & Havlin, S. (2012) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-b-000055291 · Cited by 171
Identifying all-around nodes for spreading dynamics in complex networks
Hou, B., Yao, Y., & Liao, D. (2012) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2012.02.033 · Cited by 125
Detecting Influential Spreaders in Complex, Dynamic Networks
Basaras, P., Katsaros, D., & Tassiulas, L. (2013) · Computer · doi:10.1109/mc.2013.75 · Cited by 93
Cited by
Study on centrality measures in social networks: a survey
Das, K., Samanta, S., & Pal, M. (2018) · Social Network Analysis and Mining · doi:10.1007/s13278-018-0493-2 · Cited by 443
Identifying influential spreaders in complex networks based on gravity formula
Ma, L.-L., Ma, C., Zhang, H.-F., & Wang, B.-H. (2016) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2015.12.162 · Cited by 367
Deep Recursive Network Embedding with Regular Equivalence
Tu, K., Cui, P., Wang, X., Yu, P. S., & Zhu, W. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3220068 · Cited by 179
Metadata
- Authors
- Bae, J., & Kim, S.
- Venue
- Physica A: Statistical Mechanics and its Applications
- Publisher
- Elsevier BV
- Published
- 2014-02
- Volume
- 395
- Pages
- 549-559
- ISSN
- 0378-4371 (ISSN-L)
- OpenAlex
- W2040763707
- Cited by
- 564
- References
- 39
- FWCI
- 9.57
- 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.