Interchange process
= Interchange process
Place one distinct label at each vertex of a finite connected weighted <graph>. At rate $c_{uv}=c_{vu}\geq0$, interchange the labels at $u$ and $v$. This <continuous-time Markov chain> has a <uniform distribution on a finite set> as its <stationary distribution>. The position of one label is the <random walk> with the same rates.