Acceleration of Lamplighter Random Walks
Lorenz Gilch

TL;DR
This paper investigates the speed at which lamplighter random walks on wreath products escape to infinity, showing they do so faster than their projection on the base group under certain metrics.
Contribution
It demonstrates that lamplighter random walks on wreath products escape faster than their projections, especially when using the shortest traveling salesman tour metric.
Findings
Lamplighter random walks escape faster than their projections.
The rate of escape exceeds that of the base group's projection.
Results exclude some degenerate cases when the base group is orz.
Abstract
Suppose we are given an infinite, finitely generated group and a transient random walk on the wreath product , such that its projection on is transient and has finite first moment. This random walk can be interpreted as a lamplighter random walk on . Our aim is to show that the random walk on the wreath product escapes to infinity with respect to a suitable (pseudo-)metric faster than its projection onto . We also address the case where the pseudo-metric is the length of a shortest ``travelling salesman tour''. In this context, and excluding some degenerate cases if , the linear rate of escape is strictly bigger than the rate of escape of the lamplighter random walk's projection on .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Mathematical Dynamics and Fractals · Quantum chaos and dynamical systems
