Random walks on quasirandom graphs

Ben Barber, Eoin Long

Research output: Contribution to journalArticle (Academic Journal)peer-review

3 Citations (Scopus)
95 Downloads (Pure)

Abstract

Let G be a quasirandom graph on n vertices, and let W be a random walk on G of length αn2. 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 number25
Number of pages18
JournalElectronic Journal of Combinatorics
Volume20
Issue number4
Publication statusPublished - 29 Nov 2013

Fingerprint

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

Cite this