Rate of Escape on the Lamplighter Tree
Lorenz Gilch

TL;DR
This paper investigates the rate at which a random walk on a lamplighter group over a homogeneous tree escapes to infinity, providing bounds on its speed using group-theoretic and probabilistic methods.
Contribution
It offers new bounds for the escape rate of random walks on lamplighter groups over trees, advancing understanding of their asymptotic behavior.
Findings
Derived lower and upper bounds for the escape rate
Analyzed the behavior of random walks on lamplighter groups over trees
Enhanced understanding of transience and speed in these groups
Abstract
Suppose we are given a homogeneous tree of degree , where at each vertex sits a lamp, which can be switched on or off. This structure can be described by the wreath product , where is the free product group of factors . We consider a transient random walk on a Cayley graph of , for which we want to compute lower and upper bounds for the rate of escape, that is, the speed at which the random walk flees to infinity.
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
TopicsStochastic processes and statistical mechanics · Markov Chains and Monte Carlo Methods · Algorithms and Data Compression
