Monotone interaction of walk and graph: recurrence versus transience
classification
🧮 math.PR
keywords
domaininteractionmonotonerecurrencetransienceversuswalkboundary
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.