Recurrence of horizontal-vertical walks
arXiv:2012.10811 · doi:10.1214/22-aihp1277
Abstract
Consider a nearest neighbor random walk on the two-dimensional integer lattice, where each vertex is initially labeled either `H' or `V', uniformly and independently. At each discrete time step, the walker resamples the label at its current location (changing `H' to `V' and `V' to `H' with probability ). Then, it takes a mean zero horizontal step if the new label is `H', and a mean zero vertical step if the new label is `V'. This model is a randomized version of the deterministic rotor walk, for which its recurrence (i.e., visiting every vertex infinitely often with probability 1) in two dimensions is still an open problem. We answer the analogous question for the the horizontal-vertical walk, by showing that the horizontal-vertical walk is recurrent for .
arXiv comment33 pages, 3 figures. Extra references added. To appear in Ann. Inst. Henri Poincaré Probab. Stat
References in corpus (16)
- A survey of random processes with reinforcement
- Eulerian Walkers as a model of Self-Organised Criticality
- Chip-Firing and Rotor-Routing on Directed Graphs
- Excited Random Walk
- Recurrence of edge-reinforced random walk on a two-dimensional graph
- Localization for Linearly Edge Reinforced Random Walks
- The Rotor-Router Model on Regular Trees
- On a general many-dimensional excited random walk
- Excited random walks: results, methods, open problems
- Transience and recurrence of rotor-router walks on directed covers of graphs
- Excited random walk with periodic cookies
- Abelian networks IV. Dynamics of nonhalting networks
- Rotor walks on transient graphs and the wired spanning forest
- Solution manifold and Its Statistical Applications
- Random walks with local memory
- A rotor configuration with maximum escape rate