A note on mixing times of planar random walks

arXiv1205.3980MaRDI QIDQ6233064FDOQ6233064

Authors: James R. Lee, Teng Qin 

Publication date: 17 May 2012

Abstract: We present an infinite family of finite planar graphs $X_n$ with degree at most five and such that for some constant $c>0$, ${\displaystyle }$ lambda_1(X_n) geq c(frac{log diam(X_n)}{diam(X_n)})^2,, ${\displaystyle }$ where $lambd{a}_1$ denotes the smallest non-zero eigenvalue of the graph Laplacian. This significantly simplifies a construction of Louder and Souto. We also remark that such a lower bound cannot hold when the diameter is replaced by the average squared distance: There exists a constant $c>0$ such that for any family $X_n$ of planar graphs we have ${\displaystyle }$ lambda_1(X_n) leq c (frac{1}{|X_n|^2} sum_{x,y in X_n} d(x,y)^2)^{-1},, ${\displaystyle }$ where $d$ denotes the path metric on $X_n$.

This page was built for publication: A note on mixing times of planar random walks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6233064)