### Abstract

Random walks on expander graphs were thoroughly studied, with the important motivation that, under some natural conditions, these walks mix quickly and provide an efficient method of sampling the vertices of a graph. The authors of [3] studied non-backtracking random walks on regular graphs, and showed that their mixing rate may be up to twice as fast as that of the simple random walk. As an application, they showed that the maximal number of visits to a vertex, made by a non-backtracking random walk of length n on a high-girth n-vertex regular expander, is typically (1+o(1)))log n/log log n, as in the case of the balls and bins experiment. They further asked whether one can establish the precise distribution of the visits such a walk makes. In this work, we answer the above question by combining a generalized form of Brun's sieve with some extensions of the ideas in [3]. Let N_{t} denote the number of vertices visited precisely t times by a non-backtracking random walk of length n on a regular n-vertex expander of fixed degree and girth g. We prove that if g = ω(1), then for any fixed t, N_{t}/n is typically 1/et! + o(1). Furthermore, if g = Ω(log log n), then N_{t}/n is typically 1+o(1)/et! niformly on all t ≤ (1 - o(1)) log n/log log n and 0 for all t ≥ (1 + o(1)) log n/log log n. In particular, we obtain the above result on the typical maximal number of visits to a single vertex, with an improved threshold window. The essence of the proof lies in showing that variables counting the number of visits to a set of sufficiently distant vertices are asymptotically independent Poisson variables.

Original language | English (US) |
---|---|

Pages (from-to) | 227-252 |

Number of pages | 26 |

Journal | Israel Journal of Mathematics |

Volume | 174 |

Issue number | 1 |

DOIs | |

State | Published - Nov 2009 |

### Fingerprint

### ASJC Scopus subject areas

- Mathematics(all)

### Cite this

*Israel Journal of Mathematics*,

*174*(1), 227-252. https://doi.org/10.1007/s11856-009-0112-z