Leaders in Social Networks: The Delicious Case
Author Information
Author(s): Lü Linyuan, Zhang Yi-Cheng, Yeung Chi Ho, Zhou Tao
Primary Institution: University of Shanghai for Science and Technology
Hypothesis
Can identifying influential users in social networks enhance information discovery?
Conclusion
The LeaderRank algorithm outperforms PageRank in ranking effectiveness and robustness against manipulations in social networks.
Supporting Evidence
- LeaderRank identifies users who lead to quicker and wider spreading of information.
- LeaderRank is more tolerant of noisy data compared to PageRank.
- LeaderRank is robust against manipulations such as fake accounts.
Takeaway
This study shows that some users in social networks are more important than others, and finding these important users can help everyone find information better.
Methodology
The study used simulations and experiments to compare the LeaderRank algorithm with PageRank in identifying influential users in a social network.
Potential Biases
Potential manipulation of rankings by users creating fake accounts.
Limitations
The study focuses on a specific social network (delicious.com) and may not generalize to all social networks.
Participant Demographics
Users from delicious.com, a social bookmarking website.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website