Monotone interaction of walk and graph: recurrence versus transience

preprint2014arXivOpen access

Abstract

We consider recurrence versus transience for models of random walks on domains of Zd\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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.