Random walks on quasirandom graphs

Ben Barber, Eoin Long

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


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
Original languageEnglish
Article numberP25
Number of pages18
JournalThe Electronic Journal of Combinatorics
Publication statusPublished - 29 Nov 2013


  • Random Walks
  • Quasirandom graphs


Dive into the research topics of 'Random walks on quasirandom graphs'. Together they form a unique fingerprint.

Cite this