Random walks on quasirandom graphs
Combinatorics
2013-12-20 v2
Abstract
Let G be a quasirandom graph on n vertices, and let W be a random walk on G of length alpha n^2. Must the set of edges traversed by W form a quasirandom graph? This question was asked by B\"ottcher, Hladk\'y, Piguet and Taraz. Our aim in this paper is to give a positive answer to this question. We also prove a similar result for random embeddings of trees.
Cite
@article{arxiv.1211.3296,
title = {Random walks on quasirandom graphs},
author = {Ben Barber and Eoin Long},
journal= {arXiv preprint arXiv:1211.3296},
year = {2013}
}
Comments
19 pages, 2 figures