@article{ECP3607,
author = {Amir Dembo and Ruojun Huang and Vladas Sidoravicius},
title = {Monotone interaction of walk and graph: recurrence versus transience},
journal = {Electron. Commun. Probab.},
fjournal = {Electronic Communications in Probability},
volume = {19},
year = {2014},
keywords = {Recurrence; interacting particle system; reinforced random walk; random walk on growing domains},
abstract = {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$.},
pages = {no. 76, 1-12},
issn = {1083-589X},
doi = {10.1214/ECP.v19-3607},
url = {http://ecp.ejpecp.org/article/view/3607}}