Author:
Moreno Francisco Javier,Hernández Santiago
Abstract
<p class="Abstractandkeywordscontent"><span lang="EN-US">A research field in the area of social networks (SNs) is the identification of some types of users and groups. To facilitate this process, a SN is usually represented by a graph. The centrality measures, which identify the most important vertices in a graph according to some criterion, are usual tools to analyze a graph. One of these measures is the PageRank (a measure originally designed to classify web pages). Informally, in the context of a SN, the PageRank of a user <em>i</em> represents the probability that another user of the SN is seeing the page of <em>i</em> after a considerable time of navigation in the SN. In this paper, we define a new type of user in a SN: <em>the best current friend</em>. The idea is to identify, among the friends of a user <em>i</em>, who is the friend <em>k</em> that would generate the highest decrease in the PageRank of <em>i</em> if <em>k </em>stops being his/her friend. This may be useful to identify the users/customers whose friendship/relationship should be a priority to keep. We provide formal definitions, algorithms and some experiments for this subject. Our experiments showed that the best current friend of a user is not necessarily the one who has the highest PageRank in the SN nor the one who has more friends.</span></p>
Publisher
Universidad Nacional de Colombia
Subject
General Engineering,Building and Construction
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献