Ranking in Dynamic Graphs Using Exponential Centrality

Many large datasets from several fields of research such as biology or society can be represented as graphs. Additionally in many real applications, data is constantly being produced, leading to the notion of dynamic graphs. A heavily studied problem is identification of the most important vertices in a graph. This can be done using centrality measures, where a centrality metric computes a numerical value for each vertex in the graph. In this work we focus on centrality scores obtained from the computation of the matrix exponential. Specifically, we present a new dynamic algorithm for updating exponential centrality-based values of vertices in evolving graphs. We show that our method is faster than pure static recomputation, obtaining about 16\(\times \) speedup in real-world networks while maintaining a high quality of recall of the top ranked vertices in graphs. Moreover, we do not see a deterioration of the quality of our algorithm over time as more data is inserted into the graph.

[1]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[2]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

[3]  Michele Benzi,et al.  Total communicability as a centrality measure , 2013, J. Complex Networks.

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

[5]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[6]  Jari Saramäki,et al.  Path lengths, correlations, and centrality in temporal networks , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[8]  P. Bonacich.  Power and Centrality: A Family of Measures , 1987, American Journal of Sociology.

[9]  Carl D. Meyer,et al.  Stochastic Complementation, Uncoupling Markov Chains, and the Theory of Nearly Reducible Systems , 1989, SIAM Rev..

[10]  Amy Nicole Langville,et al.  Updating pagerank with iterative aggregation , 2004, WWW Alt. '04.

[11]  Cleve B. Moler,et al.  Nineteen Dubious Ways to Compute the Exponential of a Matrix, Twenty-Five Years Later , 1978, SIAM Rev..

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

[13]  Joseph T. Lizier,et al.  Identifying influential spreaders and efficiently estimating infection numbers in epidemic models: A walk counting approach , 2012, 1203.0502.

[14]  Ernesto Estrada,et al.  The Structure of Complex Networks: Theory and Applications , 2011 .

[15]  Desmond J. Higham,et al.  Betweenness in time dependent networks , 2015 .

[16]  H. Trotter.  On the product of semi-groups of operators , 1959 .

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

[18]  Dan Braha,et al.  From Centrality to Temporary Fame: Dynamic Centrality in Complex Networks , 2006, Complex..

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

[20]  M. Kendall.  A NEW MEASURE OF RANK CORRELATION , 1938 .

[21]  Mason A. Porter,et al.  Eigenvector-Based Centrality Measures for Temporal Networks , 2015, Multiscale Model. Simul..

[22]  Jérôme Kunegis,et al.  KONECT: the Koblenz network collection , 2013, WWW.

[23]  Michele Benzi,et al.  MATRIX FUNCTIONS , 2006 .

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

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

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

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

[28]  David F. Gleich,et al.  PageRank beyond the Web , 2014, SIAM Rev..

[29]  Peter Grindrod,et al.  A Matrix Iteration for Dynamic Network Summaries , 2013, SIAM Rev..