In this note, we demonstrate an instance of bounded-degree graphs of size $n$, for which the total variation mixing time for the random walk is decreased by a factor of $\log n/ \log\log n$ if we multiply the edge-conductances by…
Fecha:
2013-01-03
Recurso:
Electronic communications in probability
CIC - Centro de Información y Conocimiento Johannes Gutenberg ®