Random walks on quasirandom graphs

zbMath1295.05213arXiv1211.3296MaRDI QIDQ396948

Eoin Long, Ben Barber

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1211.3296

zbMATH Keywords

random walksquasirandom graphs

Mathematics Subject Classification ID

Random walks on graphs (05C81)

Related Items (2)

An approximate version of the tree packing conjecture ⋮ Small subgraphs in the trace of a random walk

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Concentration of measure and isoperimetric inequalities in product spaces
• The number of trees
• Quasi-random graphs
• Graph colouring and the probabilistic method

This page was built for publication: Random walks on quasirandom graphs