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öttcher, Hladký, 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.
@article{10_37236_3275,
author = {Ben Barber and Eoin Long},
title = {Random walks on quasirandom graphs},
journal = {The electronic journal of combinatorics},
year = {2013},
volume = {20},
number = {4},
doi = {10.37236/3275},
zbl = {1295.05213},
url = {http://geodesic.mathdoc.fr/articles/10.37236/3275/}
}
TY - JOUR
AU - Ben Barber
AU - Eoin Long
TI - Random walks on quasirandom graphs
JO - The electronic journal of combinatorics
PY - 2013
VL - 20
IS - 4
UR - http://geodesic.mathdoc.fr/articles/10.37236/3275/
DO - 10.37236/3275
ID - 10_37236_3275
ER -
%0 Journal Article
%A Ben Barber
%A Eoin Long
%T Random walks on quasirandom graphs
%J The electronic journal of combinatorics
%D 2013
%V 20
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/3275/
%R 10.37236/3275
%F 10_37236_3275
Ben Barber; Eoin Long. Random walks on quasirandom graphs. The electronic journal of combinatorics, Tome 20 (2013) no. 4. doi: 10.37236/3275
