A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Rates of convergence for lamplighter processes
1997
Stochastic Processes and their Applications
Consider a graph, G, for which the vertices can have two modes, 0 or 1. Suppose that a particle moves around on G according to a discrete time Markov chain with the following rules. With (strictly positive) probabilities p"" p, and p, it moves to a randomly chosen neighbour, changes the mode of the vertex it is at or just stands still, respectively. We call such a random process a (p"" p" p,)-lamplighter process on G. Assume that the process starts with the particle in a fixed position and with
doi:10.1016/s0304-4149(97)00007-0
fatcat:y4ekchgjorer3kltcothc64ihm