Random walks on quasirandom graphs
From MaRDI portal
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1495914 (Why is no real title available?)
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Concentration of measure and isoperimetric inequalities in product spaces
- Graph colouring and the probabilistic method
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Pseudo-random graphs
- Quasi-random graphs
- The number of trees
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(6)- An approximate version of the tree packing conjecture
- THE NEAREST UNVISITED VERTEX WALK ON RANDOM GRAPHS
- scientific article; zbMATH DE number 1103075 (Why is no real title available?)
- scientific article; zbMATH DE number 4216772 (Why is no real title available?)
- On the mean square displacement of a random walk on a graph
- Small subgraphs in the trace of a random walk
This page was built for publication: Random walks on quasirandom graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396948)