arXiv Analytics

Sign in

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.

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
arXiv:1305.4878 [math.PR] (Published 2013-05-21, updated 2014-09-20)
Recurrence or transience of random walks on random graphs generated by point processes in $\mathbb{R}^d$
arXiv:math/0104252 [math.PR] (Published 2001-04-26, updated 2002-03-14)
Classification on the average of random walks