Mixing time bounds for edge flipping on regular graphs
Probability
2022-12-15 v3 Combinatorics
Abstract
The edge flipping is a non-reversible Markov chain on a given connected graph, which is defined by Chung and Graham in [CG12]. In the same paper, its eigenvalues and stationary distributions for some classes of graphs are identified. We further study its spectral properties to show a lower bound for the rate of convergence in the case of regular graphs. Moreover, we show that a cutoff occurs at \frac{1}{4} n \log n for the edge flipping on the complete graph by a coupling argument.
Keywords
Cite
@article{arxiv.2201.03315,
title = {Mixing time bounds for edge flipping on regular graphs},
author = {Yunus Emre Demirci and Ümit Işlak and Alperen Yaşar Özdemir},
journal= {arXiv preprint arXiv:2201.03315},
year = {2022}
}
Comments
17 pages. A correction in the proof of Lemma 3.3 and minor revisions