A generalized inverse for graphs with absorption

Abstract We consider weighted, directed graphs with a notion of absorption on the vertices, related to absorbing random walks on graphs. We define a generalized inverse of the graph Laplacian, called the absorption inverse, that reflects both the graph structure as well as the absorption rates on the vertices. Properties of this generalized inverse are presented, including a basic relationship between the absorption inverse and the group inverse of a related graph, a forest theorem for interpreting the entries of the absorption inverse, as well as relationships between the absorption inverse and the fundamental matrix of the absorbing random walk. Applications of the absorption inverse for describing the structure of graphs with absorption are given, including a directed distance metric, spectral partitioning algorithm, and centrality measure.

[1]  Bryan L. Shader,et al.  Distances in Weighted Trees and Group Inverse of Laplacian Matrices , 1997, SIAM J. Matrix Anal. Appl..

[2]  Bernard F. Lamond,et al.  Generalized inverses in discrete time Markov decision process , 1989 .

[3]  Vivek S. Borkar,et al.  Quasi-stationary distributions as centrality measures for the giant strongly connected component of a reducible graph , 2010, J. Comput. Appl. Math..

[4]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[5]  S. Tavare,et al.  A Note on Finite Homogeneous Continuous-Time Markov Chains , 1979 .

[6]  Jean B. Lasserre,et al.  The fundamental matrix of singularly perturbed Markov chains , 1999, Advances in Applied Probability.

[7]  F. Chung.  Laplacians and the Cheeger Inequality for Directed Graphs , 2005 .

[8]  Kristina Lerman,et al.  Network Structure, Topology and Dynamics in Generalized Models of Synchronization , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  S. Chaiken.  A Combinatorial Proof of the All Minors Matrix Tree Theorem , 1982 .

[10]  K. Avrachenkov,et al.  Singular perturbations of Markov chains and decision processes , 2002 .

[11]  Katia Koelle,et al.  Phylodynamic Inference and Model Assessment with Approximate Bayesian Computation: Influenza as a Case Study , 2012, PLoS Comput. Biol..

[12]  J. Meyer.  The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains , 1975 .

[13]  P. Chebotarev,et al.  Forest Matrices Around the Laplaeian Matrix , 2002, math/0508178.

[14]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[15]  P J Schweitzer,et al.  Perturbation series expansions for nearly completely-decomposable Markov chains , 1986 .

[16]  Johan Bollen,et al.  Co-authorship networks in the digital library research community , 2005, Inf. Process. Manag..

[17]  Wenbo Zhao,et al.  PageRank and Random Walks on Graphs , 2010 .

[18]  P. Driessche,et al.  Disease invasion on community networks with environmental pathogen movement , 2014, Journal of Mathematical Biology.

[19]  Robert P. Dobrow,et al.  Introduction to Stochastic Processes With R: Dobrow/Introduction to Stochastic Processes With R , 2016 .

[20]  H. Hirai,et al.  On Tight Spans for Directed Distances , 2012 .

[21]  M. Neumann,et al.  Proximity in group inverses of M-matrices and inverses of diagonally dominant M-matrices , 2005 .

[22]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .

[23]  Moses Charikar,et al.  Directed metrics and directed graph partitioning problems , 2006, SODA '06.

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

[25]  Adi Ben-Israel,et al.  Generalized inverses: theory and applications , 1974 .

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

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

[28]  Pascal Hitzler,et al.  Generalized Distance Functions in the Theory of Computation , 2010, Comput. J..

[29]  Mason A. Porter,et al.  Communities in Networks , 2009, ArXiv.

[30]  Zhi-Li Zhang,et al.  A Geometric Approach to Robustness in Complex Networks , 2011, 2011 31st International Conference on Distributed Computing Systems Workshops.

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

[32]  Andrew B. Kahng,et al.  New spectral methods for ratio cut partitioning and clustering , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[33]  Kristina Lerman,et al.  Spectral Clustering with Epidemic Diffusion , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[34]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[35]  Pavel Yu. Chebotarev,et al.  The Forest Metrics for Graph Vertices , 2002, Electron. Notes Discret. Math..

[36]  C. E. Langenhop,et al.  The Laurent expansion for a nearly singular matrix , 1971 .

[37]  Michael Schroeder,et al.  Google Goes Cancer: Improving Outcome Prediction for Cancer Patients by Network-Based Ranking of Marker Genes , 2012, PLoS Comput. Biol..

[38]  Adi Ben-Israel.  On Matrices of Index Zero or One , 1969 .

[39]  R. Turner,et al.  Eigenvector Centrality Mapping for Analyzing Connectivity Patterns in fMRI Data of the Human Brain , 2010, PloS one.

[40]  John G. Kemeny,et al.  Finite Markov Chains. , 1960 .

[41]  Shirley Dex,et al.  JR 旅客販売総合システム（マルス）における運用及び管理について , 1991 .

[42]  Zhi-Li Zhang,et al.  Commute Times for a Directed Graph using an Asymmetric Laplacian , 2011 .