Journal
MATHEMATICAL AND COMPUTER MODELLING
Volume 52, Issue 7-8, Pages 1052-1057Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.mcm.2010.02.031
Keywords
Google matrix; PageRank; Link analysis; Communication network; Social networking; Ranking algorithm
Categories
Funding
- Spanish DGI [MTM2007-64477]
Ask authors/readers for more resources
In this paper a new method to classify the users of an SNS (Social Network Site) into groups is shown. The method is based on the PageRank algorithm. Competitivity groups are sets of nodes that compete among each other to gain PageRank via the personalization vector. Specific features of the SNSs (such as number of friends or activity of the users) can modify the ranking inside each Competitivity group. The concept of Leadership Group is also presented. Some numerical examples are shown. These concepts can also be applied to general complex networks. (C) 2010 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
