arXiv:1406.3764 [math.PR]AbstractReferencesReviewsResources
Monotone interaction of walk and graph: recurrence versus transience
Amir Dembo, Ruojun Huang, Vladas Sidoravicius
Published 2014-06-14Version 1
We consider recurrence versus transience for models of random walks on domains of $\mathbb{Z}^d$, 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.
Comments: 12 pages
Categories: math.PR
Related articles: Most relevant | Search more
arXiv:1504.07925 [math.PR] (Published 2015-04-29)
Transience and recurrence of random walks on percolation clusters in an ultrametric space
Recurrence or transience of random walks on random graphs generated by point processes in $\mathbb{R}^d$
Classification on the average of random walks