Dynamic Katz and Related Network Measures

We study walk-based centrality measures for time-ordered network sequences. For the case of standard dynamic walk-counting, we show how to derive and compute centrality measures induced by analytic functions. We also prove that dynamic Katz centrality, based on the resolvent function, has the unique advantage of allowing computations to be performed entirely at the node level. We then consider two distinct types of backtracking and develop a framework for capturing dynamic walk combinatorics when either or both is disallowed.

[1]  Scott T. Grafton,et al.  Dynamic reconfiguration of human brain networks during learning , 2010, Proceedings of the National Academy of Sciences.

[2]  Nicola Santoro,et al.  Time-varying graphs and dynamic networks , 2010, Int. J. Parallel Emergent Distributed Syst..

[3]  Desmond J. Higham,et al.  Block Matrix Formulations for Evolving Networks , 2015, SIAM J. Matrix Anal. Appl..

[4]  George C. Verghese,et al.  Graph similarity scoring and matching , 2008, Appl. Math. Lett..

[5]  Jukka-Pekka Onnela,et al.  Community Structure in Time-Dependent, Multiscale, and Multiplex Networks , 2009, Science.

[6]  Peter Grindrod,et al.  The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis , 2018, SIAM J. Matrix Anal. Appl..

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

[8]  Lothar Reichel,et al.  Block matrix models for dynamic networks , 2021, Appl. Math. Comput..

[9]  Dario Fasino,et al.  Hitting times for non-backtracking random walks , 2021, ArXiv.

[10]  D. Higham,et al.  Beyond non-backtracking: non-cycling network centrality measures , 2020, Proceedings of the Royal Society A.

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

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

[13]  Sebastiano Vigna,et al.  Axioms for Centrality , 2013, Internet Math..

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

[15]  K. Hashimoto.  ON ZETA AND L-FUNCTIONS OF FINITE GRAPHS , 1990 .

[16]  Mark C. Parsons,et al.  Communicability across evolving networks. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Jari Saramäki,et al.  Temporal Networks , 2011, Encyclopedia of Social Network Analysis and Mining.

[18]  P. Dooren,et al.  Similarity matrices for colored graphs , 2009 .

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

[20]  Peter Grindrod,et al.  On the exponential generating function for non-backtracking walks , 2018, Linear Algebra and its Applications.

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

[22]  Peter Grindrod,et al.  Non-backtracking walk centrality for directed networks , 2018, J. Complex Networks.

[23]  Alexander V. Mantzaris,et al.  A model for dynamic communicators , 2012, European Journal of Applied Mathematics.

[24]  Alexander V. Mantzaris,et al.  Discovering and validating influence in a dynamic online social network , 2013, Social Network Analysis and Mining.

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

[26]  Ernesto Estrada,et al.  Communicability in temporal networks. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[28]  R. Stanley.  Enumerative Combinatorics: Volume 1 , 2011 .