Discrete Random Walks on One-Sided ``Periodic'' Graphs

Michael Drmota
2003 Discrete Mathematics & Theoretical Computer Science  
International audience In this paper we consider discrete random walks on infinite graphs that are generated by copying and shifting one finite (strongly connected) graph into one direction and connecting successive copies always in the same way. With help of generating functions it is shown that there are only three types for the asymptotic behaviour of the random walk. It either converges to the stationary distribution or it can be approximated in terms of a reflected Brownian motion or by a
more » ... rownian motion. In terms of Markov chains these cases correspond to positive recurrence, to null recurrence, and to non recurrence.
doi:10.46298/dmtcs.3344 fatcat:g45mkyiumbdafjqfqdvnuesugy