Cutpoints for Random Walks on Quasi-Transitive Graphs
From MaRDI portal
Abstract: We prove that a simple random walk on quasi-transitive graphs with the volume growth being faster than any polynomial of degree 4 has a.s. infinitely many cut times, and hence infinitely many cutpoints. This confirms a conjecture raised by I. Benjamini, O. Gurel-Gurevich and O. Schramm [2011, Cutpoints and resistance of random walk paths, {it Ann. Probab.} {�f 39(3)}, 1122-1136] that PATH of simple random walk on any transient vertex-transitive graph has a.s. infinitely many cutpoints in the corresponding case.
This page was built for publication: Cutpoints for Random Walks on Quasi-Transitive Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6294957)
