The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Identifying influential spreaders in complex networks based on gravity formula
Open accessAbstract
How to identify the influential spreaders in social networks is crucial for accelerating/hindering information diffusion, increasing product exposure, controlling diseases and rumors, and so on. In this paper, by viewing the k-shell value of each node as its mass and the shortest path distance between two nodes as their distance, then inspired by the idea of the gravity formula, we propose a gravity centrality index to identify the influential spreaders in complex networks. The comparison between the gravity centrality index and some well-known centralities, such as degree centrality, betweenness centrality, closeness centrality, and k-shell centrality, and so forth, indicates that our method can effectively identify the influential spreaders in real networks as well as synthetic networks. We also use the classical Susceptible–Infected–Recovered (SIR) epidemic model to verify the good performance of our method.
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
A Set of Measures of Centrality Based on Betweenness
Freeman, L. C. (1977) · Sociometry · doi:10.2307/3033543 · Cited by 10,295
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
Catastrophic cascade of failures in interdependent networks
Buldyrev, S. V., Parshani, R., Paul, G., Stanley, H. E., & Havlin, S. (2010) · Nature · doi:10.1038/nature08932 · Cited by 4,513
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
Factoring and weighting approaches to status scores and clique identification
Bonacich, P. (1972) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.1972.9989806 · Cited by 3,207
Specificity and Stability in Topology of Protein Networks
Maslov, S., & Sneppen, K. (2002) · Science · doi:10.1126/science.1065103 · 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
Predicting missing links via local information
Zhou, T., Lü, L., & Zhang, Y.-C. (2009) · The European Physical Journal B · doi:10.1140/epjb/e2009-00335-8 · Cited by 1,813
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
Measuring ISP Topologies With Rocketfuel
Spring, N., Mahajan, R., Wetherall, D., & Anderson, T. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.822655 · Cited by 1,010
Leaders in Social Networks, the Delicious Case
Lü, L., Zhang, Y.-C., Yeung, C. H., & Zhou, T. (2011) · PLoS ONE · doi:10.1371/journal.pone.0021202 · Cited by 871
Epidemic outbreaks in complex heterogeneous networksPreprint
Moreno, Y., Pastor‐Satorras, R., & Vespignani, A. (2002) · Cited by 823
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
Epidemic outbreaks in complex heterogeneous networks
Moreno, Y., Pastor-Satorras, R., & Vespignani, A. (2002) · The European Physical Journal B · doi:10.1140/epjb/e20020122 · Cited by 755
Identifying and ranking influential spreaders in complex networks by neighborhood coreness
Bae, J., & Kim, S. (2014) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2013.10.047 · Cited by 564
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
Gallos, L. K., Makse, H. A., & Sigman, M. (2012) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1106612109 · Cited by 398
Searching for superspreaders of information in real-world social media
Pei, S., Muchnik, L., Andrade, Zheng, Z., & Makse, H. A. (2014) · Scientific Reports · doi:10.1038/srep05547 · Cited by 362
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
Avoiding catastrophic failure in correlated networks of networks
Reis, S. D. S., Hu, Y., Babino, A., Andrade Jr, J. S., Canals, S., Sigman, M., & Makse, H. A. (2014) · Nature Physics · doi:10.1038/nphys3081 · Cited by 281
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
Searching for superspreaders of information in real-world social media
Pei, S., Muchnik, L., Andrade, Jr., Zheng, Z. M., & Makse, H. A. (2014) · CUNY Academic Works (City University of New York) · Cited by 265
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
Spreading dynamics in complex networks
Pei, S., & Makse, H. A. (2013) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2013/12/p12002 · Cited by 252
Identifying influential spreaders by weighted LeaderRank
Li, Q., Zhou, T., Lü, L., & Chen, D. (2014) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2014.02.041 · Cited by 248
Absence of influential spreaders in rumor dynamics
Borge-Holthoefer, J., & Moreno, Y. (2012) · Physical Review E · doi:10.1103/physreve.85.026116 · Cited by 248
Identifying influential nodes in weighted networks based on evidence theory
Wei, D., Deng, X., Zhang, X., Deng, Y., & Mahadevan, S. (2013) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2013.01.054 · Cited by 199
Core-like groups result in invalidation of identifying super-spreader by k-shell decomposition
Liu, Y., Tang, M., Zhou, T., & Do, Y. (2015) · Scientific Reports · doi:10.1038/srep09602 · Cited by 177
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
A measure of individual role in collective dynamics
Klemm, K., Serrano, M. Á., Eguíluz, V. M., & Miguel, M. S. (2012) · Scientific Reports · doi:10.1038/srep00292 · Cited by 167
Liu, Y., Tang, M., Zhou, T., & Do, Y. (2015) · Scientific Reports · doi:10.1038/srep13172 · Cited by 160
Locating influential nodes via dynamics-sensitive centrality
Liu, J.-G., Lin, J., Guo, Q., & Zhou, T. (2016) · Scientific Reports · doi:10.1038/srep21380 · Cited by 157
Protein complexes take the bait
Kumar, A., & Snyder, M. P. (2002) · Nature · doi:10.1038/415123a · Cited by 153
Locating privileged spreaders on an online social network
Borge‐Holthoefer, J., Rivero, A., & Moreno, Y. (2012) · Physical Review E · doi:10.1103/physreve.85.066123 · Cited by 110
Self-similar scaling of density in complex real-world networks
Blagus, N., Šubelj, L., & Bajec, M. (2011) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2011.12.055 · Cited by 100
Detecting Influential Spreaders in Complex, Dynamic Networks
Basaras, P., Katsaros, D., & Tassiulas, L. (2013) · Computer · doi:10.1109/mc.2013.75 · Cited by 93
Path diversity improves the identification of influential spreaders
Chen, D., Xiao, R., Zeng, A., & Zhang, Y. (2013) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/104/68006 · Cited by 89
Identifying the node spreading influence with largest k -core values
Lin, J., Guo, Q., Dong, W.-Z., Tang, L., & Liu, J.-G. (2014) · Physics Letters A · doi:10.1016/j.physleta.2014.09.054 · Cited by 73
Conditions for Viral Influence Spreading through Multiplex Correlated Social Networks
Hu, Y., Havlin, S., & Makse, H. A. (2014) · Physical Review X · doi:10.1103/physrevx.4.021031 · Cited by 73
Iterative resource allocation for ranking spreaders in complex networks
Ren, Z.-M., Zeng, A., Chen, D., Liao, H., & Liu, J.-G. (2014) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/106/48005 · Cited by 72
Node importance for dynamical process on networks: A multiscale characterization
Zhang, J., Xu, X.-K., Li, P., Zhang, K., & SMALL, M. P. (2011) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.3553644 · Cited by 58
Key leaders in social networks
Zhou, J., & Chen, Y. (2015) · Journal of Economic Theory · doi:10.1016/j.jet.2015.01.005 · Cited by 56
Seeding the Kernels in graphs: toward multi-resolution community analysis
Zhang, J., Zhang, K., Xu, X.-K., Tse, C. K., & SMALL, M. P. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/11/113003 · Cited by 39
Zhong, L., Liu, J.-G., & Shang, M. (2015) · Physics Letters A · doi:10.1016/j.physleta.2015.05.021 · Cited by 35
Cited by
Identifying influential spreaders by gravity model
Li, Z., Ren, T., Ma, X., Liu, S., Zhang, Y., & Zhou, T. (2019) · Scientific Reports · doi:10.1038/s41598-019-44930-9 · Cited by 256
Metadata
- Authors
- Ma, L.-L., Ma, C., Zhang, H.-F., & Wang, B.-H.
- Venue
- Physica A: Statistical Mechanics and its Applications
- Publisher
- Elsevier BV
- Published
- 2016-06
- Volume
- 451
- Pages
- 205-212
- ISSN
- 0378-4371 (ISSN-L)
- OpenAlex
- W2161953836
- Cited by
- 367
- References
- 49
- FWCI
- 11.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.