Random walks on quasirandom graphs (Q396948)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Random walks on quasirandom graphs |
scientific article; zbMATH DE number 6330356
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Random walks on quasirandom graphs |
scientific article; zbMATH DE number 6330356 |
Statements
Random walks on quasirandom graphs (English)
0 references
14 August 2014
0 references
Summary: 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.
0 references
random walks
0 references
quasirandom graphs
0 references
0 references
0.7557576298713684
0 references
0.754984438419342
0 references
0.7504465579986572
0 references
0.744816243648529
0 references
