On the Localization of the Personalized PageRank of Complex Networks

In this paper new results on personalized PageRank are shown. We consider directed graphs that may contain dangling nodes. The main result presented gives an analytical characterization of all the possible values of the personalized PageRank for any node.We use this result to give a theoretical justification of a recent model that uses the personalized PageRank to classify users of Social Networks Sites. We introduce new concepts concerning competitivity and leadership in complex networks. We also present some theoretical techniques to locate leaders and competitors which are valid for any personalization vector and by using only information related to the adjacency matrix of the graph and the distribution of its dangling nodes.

[1]  Taher H. Haveliwala Topic-Sensitive PageRank: A Context-Sensitive Ranking Algorithm for Web Search , 2003, IEEE Trans. Knowl. Data Eng..

[2]  Sepandar D. Kamvar,et al.  An Analytical Comparison of Approaches to Personalizing PageRank , 2003 .

[3]  Konstantin Avrachenkov,et al.  Monte Carlo Methods for Top-k Personalized PageRank Lists and Name Disambiguation , 2010, ArXiv.

[4]  Sebastiano Vigna,et al.  PageRank: Functional dependencies , 2009, TOIS.

[5]  Francisco Pedroche Modelling Social Network Sites with PageRank and Social Competences , 2011 .

[6]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[7]  Christos Faloutsos,et al.  Fast Random Walk with Restart and Its Applications , 2006, Sixth International Conference on Data Mining (ICDM'06).

[8]  Magdalini Eirinaki UPR : Usage-based Page Ranking for Web Personalization , 2006 .

[9]  Amy Nicole Langville,et al.  Google's PageRank and beyond - the science of search engine rankings , 2006 .

[10]  Francisco Javier Moreno Arboleda,et al.  Leadership groups on Social Network Sites based on Personalized PageRank , 2013, Math. Comput. Model..

[11]  Deepayan Chakrabarti,et al.  Preserving Personalized Pagerank in Subgraphs , 2011, ICML.

[12]  Robert J. Plemmons,et al.  Nonnegative Matrices in the Mathematical Sciences , 1979, Classics in Applied Mathematics.

[13]  Michalis Vazirgiannis,et al.  Usage-based PageRank for Web personalization , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[14]  Jennifer Widom,et al.  Scaling personalized web search , 2003, WWW '03.

[15]  Gong Yu,et al.  Social Network Analysis Based on BSP Clustering Algorithm , 2007, Communications of the IIMA.

[16]  Francisco Pedroche Sánchez,et al.  Competitivity groups on social network sites , 2010, Math. Comput. Model..

[17]  Regino Criado,et al.  Choosing a leader on a complex network , 2007 .