The DOI matches its Crossref record; 52 of the 52 references it cites were found in a registry or an index.
Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering
Open accessAbstract
Identifying influential nodes in very large-scale directed networks is a big challenge relevant to disparate applications, such as accelerating information propagation, controlling rumors and diseases, designing search engines, and understanding hierarchical organization of social and biological networks. Known methods range from node centralities, such as degree, closeness and betweenness, to diffusion-based processes, like PageRank and LeaderRank. Some of these methods already take into account the influences of a node's neighbors but do not directly make use of the interactions among it's neighbors. Local clustering is known to have negative impacts on the information spreading. We further show empirically that it also plays a negative role in generating local connections. Inspired by these facts, we propose a local ranking algorithm named ClusterRank, which takes into account not only the number of neighbors and the neighbors' influences, but also the clustering coefficient. Subject to the susceptible-infected-recovered (SIR) spreading model with constant infectivity, experimental results on two directed networks, a social network extracted from delicious.com and a large-scale short-message communication network, demonstrate that the ClusterRank outperforms some benchmark algorithms such as PageRank and LeaderRank. Furthermore, ClusterRank can also be applied to undirected networks where the superiority of ClusterRank is significant compared with degree centrality and k-core decomposition. In addition, ClusterRank, only making use of local information, is much more efficient than global methods: It takes only 191 seconds for a network with about [Formula: see text] nodes, more than 15 times faster than PageRank.
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
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Centrality in social networks conceptual clarification
Freeman, L. C. (1978) · Social Networks · doi:10.1016/0378-8733(78)90021-7 · Cited by 17,062
The 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
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Infectious Diseases of Humans: Dynamics and Control
(1992) · Annals of Internal Medicine · doi:10.7326/0003-4819-117-2-174_4 · Cited by 7,746
Infectious Diseases of Humans: Dynamics and Control
Anderson, R. M., & May, R. M. (1991) · doi:10.1093/oso/9780198545996.001.0001 · Cited by 6,179
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
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
Measurement and analysis of online social networks
Mislove, A., Marcon, M., Gummadi, K. P., Druschel, P., & Bhattacharjee, B. (2007) · Proceedings of the 7th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1298306.1298311 · Cited by 3,057
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
Self-citationDynamical Processes on Complex Networks
Barrat, A., Barthélemy, M., & Vespignani, A. (2008) · doi:10.1017/cbo9780511791383 · Cited by 2,704 · cited 1×
“With great theoretical and practical significance, the studies on epidemic and information spreading in biological, social and technological networks become one of the most exciting domains in many branches of sciences [1–4].”
BackgroundThe spread of behavior in an online social network experiment
Centola, D. (2010) · Science · doi:10.1126/science.1185231 · Cited by 2,692
The Centrality Index of a Graph
Sabidussi, G. (1966) · Psychometrika · doi:10.1007/bf02289527 · Cited by 2,476
Coevolutionary games—A mini review
Perc, M., & Szolnoki, A. (2010) · Biosystems · doi:10.1016/j.biosystems.2009.10.003 · Cited by 1,971
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1998) · Symposium on Discrete Algorithms · doi:10.5555/314613.315045 · Cited by 1,814
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
Some Unique Properties of Eigenvector Centrality
Bonacich, P. (2007) · Social Networks · doi:10.1016/j.socnet.2007.04.002 · Cited by 1,572 · cited 1×
“A number of centrality indices have been proposed to address this problem, such as degree centrality, closeness centrality [9], betweenness centrality [10], and eigenvector centrality [11].”
BackgroundIdentifying 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-citationIdentifying influential and susceptible members of social networks
Aral, S., & Walker, D. (2012) · Science · doi:10.1126/science.1215842 · Cited by 1,047
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
Self-citationClustering in complex directed networks
Fagiolo, G. (2007) · Physical Review E · doi:10.1103/physreve.76.026107 · Cited by 802
Structural diversity in social contagion
Ugander, J., Backstrom, L., Marlow, C., & Kleinberg, J. (2012) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1116502109 · Cited by 695
Modelling dynamical processes in complex socio-technical systems
Vespignani, A. (2012) · Nature Physics · doi:10.1038/nphys2160 · Cited by 652
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
Epidemic Threshold in Structured Scale-Free Networks
Eguíluz, V. M., & Klemm, K. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.108701 · Cited by 353
Temporal node centrality in complex networks
Kim, H., & Anderson, R. (2012) · Physical Review E · doi:10.1103/physreve.85.026107 · Cited by 314
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-citationMaximal planar networks with large clustering coefficient and power-law degree distribution
Zhou, T., Yan, G., & Wang, B.-H. (2005) · Physical Review E · doi:10.1103/physreve.71.046141 · Cited by 265 · cited 1×
“Usually, the local clustering plays a negative role in spreading [28,29,40] since if i ’s followers closely interact with each other rather than with other nodes, the spreading initiated from node i is more likely to be confined in a local region.”
BackgroundSelf-citationNetwork clustering coefficient without degree-correlation biases
Soffer, S. N., & Vázquez, A. (2005) · Physical Review E · doi:10.1103/physreve.71.057101 · Cited by 257
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
Self-citationsmall world yields the most effective information spreading
Lü, L., Chen, D., & Zhou, T. (2012) · reroDoc Digital Library · Cited by 226
Self-citationEpidemic spreading on heterogeneous networks with identical infectivity
Yang, R., Wang, B.-H., Ren, J., Bai, W.-J., Shi, Z.-W., Wang, W.-X., & Zhou, T. (2007) · Physics Letters A · doi:10.1016/j.physleta.2006.12.021 · Cited by 221
Self-citationIdentifying 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
Model for rumor spreading over networks
Trpevski, D., Tang, W. K. S., & Kocarev, L. (2010) · Physical Review E · doi:10.1103/physreve.81.056102 · Cited by 215
The 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-citationEvolution of cooperation on scale-free networks subject to error and attack
Perc, M. (2017) · University of Maribor digital library (University of Maribor) · Cited by 215
Evolution of cooperation on scale-free networks subject to error and attack
Perc, M. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/3/033027 · Cited by 206
Link prediction in complex networks: A local naïve Bayes model
Liu, Z., Zhang, Q.-M., Lü, L., & Zhou, T. (2011) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/96/48007 · Cited by 203
Self-citationIdentifying 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
Epidemic dynamics on complex networks*
Tao, Z., Zhongqian, F., & Binghong, W. (2006) · Progress in Natural Science · doi:10.1080/10020070612330019 · Cited by 159
Zhou, Y.-B., Lü, L., & Li, M. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/3/033033 · Cited by 114
Self-citationPath 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 92
Self-citationLink Prediction in Complex Networks: A Clustering PerspectivePreprint
Feng, X., Zhao, J., & Xua, K. (2016) · Cited by 81
Efficient discovery of influential nodes for SIS models in social networks
Saito, K., Kimura, M., Ohara, K., & Motoda, H. (2011) · Knowledge and Information Systems · doi:10.1007/s10115-011-0396-2 · Cited by 76
Link prediction in complex networks: a clustering perspective
Feng, X., Zhao, J. C., & Xu, K. (2012) · The European Physical Journal B · doi:10.1140/epjb/e2011-20207-x · Cited by 72
Role of clustering and gridlike ordering in epidemic spreading
Petermann, T., & Rios, P. D. L. (2004) · Physical Review E · doi:10.1103/physreve.69.066116 · Cited by 59
Control of epidemic spreading on complex networks by local traffic dynamics
Yang, H.-X., Wang, W.-X., Lai, Y., Xie, Y.-B., & Wang, B.-H. (2011) · Physical Review E · doi:10.1103/physreve.84.045101 · Cited by 55
Impact of link deletions on public cooperation in scale-free networks
Jiang, L.-L., Perc, M., Wang, W.-X., Lai, Y., & Wang, B.-H. (2011) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/93/40001 · Cited by 45
Synchronizability of Highly Clustered Scale-Free Networks
Wu, X., Wang, B.-H., Zhou, T., Wen-Xu, W., Zhao, M., & Hui-Jie, Y. (2006) · Chinese Physics Letters · doi:10.1088/0256-307x/23/4/079 · Cited by 37
Self-citationAxelrod's Metanorm Games on Networks
Galán, J. M., Łatek, M. M., & Rizi, S. M. M. (2011) · PLoS ONE · doi:10.1371/journal.pone.0020474 · Cited by 28
Clustering in Large Networks Does Not Promote Upstream Reciprocity
Masuda, N. (2011) · PLoS ONE · doi:10.1371/journal.pone.0025190 · Cited by 9
Cited by
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
Self-citationThe 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
Self-citationIdentifying a set of influential spreaders in complex networks
Zhang, J.-X., Chen, D.-B., Dong, Q., & Zhao, Z.-D. (2016) · Scientific Reports · doi:10.1038/srep27823 · Cited by 320
Self-citationUnderstanding Human-Machine Networks: A Cross-Disciplinary Survey
Tsvetkova, M., Yasseri, T., Meyer, E. T., Pickering, J. B., Engen, V., Walland, P., Lüders, M., Følstad, A., & Bravos, G. (2018) · ACM Computing Surveys · doi:10.1145/3039868 · Cited by 67
The center for causal discovery of biomedical knowledge from big data
Cooper, G. F., Bahar, I., Becich, M. J., Benos, P. V., Berg, J., Espino, J., Glymour, C., Jacobson, R. C., Kienholz, M., Lee, A. V., et al. (2015) · Journal of the American Medical Informatics Association · doi:10.1093/jamia/ocv059 · Cited by 36
Metadata
- Authors
- Chen, D.-B., Gao, H., Lü, L., & Zhou, T.
- Venue
- PLoS ONE
- Publisher
- Public Library of Science (PLoS)
- Published
- 2013-10-31
- Volume
- 8
- Issue
- 10
- Pages
- e77455
- ISSN
- 1932-6203 (ISSN-L)
- OpenAlex
- W2113330929
- Cited by
- 364
- References
- 52
- FWCI
- 11.00
- 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.