Random walks with local memory
arXiv:1809.04710 · doi:10.1007/s10955-021-02791-5
Abstract
We prove a quenched invariance principle for a class of random walks in random environment on , where the walker alters its own environment. The environment consists of an outgoing edge from each vertex. The walker updates the edge at its current location to a new random edge (whose law depends on ) and then steps to the other endpoint of . We show that a native environment for these walks (i.e., an environment that is stationary in time from the perspective of the walker) consists of the wired uniform spanning forest oriented toward the walker, plus an independent outgoing edge from the walker.
arXiv commentv3 merges several theorems into one theorem (e.g., Theorem 1.1 and Theorem 5.7 in the old version becomes Theorem 1.1). Typesetting is changed to save space. 23 pages, 8 figures
References in corpus (15)
- Equality of Opportunity in Supervised Learning
- Eulerian Walkers as a model of Self-Organised Criticality
- Chip-Firing and Rotor-Routing on Directed Graphs
- An almost sure invariance principle for random walks in a space-time random environment
- Excited Random Walk
- Sandpile groups and spanning trees of directed line graphs
- Exponential Varieties
- On a general many-dimensional excited random walk
- Limit laws of transient excited random walks on integers
- Statistical Inference for Cluster Trees
- Interlacements and the Wired Uniform Spanning Forest
- Excited random walks: results, methods, open problems
- Algebraic statistical models
- Excited random walk with periodic cookies
- Recurrence of horizontal-vertical walks