Volume: 32 • Number: 2 • Pages: 684-701

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.