Commuting time geometry of ergodic Markov chains
Probability
2017-10-27 v2
Abstract
We show how to map the states of an ergodic Markov chain to Euclidean space so that the squared distance between states is the expected commuting time. We find a minimax characterization of commuting times, and from this we get monotonicity of commuting times with respect to equilibrium transition rates. All of these results are familiar in the case of time-reversible chains, where techniques of classical electrical theory apply. In presenting these results, we take the opportunity to develop Markov chain theory in a `conformally correct' way
Cite
@article{arxiv.1107.2612,
title = {Commuting time geometry of ergodic Markov chains},
author = {Peter G. Doyle and Jean Steiner},
journal= {arXiv preprint arXiv:1107.2612},
year = {2017}
}
Comments
This revised version corrects a glaring error pointed out by Russ Lyons and Yuval Perez