DOAJ
Open Access
2003
Discrete Random Walks on One-Sided ``Periodic'' Graphs
Michael Drmota
Abstrak
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.
Topik & Kata Kunci
Penulis (1)
M
Michael Drmota
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2003
- Sumber Database
- DOAJ
- DOI
- 10.46298/dmtcs.3344
- Akses
- Open Access ✓