Monotone interaction of walk and graph: Recurrence versus transience

Abstract

We consider recurrence versus transience for models of random walks on growing in time, connected subsets Gtof 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 Gt.