IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0021202.html

Leaders in Social Networks, the Delicious Case

Author

Listed:
  • Linyuan Lü
  • Yi-Cheng Zhang
  • Chi Ho Yeung
  • Tao Zhou

Abstract

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.

Suggested Citation

  • Linyuan Lü & Yi-Cheng Zhang & Chi Ho Yeung & Tao Zhou, 2011. "Leaders in Social Networks, the Delicious Case," PLOS ONE, Public Library of Science, vol. 6(6), pages 1-9, June.
    • Handle: RePEc:plo:pone00:0021202
    DOI: 10.1371/journal.pone.0021202
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0021202
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0021202&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0021202?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. repec:cup:cbooks:9780511771576 is not listed on IDEAS
    2. Lü, Linyuan & Zhou, Tao, 2011. "Link prediction in complex networks: A survey," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(6), pages 1150-1170.
    3. Wang, Jia-zeng & Liu, Zeng-rong & Xu, Jianhua, 2007. "Epidemic spreading on uncorrelated heterogenous networks with non-uniform transmission," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 382(2), pages 715-721.
    4. Chen, P. & Xie, H. & Maslov, S. & Redner, S., 2007. "Finding scientific gems with Google’s PageRank algorithm," Journal of Informetrics, Elsevier, vol. 1(1), pages 8-15.
    5. Easley,David & Kleinberg,Jon, 2010. "Networks, Crowds, and Markets," Cambridge Books, Cambridge University Press, number 9780521195331, Enero-Abr.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Fei, Liguo & Zhang, Qi & Deng, Yong, 2018. "Identifying influential nodes in complex networks based on the inverse-square law," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 1044-1059.
    2. Zhu, Yu-Xiao & Cao, Yan-Yan & Chen, Ting & Qiu, Xiao-Yan & Wang, Wei & Hou, Rui, 2018. "Crossover phenomena in growth pattern of social contagions with restricted contact," Chaos, Solitons & Fractals, Elsevier, vol. 114(C), pages 408-414.
    3. Curado, Manuel & Rodriguez, Rocio & Tortosa, Leandro & Vicent, Jose F., 2022. "Anew centrality measure in dense networks based on two-way random walk betweenness," Applied Mathematics and Computation, Elsevier, vol. 412(C).
    4. Bian, Tian & Hu, Jiantao & Deng, Yong, 2017. "Identifying influential nodes in complex networks based on AHP," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 479(C), pages 422-436.
    5. Xu, Shuqi & Mariani, Manuel Sebastian & Lü, Linyuan & Medo, Matúš, 2020. "Unbiased evaluation of ranking metrics reveals consistent performance in science and technology citation data," Journal of Informetrics, Elsevier, vol. 14(1).
    6. Guan-Nan Wang & Hui Gao & Lian Chen & Dennis N A Mensah & Yan Fu, 2015. "Predicting Positive and Negative Relationships in Large Social Networks," PLOS ONE, Public Library of Science, vol. 10(6), pages 1-14, June.
    7. Zhou, Yuhao & Wang, Ruijie & Zeng, An & Zhang, Yi-Cheng, 2020. "Identifying prize-winning scientists by a competition-aware ranking," Journal of Informetrics, Elsevier, vol. 14(3).
    8. Duan-Bing Chen & Hui Gao & Linyuan Lü & Tao Zhou, 2013. "Identifying Influential Nodes in Large-Scale Directed Networks: The Role of Clustering," PLOS ONE, Public Library of Science, vol. 8(10), pages 1-10, October.
    9. Jianlin Zhou & An Zeng & Ying Fan & Zengru Di, 2016. "Ranking scientific publications with similarity-preferential mechanism," Scientometrics, Springer;Akadémiai Kiadó, vol. 106(2), pages 805-816, February.
    10. Salustri, Andrea, 2013. "Daily life explorers, social networks and landscape policies," MPRA Paper 49864, University Library of Munich, Germany.
    11. Blazquez-Soriano, Amparo & Ramos-Sandoval, Rosmery, 2022. "Information transfer as a tool to improve the resilience of farmers against the effects of climate change: The case of the Peruvian National Agrarian Innovation System," Agricultural Systems, Elsevier, vol. 200(C).
    12. Wang, Dan & Zhou, Xiao & Zhao, Pengwei & Pang, Juan & Ren, Qiaoyang, 2025. "Early identification of breakthrough technologies: Insights from science-driven innovations," Journal of Informetrics, Elsevier, vol. 19(1).
    13. Mert Demirer & Francis X. Diebold & Laura Liu & Kamil Yilmaz, 2018. "Estimating global bank network connectedness," Journal of Applied Econometrics, John Wiley & Sons, Ltd., vol. 33(1), pages 1-15, January.
    14. BEDAYO, Mikel & MAULEON, Ana & VANNETELBOSCH, Vincent, 2012. "Bargaining and delay in trading networks," LIDAM Discussion Papers CORE 2012046, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    15. Chen, Jianrui & Wang, Hua & Wang, Lina & Liu, Weiwei, 2016. "A dynamic evolutionary clustering perspective: Community detection in signed networks by reconstructing neighbor sets," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 447(C), pages 482-492.
    16. Zhang, Pei-wen & Zhao, Lian-zheng & Wang, Yu & Ding, Rui & Du, Fu-min, 2024. "Air route link prediction based on the PSO-CLP model," Journal of Air Transport Management, Elsevier, vol. 120(C).
    17. Wei Zhong, 2017. "Simulating influenza pandemic dynamics with public risk communication and individual responsive behavior," Computational and Mathematical Organization Theory, Springer, vol. 23(4), pages 475-495, December.
    18. Lu, Jianquan & Guo, Xing & Huang, Tingwen & Wang, Zhen, 2019. "Consensus of signed networked multi-agent systems with nonlinear coupling and communication delays," Applied Mathematics and Computation, Elsevier, vol. 350(C), pages 153-162.
    19. Fenghua Wang & Ying Fan & An Zeng & Zengru Di, 2019. "Can we predict ESI highly cited publications?," Scientometrics, Springer;Akadémiai Kiadó, vol. 118(1), pages 109-125, January.
    20. Guo Weilong & Minca Andreea & Wang Li, 2016. "The topology of overlapping portfolio networks," Statistics & Risk Modeling, De Gruyter, vol. 33(3-4), pages 139-155, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0021202. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.