On the Wasserstein Distance Between $k$-Step Probability Measures on Finite Graphs

Sophia Benjamin, Arushi Mantri, Quinn Perian

We consider random walks $X,Y$ on a finite graph $G$ with respective lazinesses $\alpha ,\beta \in [0,1]$. Let ${\mu }_k$ and ${\nu }_k$ be the $k$-step transition probability measures of $X$ and $Y$.…