Mixing Rates of Random Walks with Little Backtracking
Combinatorics
2015-06-05 v1 Discrete Mathematics
Probability
Abstract
Many regular graphs admit a natural partition of their edge set into cliques of the same order such that each vertex is contained in the same number of cliques. In this paper, we study the mixing rate of certain random walks on such graphs and we generalize previous results of Alon, Benjamini, Lubetzky and Sodin regarding the mixing rates of non-backtracking random walks on regular graphs.
Keywords
Cite
@article{arxiv.1506.01419,
title = {Mixing Rates of Random Walks with Little Backtracking},
author = {Sebastian M. Cioabă and Peng Xu},
journal= {arXiv preprint arXiv:1506.01419},
year = {2015}
}
Comments
31 pages; to appear in the CRM Proceedings Series, published by the American Mathematical Society as part of the Contemporary Mathematics Series