On resistance distance of Markov chain and its sum rules

DOI10.1016/j.laa.2019.02.014zbMath1414.60056arXiv1902.09078OpenAlexW2917454952MaRDI QIDQ2419004

Michael C. H. Choi

Publication date: 29 May 2019

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.09078

zbMATH Keywords

Markov chainsfundamental matrixsum rulesgroup inversehitting timeresistance distance

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (5)

Kron Reduction and Effective Resistance of Directed Graphs ⋮ Minimal hexagonal chains with respect to the Kirchhoff index ⋮ On the Kemeny time for continuous-time reversible and irreversible Markov processes with applications to stochastic resetting and to conditioning towards forever-survival ⋮ A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities ⋮ Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix

Cites Work

• Unnamed Item
• Unnamed Item
• Some more interplay of the three Kirchhoffian indices
• Eigentime identity for asymmetric finite Markov chains
• On a conjecture concerning spanning tree invariants and loop systems
• Random walks and the effective resistance of networks
• Sum rules for hitting times of Markov chains
• Ergodic potential
• Tree formulas, mean first passage times and Kemeny's constant of a Markov chain
• A proof of the Markov chain tree theorem
• Forest matrices around the Laplacian matrix
• Commute times for a directed graph using an asymmetric Laplacian
• On the matrix equation \(Ax =\lambda Bx\)
• Modulus on graphs as a generalization of standard graph theoretic quantities
• A New Notion of Effective Resistance for Directed Graphs—Part I: Definition and Properties
• A New Notion of Effective Resistance for Directed Graphs—Part II: Computing Resistances
• The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains
• An Extension of Foster's Network Theorem
• Kemeny's Constant and the Random Surfer
• The eigentime identity for continuous-time ergodic Markov chains
• THE DEVIATION MATRIX OF A CONTINUOUS-TIME MARKOV CHAIN
• On the Kemeny constant and stationary distribution vector for a Markov chain
• On ergodic diffusions on continuous graphs whose centered resolvent admits a trace

This page was built for publication: On resistance distance of Markov chain and its sum rules