Journal
JOURNAL OF THEORETICAL PROBABILITY
Volume 32, Issue 2, Pages 684-701Publisher
SPRINGER/PLENUM PUBLISHERS
DOI: 10.1007/s10959-018-0861-x
Keywords
Mixing rate; Random graphs; Non-reversibility
Categories
Funding
- NKFIH (National Research, Development and Innovation Office) [PD 121107]
- DYSCO Network (Dynamical Systems, Control, and Optimization) - Interuniversity Attraction Poles Programme
- Concerted Research Action (ARC) of the French Community of Belgium
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
