On resistance distance of Markov chain and its sum rules
arXiv:1902.09078 · doi:10.1016/j.laa.2019.02.014
Abstract
Motivated by the notion of resistance distance on graph, we define a new resistance distance between two states on a given finite ergodic Markov chain based on its fundamental matrix. We prove a few equivalent formulations and discuss its relation with other parameters of the Markov chain such as its group inverse, stationary distribution, eigenvalues or hitting time. In addition, building upon existing sum rules for the hitting time of Markov chain, we give sum rules of this new resistance distance of Markov chains that resembles the sum rules of the resistance distance on graph. This yields Markov chain counterparts of various classical formulae such as Foster's first formula or the Kirchhoff index formulae.
arXiv commentTo appear in Linear Algebra Appl
References in corpus (5)
- Forest matrices around the Laplacian matrix
- Tree formulas, mean first passage times and Kemeny's constant of a Markov chain
- Modulus on graphs as a generalization of standard graph theoretic quantities
- Hitting Time Quasi-metric and Its Forest Representation
- A graph theoretic interpretation of the mean first passage times