Open Access
2014 Monotone interaction of walk and graph: recurrence versus transience
Amir Dembo, Ruojun Huang, Vladas Sidoravicius
Author Affiliations +
Electron. Commun. Probab. 19: 1-12 (2014). DOI: 10.1214/ECP.v19-3607


We consider recurrence versus transience for models of random walks on growing in time, connected subsets $\mathbb{G}_t$ of some fixed locally finite, connected graph, in which monotone interaction enforces such growth as a result of visits by the walk (or probes it sent), to the neighborhood of the boundary of $\mathbb{G}_t$.


Download Citation

Amir Dembo. Ruojun Huang. Vladas Sidoravicius. "Monotone interaction of walk and graph: recurrence versus transience." Electron. Commun. Probab. 19 1 - 12, 2014.


Accepted: 6 November 2014; Published: 2014
First available in Project Euclid: 7 June 2016

zbMATH: 1307.60140
MathSciNet: MR3283607
Digital Object Identifier: 10.1214/ECP.v19-3607

Primary: 60K35
Secondary: 60G50 , 82C41

Keywords: Interacting particle system , random walk on growing domains , recurrence , Reinforced random walk

Back to Top