Mixing time bounds for edge flipping on regular graphs
Probability
2022-09-07 v2 Combinatorics
Abstract
The edge flipping is a non-reversible Markov chain on a given connected graph, which is defined by Chung and Graham. 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 1/4 n log n for the edge flipping on the complete graph by a coupling argument
Keywords
Cite
@article{arxiv.2208.14618,
title = {Mixing time bounds for edge flipping on regular graphs},
author = {Yunus Emre Demirci and Ümit Işlak and Alperen Özdemir},
journal= {arXiv preprint arXiv:2208.14618},
year = {2022}
}
Comments
This manuscript has been withdrawn as a duplicate. The article is available at: arXiv:2201.03315v2