The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Identifying a set of influential spreaders in complex networks
Open accessAbstract
Identifying a set of influential spreaders in complex networks plays a crucial role in effective information spreading. A simple strategy is to choose top-r ranked nodes as spreaders according to influence ranking method such as PageRank, ClusterRank and k-shell decomposition. Besides, some heuristic methods such as hill-climbing, SPIN, degree discount and independent set based are also proposed. However, these approaches suffer from a possibility that some spreaders are so close together that they overlap sphere of influence or time consuming. In this report, we present a simply yet effectively iterative method named VoteRank to identify a set of decentralized spreaders with the best spreading ability. In this approach, all nodes vote in a spreader in each turn, and the voting ability of neighbors of elected spreader will be decreased in subsequent turn. Experimental results on four real networks show that under Susceptible-Infected-Recovered (SIR) and Susceptible-Infected (SI) models, VoteRank outperforms the traditional benchmark methods on both spreading rate and final affected scale. What’s more, VoteRank has superior computational efficiency.
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
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
Centrality in social networks conceptual clarification
Freeman, L. C. (1978) · Social Networks · doi:10.1016/0378-8733(78)90021-7 · Cited by 17,062 · cited 1×
“Very recently, Morone and Makse presented an effective method to find a set of critical nodes by mapping the problem onto optimal percolation in random networks 36 .”
MethodThe 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
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Maximizing the spread of influence through a social network
Kempe, D., Kleinberg, J., & Tardos, É. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956769 · Cited by 7,326
The Mathematics of Infectious Diseases
Hethcote, H. W. (2000) · SIAM Review · doi:10.1137/s0036144500371907 · Cited by 6,687
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
The structure of scientific collaboration networks
Newman, M. E. J. (2001) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.98.2.404 · Cited by 4,482
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
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
Holme, P., & Saramäki, J. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.03.001 · Cited by 2,736
The Centrality Index of a Graph
Sabidussi, G. (1966) · Psychometrika · doi:10.1007/bf02289527 · Cited by 2,476
Efficient influence maximization in social networks
Chen, W., Wang, Y., & Yang, S. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557047 · Cited by 2,156
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
TwitterRank: finding topic-sensitive influential twitterers
Weng, J., Lim, E.-P., Jiang, J., & He, Q. (2010) · Proceedings of the third ACM international conference on Web search and data mining · doi:10.1145/1718487.1718520 · Cited by 1,742
Influence maximization in complex networks through optimal percolation
Morone, F., & Makse, H. A. (2015) · Nature · doi:10.1038/nature14604 · Cited by 1,230
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
Self-citationMitigation of malicious attacks on networks
Schneider, C. M., Moreira, A. A., Andrade, J. S., Havlin, S., & Herrmann, H. J. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1009440108 · Cited by 1,023
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
Defining and evaluating network communities based on ground-truth
Yang, J., & Leskovec, J. (2012) · Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics · doi:10.1145/2350190.2350193 · Cited by 762
An upper bound for the chromatic number of a graph and its application to timetabling problems
Welsh, D. J. A. (1967) · The Computer Journal · doi:10.1093/comjnl/10.1.85 · Cited by 762
Thresholds for Epidemic Spreading in Networks
Castellano, C., & Pastor-Satorras, R. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.218701 · Cited by 721
The H-index of a network node and its relation to degree and coreness
Lü, L., Zhou, T., Zhang, Q.-M., & Stanley, H. E. (2016) · Nature Communications · doi:10.1038/ncomms10168 · Cited by 690
Information diffusion and external influence in networks
Myers, S. A., Zhu, C., & Leskovec, J. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339540 · Cited by 475
A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks
Narayanam, R., & Narahari, Y. (2011) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2010.2052042 · Cited by 382
Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering
Chen, D.-B., Gao, H., Lü, L., & Zhou, T. (2013) · PLoS ONE · doi:10.1371/journal.pone.0077455 · Cited by 364
Self-citationSearching 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
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
Defining and Evaluating Network Communities Based on Ground-Truth
Yang, J., & Leskovec, J. (2012) · 2012 IEEE 12th International Conference on Data Mining · doi:10.1109/icdm.2012.138 · Cited by 254
small world yields the most effective information spreading
Lü, L., Chen, D., & Zhou, T. (2012) · reroDoc Digital Library · Cited by 226
Self-citationThe small world yields the most effective information spreading
Lü, L., Chen, D.-B., & Zhou, T. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/12/123005 · Cited by 215
Self-citationGao, Z.-K., Fang, P.-C., Ding, M.-S., & Jin, N.-D. (2015) · Experimental Thermal and Fluid Science · doi:10.1016/j.expthermflusci.2014.09.008 · Cited by 185
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
Information spreading on dynamic social networks
Liu, C., & Zhang, Z.-K. (2014) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2013.08.028 · Cited by 163
Liu, Y., Tang, M., Zhou, T., & Do, Y. (2015) · Scientific Reports · doi:10.1038/srep13172 · Cited by 160
A directed weighted complex network for characterizing chaotic dynamics from time series
Gao, Z., & Jin, N. (2011) · Nonlinear Analysis Real World Applications · doi:10.1016/j.nonrwa.2011.08.029 · Cited by 145
Unified index to quantifying heterogeneity of complex networks
Hu, H., & Wang, X. (2008) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2008.01.113 · Cited by 130
Multi-frequency complex network from time series for uncovering oil-water flow structure
Gao, Z., Yang, Y., Fang, P., Jin, N., Xia, C., & Hu, L.-D. (2015) · Scientific Reports · doi:10.1038/srep08222 · Cited by 123
Weighted k-shell decomposition for complex networks based on potential edge weights
Wei, B., Liu, J., Wei, D., Gao, C. X., & Deng, Y. (2014) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2014.11.012 · Cited by 105
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
Self-citationLuo, J., & Qi, Y. (2015) · PLoS ONE · doi:10.1371/journal.pone.0131418 · Cited by 77
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
Self-citationIdentifying effective multiple spreaders by coloring complex networks
Zhao, X., Huang, B., Tang, M., Zhang, H., & Chen, D. (2014) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/108/68005 · Cited by 69
Self-citationEpidemic threshold in directed networks
Li, C., Wang, H., & Mieghem, P. V. (2013) · Physical Review E · doi:10.1103/physreve.88.062802 · Cited by 50
Influence maximization of informed agents in social networks
Askarisichani, O., & Jalili, M. (2015) · Applied Mathematics and Computation · doi:10.1016/j.amc.2014.12.139 · Cited by 48
A Novel Top-k Strategy for Influence Maximization in Complex Networks with Community Structure
He, J., Fu, Y., & Chen, D. (2015) · PLoS ONE · doi:10.1371/journal.pone.0145283 · Cited by 45
Self-citationInformation Diffusion and External Influence in NetworksPreprint
Myers, S. A., Zhu, C., & Leskovec, J. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.1331 · Cited by 32
Predicting the evolution of spreading on complex networks
Chen, D., Xiao, R., & Zeng, A. (2014) · Scientific Reports · doi:10.1038/srep06108 · Cited by 26
Self-citation
Metadata
- Authors
- Zhang, J.-X., Chen, D.-B., Dong, Q., & Zhao, Z.-D.
- Venue
- Scientific Reports
- Published
- 2016-06-14
- Volume
- 6
- Issue
- 1
- Pages
- 27823-27823
- ISSN
- 2045-2322 (ISSN-L)
- OpenAlex
- W2962890993
- Cited by
- 320
- References
- 49
- FWCI
- 10.76
- Type
- journal article
- Language
- en
- Open access
- gold
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.