Random Walks on Quasirandom Graphs

Electronic Journal Of Combinatorics

Ben Barber¹ 

关键词: Random walks;    Quasirandom graphs;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

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 pap

【 授权许可】

Others