Improved Mixing Rates of Directed Cycles by Added Connection

Balázs Gerencsér () and Julien M. Hendrickx ()
Additional contact information
Balázs Gerencsér: MTA Alfréd Rényi Institute of Mathematics
Julien M. Hendrickx: Université catholique de Louvain

Journal of Theoretical Probability, 2019, vol. 32, issue 2, 684-701

Abstract: 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.

Keywords: Mixing rate; Random graphs; Non-reversibility; 60J10; 05C80 (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10959-018-0861-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jotpro:v:32:y:2019:i:2:d:10.1007_s10959-018-0861-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10959

DOI: 10.1007/s10959-018-0861-x

Access Statistics for this article

Journal of Theoretical Probability is currently edited by Andrea Monica

More articles in Journal of Theoretical Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().