Acceleration of lamplighter random walks
نویسنده
چکیده
Suppose we are given an infinite, finitely generated group G and a transient random walk with bounded range on the wreath product (Z/2Z) ≀ G, such that its projection on G is transient. This random walk can be interpreted as a lamplighter random walk, where there is a lamp at each element of G, which can be switched on and off, and a lamplighter walks along G and switches lamps randomly on and off. Our aim is to show that the lamplighter random walk escapes with respect to a suitable (pseudo-)metric on the wreath product faster to infinity than its projection onto G. For this purpose, we show that the asymptotic linear rate of burning lamps is non-zero, providing an acceleration of the lamplighter. If lamp switches are not charged by the pseudo-metric and if G 6= Z, we prove that the rate of escape with respect to the pseudo-metric, which becomes the length of a shortest “travelling salesman tour”, is strictly bigger than the rate of escape of the lamplighter random walk’s projection on G. We prove the same for nondegenerate cases if G = Z. Furthermore, we prove for G having infinitely many ends the acceleration with respect to a Markovian distance, which arises from probabilities on (Z/2Z) ≀ G and the metric on G.
منابع مشابه
Harmonic analysis of finite lamplighter random walks
Recently, several papers have been devoted to the analysis of lamplighter random walks, in particular when the underlying graph is the infinite path Z. In the present paper, we develop a spectral analysis for lamplighter random walks on finite graphs. In the general case, we use the C2-symmetry to reduce the spectral computations to a series of eigenvalue problems on the underlying graph. In th...
متن کاملA note on the Poisson boundary of lamplighter random walks
The main goal of this paper is to determine the Poisson boundary of lamplighter random walks over a general class of discrete groups Γ endowed with a “rich” boundary. The starting point is the Strip Criterion of identification of the Poisson boundary for random walks on discrete groups due to Kaimanovich [16]. A geometrical method for constructing the strip as a subset of the lamplighter group ...
متن کاملThe Poisson Boundary of Lamplighter Random Walks on Trees
Let Tq be the homogeneous tree with degree q + 1 ≥ 3 and G a finitely generated group whose Cayley graph is Tq. The associated lamplighter group is the wreath product Zr ≀ G, where Zr is the cyclic group of order r. For a large class of random walks on this group, we prove almost sure convergence to a natural geometric boundary. If the probability law governing the random walk has finite first ...
متن کاملOn the Eigenspaces of Lamplighter Random Walks and Percolation Clusters on Graphs
We show that the Plancherel measure of the lamplighter random walk on a graph coincides with the expected spectral measure of the absorbing random walk on the Bernoulli percolation clusters. In the subcritical regime the spectrum is pure point and we construct a complete set of finitely supported eigenfunctions.
متن کاملLarge deviations for stable like random walks on Z d with applications to random walks on wreath products ∗
We derive Donsker-Vardhan type results for functionals of the occupation times when the underlying random walk on Z is in the domain of attraction of an operatorstable law on R. Applications to random walks on wreath products (also known as lamplighter groups) are given.
متن کامل