Meeting times of Markov chains via singular value decomposition

Thomas van Belle, Anton Klimovsky

We suggest a non-asymptotic matrix perturbation-theoretic approach to get sharp bounds on the expected meeting time of random walks on large (possibly random) graphs. We provide a…