The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Leaders in Social Networks, the Delicious Case
Open accessAbstract
Finding pertinent information is not limited to search engines. Online communities can amplify the influence of a small number of power users for the benefit of all other users. Users' information foraging in depth and breadth can be greatly enhanced by choosing suitable leaders. For instance in delicious.com, users subscribe to leaders' collection which lead to a deeper and wider reach not achievable with search engines. To consolidate such collective search, it is essential to utilize the leadership topology and identify influential users. Google's PageRank, as a successful search algorithm in the World Wide Web, turns out to be less effective in networks of people. We thus devise an adaptive and parameter-free algorithm, the LeaderRank, to quantify user influence. We show that LeaderRank outperforms PageRank in terms of ranking effectiveness, as well as robustness against manipulations and noisy data. These results suggest that leaders who are aware of their clout may reinforce the development of social networks, and thus the power of collective search.
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
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
(1999) · Cited by 12,854
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Assortative Mixing in Networks
Newman, M. E. J. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.208701 · Cited by 4,988
Douceur, J. R. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45748-8_24 · Cited by 4,419
Statistical physics of social dynamics
Castellano, C., Fortunato, S., & Loreto, V. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.591 · Cited by 4,119
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-citationNetworks, Crowds, and Markets: Reasoning about a Highly Connected World
Easley, D., & Kleinberg, J. (2010) · doi:10.1017/cbo9780511761942 · Cited by 2,590
Marsden, P. V. (1990) · Annual Review of Sociology · doi:10.1146/annurev.so.16.080190.002251 · Cited by 2,176
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1998) · Symposium on Discrete Algorithms · doi:10.5555/314613.315045 · Cited by 1,814
Networks, Crowds, and Markets: Network Dynamics: Structural Models
Easley, D. A., & Kleinberg, J. M. (2010) · Cited by 1,447
Networks, Crowds, and Markets: Network Dynamics: Population Models
Easley, D. A., & Kleinberg, J. M. (2010) · Cited by 1,447
Immunization of complex networks
Pastor-Satorras, R., & Vespignani, A. (2002) · Physical Review E · doi:10.1103/physreve.65.036104 · Cited by 1,278
A face(book) in the crowd: social Searching vs. social browsing
Lampe, C., Ellison, N., & Steinfield, C. (2006) · Proceedings of the 2006 20th anniversary conference on Computer supported cooperative work · doi:10.1145/1180875.1180901 · Cited by 1,006
Missing and spurious interactions and the reconstruction of complex networks
Guimerà, R., & Sales-Pardo, M. (2009) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0908366106 · Cited by 797
Minority opinion spreading in random geometry
Galam, S. (2002) · The European Physical Journal B · doi:10.1140/epjb/e20020045 · Cited by 522
Finding scientific gems with Google’s PageRank algorithm
Chen, P., Xie, H., Maslov, S., & Redner, S. (2007) · Journal of Informetrics · doi:10.1016/j.joi.2006.06.001 · Cited by 483
Disease candidate gene identification and prioritization using protein interaction networks
Chen, J., Aronow, B. J., & Jegga, A. G. (2009) · BMC Bioinformatics · doi:10.1186/1471-2105-10-73 · Cited by 364
Diffusion of scientific credits and the ranking of scientists
Radicchi, F., Fortunato, S., Markines, B., & Vespignani, A. (2009) · Physical Review E · doi:10.1103/physreve.80.056103 · Cited by 324
Group-by skyline query processing in relational engines
Luk, M.-H., Yiu, M. L., & Lo, E. (2009) · Proceedings of the 18th ACM conference on Information and knowledge management · doi:10.1145/1645953.1646138 · Cited by 279
A Survey of Solutions to the Sybil Attack
Levine, B. N., Shields, C., & Margolin, N. B. (2006) · Cited by 241
Googling Food Webs: Can an Eigenvector Measure Species' Importance for Coextinctions?
Allesina, S., & Pascual, M. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000494 · Cited by 227
Epidemic 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-citationProtein–protein interaction maps: a lead towards cellular functions
Legrain, P., Wojcik, J., & Gauthier, J.-M. (2001) · Trends in Genetics · doi:10.1016/s0168-9525(01)02323-x · Cited by 195
A network-based ranking system for US college football
Park, J. M., & Newman, M. E. J. (2005) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2005/10/p10014 · Cited by 123
Nepotistic relationships in Twitter and their impact on rank prestige algorithms
Gayo-Avello, D. (2013) · Information Processing & Management · doi:10.1016/j.ipm.2013.06.003 · Cited by 69
Manifesto for the Reputation Society
Masum, H., & Zhang, Y. (2004) · First Monday · doi:10.5210/fm.v9i7.1158 · Cited by 68
Self-citation
Cited by
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-citationVital 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-citationLü, L., Medo, M., Yeung, C. H., Zhang, Y.-C., Zhang, Z.-K., & Zhou, T. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.02.006 · Cited by 995
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-citationAntibiotic resistance genes identified in wastewater treatment plant systems – A review
Pazda, M., Kumirska, J., Stepnowski, P., & Mulkiewicz, E. (2019) · Science of The Total Environment · doi:10.1016/j.scitotenv.2019.134023 · Cited by 648
Metadata
- Authors
- Lü, L., Zhang, Y.-C., Yeung, C. H., & Zhou, T.
- Venue
- PLoS ONE
- Publisher
- Public Library of Science (PLoS)
- Published
- 2011-06-27
- Volume
- 6
- Issue
- 6
- Pages
- e21202
- ISSN
- 1932-6203 (ISSN-L)
- OpenAlex
- W1985451470
- Cited by
- 871
- References
- 28
- FWCI
- 27.38
- 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.