Simple random walk on distance-regular graphs

arXiv1301.6394MaRDI QIDQ6239098FDOQ6239098

Publication date: 27 January 2013

Abstract: A survey is presented of known results concerning simple random walk on the class of distance-regular graphs. One of the highlights is that electric resistance and hitting times between points can be explicitly calculated and given strong bounds for, which leads in turn to bounds on cover times, mixing times, etc. Also discussed are harmonic functions, moments of hitting and cover times, the Green's function, and the cutoff phenomenon. The main goal of the paper is to present these graphs as a natural setting in which to study simple random walk, and to stimulate further research in the field.

This page was built for publication: Simple random walk on distance-regular graphs

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