Block coupling and rapidly mixing k-heights

Stefan Felsner, Daniel Heldt, Sandro Roch +1

A $k$-height on a graph $G=(V,E)$ is an assignment $V\to \{0,\dots ,k\}$ such that the value on ajacent vertices differs by at most $1$. We study the Markov chain on $k$-heights…