Recurrence of horizontal-vertical walks
From MaRDI portal
Publication:6100142
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 .
Recommendations
- Recurrence of random walk traces
- Recurrence of Symmetric Random Walks
- Recurrence of Simple Random Walk in the Plane
- Planar walks with recursive initial conditions
- The multiple range of two-dimensional recurrent walk
- RECURRENCE FOR PERSISTENT RANDOM WALKS IN TWO DIMENSIONS
- Recurrence of inhomogeneous random walks
- Recurrence and collisions of random walks
- A note on recurrent random walks
Cites work
- scientific article; zbMATH DE number 1256746 (Why is no real title available?)
- scientific article; zbMATH DE number 1025825 (Why is no real title available?)
- scientific article; zbMATH DE number 2070282 (Why is no real title available?)
- scientific article; zbMATH DE number 218327 (Why is no real title available?)
- scientific article; zbMATH DE number 2125074 (Why is no real title available?)
- scientific article; zbMATH DE number 1444762 (Why is no real title available?)
- A quenched invariance principle for non-elliptic random walk in i.i.d. balanced random environment
- A random Schrödinger operator associated with the Vertex Reinforced Jump Process on infinite graphs
- A rotor configuration with maximum escape rate
- A survey of random processes with reinforcement
- Abelian networks IV. Dynamics of nonhalting networks
- Abelian networks. I: Foundations and examples
- Chip-Firing and Rotor-Routing on Directed Graphs
- Choosing a spanning tree for the integer lattice uniformly
- Edge-reinforced random walk, vertex-reinforced jump process and the supersymmetric hyperbolic sigma model
- Escape rates for rotor walks in \(\mathbb{Z}^d\)
- Excited random walk
- Excited random walk with periodic cookies
- Excited random walks with Markovian cookie stacks
- Excited random walks: results, methods, open problems
- Generalized Ray-Knight theory and limit theorems for self-interacting random walks on \(\mathbb{Z}^ 1\)
- Interpolating between random walk and rotor walk
- Intersections of random walks.
- Localization for linearly edge reinforced random walks
- Multi-excited random walks on integers
- On a general many-dimensional excited random walk
- Phase transition in reinforced random walk and RWRE on trees
- Positively and negatively excited random walks on integers, with branching processes
- Potential kernel for two-dimensional random walk
- Probability
- Probability with Martingales
- Random walks in degenerate random environments
- Random walks with local memory
- Recurrence and transience of excited random walks on \(\mathbb Z^d\) and strips
- Recurrent rotor-router configurations
- Rotor walks and Markov chains
- Rotor walks on general trees
- Rotor walks on transient graphs and the wired spanning forest
- Rotor-router aggregation on the comb
- Rotor-routing on Galton-Watson trees
- The range of a rotor walk
- The rotor-router model on regular trees
- Transience and recurrence of rotor-router walks on directed covers of graphs
- Transience of edge-reinforced random walk
- Transience, recurrence and the speed of a random walk in a site-based feedback environment
- Uniform spanning forests
Cited in
(2)
This page was built for publication: Recurrence of horizontal-vertical walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6100142)