Rates of convergence for lamplighter processes

Olle Häggstr^:om, Johan Jonasson
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
more » ... all vertices having mode 0. The convergence rate to stationarity in terms of the total variation norm is studied for the special cases with G = XN, the complete graph with N vertices, and when G = Z mod N. In the former case we prove that as N -+ a, ((2~~ + p,)/4p,p,)N log N is a threshold for the convergence rate. In the latter case we show that the convergence rate is asymptotically determined by the cover time CN in that the total variation norm after aN2 steps is given by P(CN > UN'). The limit of this probability can in turn be calculated by considering a Brownian motion with two absorbing barriers. In particular, this means that there is no threshold for this case.
doi:10.1016/s0304-4149(97)00007-0 fatcat:y4ekchgjorer3kltcothc64ihm