The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Ranking the spreading influence in complex networks
Open accessAbstract
Identifying the node spreading influence in networks is an important task to optimally use the network structure and ensure the more efficient spreading in information. In this paper, by taking into account the shortest distance between a target node and the node set with the highest k-core value, we present an improved method to generate the ranking list to evaluate the node spreading influence. Comparing with the epidemic process results for four real networks and the Barabasi–Albert network, the parameterless method could identify the node spreading influence more accurately than the ones generated by the degree k, closeness centrality, k-shell and mixed degree decomposition methods. This work would be helpful for deeply understanding the node importance of a network.
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
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
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
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
Dynamical Processes on Complex Networks
Barrat, A., Barthélemy, M., & Vespignani, A. (2008) · doi:10.1017/cbo9780511791383 · Cited by 2,704 · cited 1×
“Comparing with the susceptible-infection-r ecovered (SIR) spreading process [18,19] for four real networks and the Barabási-Al bert network [20], the experimental results show that our method could generate th e ranking list more accurately than the ones generated by the degree k, closeness centrality(CC)[21], k-shell…”
MethodThe 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
Graphs over time: densification laws, shrinking diameters and possible explanations
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081893 · Cited by 2,281
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
Dynamical and Correlation Properties of the Internet
Pastor-Satorras, R., Vázquez, A., & Vespignani, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.258701 · Cited by 1,466
Breakdown of the Internet under Intentional Attack
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3682 · Cited by 1,455
Reaction–diffusion processes and metapopulation models in heterogeneous networks
Colizza, V., Pastor-Satorras, R., & Vespignani, A. (2007) · Nature Physics · doi:10.1038/nphys560 · Cited by 869
Cascade Control and Defense in Complex Networks
Motter, A. E. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.098701 · Cited by 776
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
Statistical Mechanics of Complex Networks
(2003) · Lecture Notes in Physics · doi:10.1007/b12331 · Cited by 732
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
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
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2011) · The Structure and Dynamics of Networks · doi:10.1515/9781400841356.503 · Cited by 345
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
Behaviors of susceptible-infected epidemics on scale-free networks with identical infectivity
Zhou, T., Liu, J.-G., Bai, W.-J., Chen, G., & Wang, B.-H. (2006) · Physical Review E · doi:10.1103/physreve.74.056109 · Cited by 286
Self-citationSeed size strongly affects cascades on random networks
Gleeson, J. P., & Cahalane, D. J. (2007) · Physical Review E · doi:10.1103/physreve.75.056103 · Cited by 273
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
Heat Conduction Process on Community Networks as a Recommendation Model
Zhang, Y.-C., Blattner, M., & Yu, Y.-K. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.154301 · Cited by 247
Ranking stability and super-stable nodes in complex networks
Ghoshal, G., & Barabási, A.-L. (2011) · Nature Communications · doi:10.1038/ncomms1396 · Cited by 205
Grossman, R. L., USA, K. T. E. A. S. I. C. O. K. D. A. D. M. 2. C. I., Association for Computing Machinery-Digital Library, ACM Special Interest Group on Knowledge Discovery in Data, ACM Special Interest Group on Management of Data, & SIGs, A. (2005) · Cited by 179
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
A short course on computer viruses
Cohen, F. B., Highland, H. J., & David, J. (1991) · Computer Fraud & Security Bulletin · doi:10.1016/0142-0496(91)90211-m · Cited by 157
Competing activation mechanisms in epidemics on networks
Castellano, C., & Pastor‐Satorras, R. (2012) · Scientific Reports · doi:10.1038/srep00371 · Cited by 132
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
Kephart, J. O., Sorkin, G. B., Chess, D. M., & White, S. R. (1997) · Scientific American · doi:10.1038/scientificamerican1197-88 · Cited by 107
Competing activation mechanisms in epidemics on networks
Castellano, C., & Pastor‐Satorras, R. (2016) · RECERCAT (Consorci de Serveis Universitaris de Catalunya) · Cited by 94
k-Core Organization in Complex Networks
Baxter, G. J., Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2011) · Springer optimization and its applications · doi:10.1007/978-1-4614-0754-6_9 · Cited by 75
OPINION SPREADING AND CONSENSUS FORMATION ON SQUARE LATTICE
Liu, J.-G., Wu, Z.-X., & Wang, F. (2007) · International Journal of Modern Physics C · doi:10.1142/s0129183107011145 · Cited by 27
Self-citation
Cited by
Epidemic processes in complex networks
Pastor-Satorras, R., Castellano, C., Van Mieghem, P., & Vespignani, A. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.925 · Cited by 3,697
Vital nodes identification in complex networks
Lü, L., Chen, D., Ren, X.-L., Zhang, Q.-M., Zhang, Y.-C., & Zhou, T. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.06.007 · Cited by 1,183
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
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
Metadata
- Authors
- Liu, J.-G., Ren, Z.-M., & Guo, Q.
- Venue
- Physica A: Statistical Mechanics and its Applications
- Publisher
- Elsevier BV
- Published
- 2013-09
- Volume
- 392
- Issue
- 18
- Pages
- 4154-4159
- ISSN
- 0378-4371 (ISSN-L)
- OpenAlex
- W2079219719
- Cited by
- 258
- References
- 37
- FWCI
- 16.74
- 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.