Monotone interaction of walk and graph: recurrence versus transience
Probability
2014-06-17 v1
Abstract
We consider recurrence versus transience for models of random walks on domains of , in which monotone interaction enforces domain growth as a result of visits by the walk (or probes it sent), to the neighborhood of domain boundary.
Keywords
Cite
@article{arxiv.1406.3764,
title = {Monotone interaction of walk and graph: recurrence versus transience},
author = {Amir Dembo and Ruojun Huang and Vladas Sidoravicius},
journal= {arXiv preprint arXiv:1406.3764},
year = {2014}
}
Comments
12 pages