Skip to Main content Skip to Navigation
Conference papers

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

Abstract : 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 Brownian motion. In terms of Markov chains these cases correspond to positive recurrence, to null recurrence, and to non recurrence.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Wednesday, August 12, 2015 - 9:08:18 AM
Last modification on : Wednesday, October 13, 2021 - 7:58:04 PM
Long-term archiving on: : Friday, November 13, 2015 - 11:38:11 AM


Publisher files allowed on an open archive




Michael Drmota. Discrete Random Walks on One-Sided ``Periodic'' Graphs. Discrete Random Walks, DRW'03, 2003, Paris, France. pp.83-94, ⟨10.46298/dmtcs.3344⟩. ⟨hal-01183939⟩



Record views


Files downloads