MATRIX FUNCTIONS

The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of undirected networks. In this paper we propose an extension of these measures to directed networks, and we apply them to the problem of ranking hubs and authorities. The extension is achieved by bipartization, i.e., the directed network is mapped onto a bipartite undirected network with twice as many nodes in order to obtain a network with a symmetric adjacency matrix. We explicitly determine the exponential of this adjacency matrix in terms of the adjacency matrix of the original, directed network, and we give an interpretation of centrality and communicability in this new context, leading to a technique for ranking hubs and authorities. The matrix exponential method for computing hubs and authorities is compared to the well known HITS algorithm, both on small artificial examples and on more realistic real-world networks. A few other ranking algorithms are also discussed and compared with our technique. The use of Gaussian quadrature rules for calculating hub and authority scores is discussed.

[1]  Daniel I Rubenstein,et al.  Aggression, grooming and group‐level cooperation in white‐faced capuchins (Cebus capucinus): insights from social networks , 2011, American journal of primatology.

[2]  Massimo Franceschet,et al.  PageRank , 2010, Commun. ACM.

[3]  Ayman Farahat,et al.  Authority Rankings from HITS, PageRank, and SALSA: Existence, Uniqueness, and Effect of Initialization , 2005, SIAM J. Sci. Comput..

[4]  J. A. Rodríguez-Velázquez,et al.  Subgraph centrality in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Nicholas J. Higham,et al.  The Scaling and Squaring Method for the Matrix Exponential Revisited , 2005, SIAM J. Matrix Anal. Appl..

[6]  N. Higham.  Functions of Matrices: Theory and Computation (Other Titles in Applied Mathematics) , 2008 .

[7]  Gábor Szabó,et al.  Structure of complex networks , 2005 .

[8]  Dániel Fogaras,et al.  Where to Start Browsing the Web? , 2003, IICS.

[9]  Desmond J. Higham,et al.  Network Science - Complexity in Nature and Technology , 2010, Network Science.

[10]  Sep Kamvar,et al.  Numerical Algorithms for Personalized Search in Self-organizing Information Networks , 2010 .

[11]  Inderjit S. Dhillon,et al.  Clustered low rank approximation of graphs in information science applications , 2011, SDM.

[12]  Chris Arney.  Network Analysis: Methodological Foundations , 2012 .

[13]  Allan Borodin,et al.  Finding authorities and hubs from link structures on the World Wide Web , 2001, WWW '01.

[14]  Amy Nicole Langville,et al.  A Survey of Eigenvector Methods for Web Information Retrieval , 2005, SIAM Rev..

[15]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[16]  César A. Hidalgo,et al.  Scale-free networks , 2008, Scholarpedia.

[17]  Timothy A. Davis,et al.  The university of Florida sparse matrix collection , 2011, TOMS.

[18]  Shilpa Chakravartula,et al.  Complex Networks: Structure and Dynamics , 2014 .

[19]  Ernesto Estrada,et al.  Communicability in complex networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  N. Higham.  Functions Of Matrices , 2008 .

[21]  Michele Benzi,et al.  The Physics of Communicability in Complex Networks , 2011, ArXiv.

[22]  R. Mccaldon,et al.  Aggression * , 1964 .

[23]  Albert-László Barabási,et al.  Scale-free networks , 2008, Scholarpedia.

[24]  Tony White,et al.  The Structure of Complex Networks , 2011 .

[25]  Ulrik Brandes,et al.  Network Analysis: Methodological Foundations (Lecture Notes in Computer Science) , 2005 .

[26]  Gang Wu,et al.  Identifying Potentially Important Concepts and Relations in an Ontology , 2008, International Semantic Web Conference.

[27]  Desmond J. Higham,et al.  Network Properties Revealed through Matrix Functions , 2010, SIAM Rev..

[28]  G. Golub,et al.  Matrices, Moments and Quadrature with Applications , 2009 .

[29]  Shlomo Moran,et al.  The stochastic approach for link-structure analysis (SALSA) and the TKC effect , 2000, Comput. Networks.

[30]  Nicholas J. Higham,et al.  Functions of matrices - theory and computation , 2008 .

[31]  David J. Hand,et al.  Who's #1? The science of rating and ranking , 2012 .

[32]  Joel C. Miller,et al.  Modifications of Kleinberg's HITS algorithm using matrix exponentiation and web log records , 2001, SIGIR '01.

[33]  MICHELE BENZI,et al.  N A ] 1 O ct 2 01 2 RANKING HUBS AND AUTHORITIES USING MATRIX FUNCTIONS , 2012 .

[34]  Mark E. J. Newman,et al.  Structure and Dynamics of Networks , 2009 .

[35]  Audra E. Kosh,et al.  Linear Algebra and its Applications , 1992 .

[36]  Ziv Bar-Yossef,et al.  Local approximation of PageRank and reverse PageRank , 2008, SIGIR '08.

[37]  Leo Katz,et al.  A new status index derived from sociometric analysis , 1953 .

[38]  Laks V. S. Lakshmanan,et al.  Fast Matrix Computations for Pairwise and Columnwise Commute Times and Katz Scores , 2011, Internet Math..

[39]  Chris H. Q. Ding,et al.  Link Analysis: Hubs and Authorities on the World Wide Web , 2004, SIAM Rev..

[40]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[41]  Christos H. Papadimitriou,et al.  On the Eigenvalue Power Law , 2002, RANDOM.

[42]  M. Benzi,et al.  Quadrature rule-based bounds for functions of adjacency matrices , 2010 .

[43]  Gang Wu,et al.  SWRank: An Approach for Ranking Semantic Web Reversely and Consistently , 2007, Third International Conference on Semantics, Knowledge and Grid (SKG 2007).

[44]  G. Golub,et al.  Bounds for the Entries of Matrix Functions with Applications to Preconditioning , 1999 .

[45]  Ziv Bar-Yossef,et al.  Local approximation of PageRank and reverse PageRank , 2008, SIGIR.

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

[47]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[48]  Ulrik Brandes,et al.  Network Analysis: Methodological Foundations , 2010 .

[49]  Desmond J. Higham,et al.  Mapping directed networks , 2010 .