Improved mixing rates of directed cycles by added connection
Probability
2018-02-13 v4
Abstract
We investigate the mixing rate of a Markov chain where a combination of long distance edges and non-reversibility is introduced: as a first step, we focus here on the following graphs: starting from the cycle graph, we select random nodes and add all edges connecting them. We prove a square factor improvement of the mixing rate compared to the reversible version of the Markov chain.
Cite
@article{arxiv.1509.01431,
title = {Improved mixing rates of directed cycles by added connection},
author = {Balázs Gerencsér and Julien Hendrickx},
journal= {arXiv preprint arXiv:1509.01431},
year = {2018}
}