Exponential Ranking: Taking into Account Negative Links

Networks have attracted a great deal of attention the last decade, and play an important role in various scientific disciplines. Ranking nodes in such networks, based on for example PageRank or eigenvector centrality, remains a hot topic. Not only does this have applications in ranking web pages, it also allows peer-to-peer systems to have effective notions of trust and reputation and enables analyses of various (social) networks. Negative links however, confer distrust or dislike as opposed to positive links, and are usually not taken into account. In this paper we propose a ranking method we call exponential ranking, which allows for negative links in the network. We show convergence of the method, and demonstrate that it takes into account negative links effectively.

[1]  P. Bonacich.  Factoring and weighting approaches to status scores and clique identification , 1972 .

[2]  Serge A. Plotkin,et al.  Keeping Peers Honest In EigenTrust , 2004 .

[3]  S. Fortunato,et al.  Spectral centrality measures in complex networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[5]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[6]  T. Wong,et al.  Sexual network analysis of a gonorrhoea outbreak , 2004, Sexually Transmitted Infections.

[7]  John Riedl,et al.  Item-based collaborative filtering recommendation algorithms , 2001, WWW '01.

[8]  V. Traag,et al.  Community detection in networks with positive and negative links. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Paul Resnick,et al.  The value of reputation on eBay: A controlled experiment , 2002 .

[10]  Paul Van Dooren,et al.  The PageTrust Algorithm: How to rank web pages when negative links are allowed? , 2008, SDM.

[11]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

[12]  S Redner,et al.  Dynamics of social balance on networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[14]  Zeev Maoz,et al.  What Is the Enemy of My Enemy? Causes and Consequences of Imbalanced International Relations, 1816–2001 , 2007, The Journal of Politics.

[15]  Duncan J Watts,et al.  A simple model of global cascades on random networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[16]  Paolo Avesani,et al.  Controversial Users Demand Local Trust Metrics: An Experimental Study on Epinions.com Community , 2005, AAAI.

[17]  Michael Szell,et al.  Multirelational organization of large-scale social networks in an online world , 2010, Proceedings of the National Academy of Sciences.

[18]  F. Harary,et al.  On the Coloring of Signed Graphs. , 1968 .

[19]  Ramanathan V. Guha,et al.  Propagation of trust and distrust , 2004, WWW '04.

[20]  R. Christley,et al.  Infection in social networks: using network analysis to identify high-risk individuals. , 2005, American journal of epidemiology.

[21]  Jure Leskovec,et al.  Predicting positive and negative links in online social networks , 2010, WWW '10.

[22]  Phillip Bonacich,et al.  Some unique properties of eigenvector centrality , 2007, Soc. Networks.

[23]  André de Palma,et al.  Discrete Choice Theory of Product Differentiation , 1995 .

[24]  Paolo Massa,et al.  Page-reRank: using trusted links to re-rank authority , 2005, The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05).

[25]  F. Harary.  On the notion of balance of a signed graph. , 1953 .