Mixing time for the random walk on the range of the random walk on tori

preprint2015arXivOpen access

Abstract

Consider the subgraph of the discrete dd-dimensional torus of size length NN, d≥3d\ge3, induced by the range of the simple random walk on the torus run until the time uNduN^d. We prove that for all d≥3d\ge 3 and u>0u>0, the mixing time for the random walk on this subgraph is of order N2N^2 with probability at least 1−Ce−(log⁡N)21 - Ce^{-(\log N)^2}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.