Recurrence of horizontal-vertical walks

DOI10.1214/22-AIHP1277arXiv2012.10811OpenAlexW3116576347MaRDI QIDQ6100142FDOQ6100142

Authors: Swee Hong Chan 

Publication date: 21 June 2023

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

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 $q$). 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 $qin(frac13,1]$.

Full work available at URL: https://arxiv.org/abs/2012.10811

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

zbMATH Keywords

random walkrandom environmentrecurrencetransiencerotor-router

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Random walks on graphs (05C81) Processes in random environments (60K37)

Cites Work

• Title not available (Why is that?)
• Probability with Martingales
• Phase transition in reinforced random walk and RWRE on trees
• Intersections of random walks.
• Multi-excited random walks on integers
• Rotor walks and Markov chains
• Chip-Firing and Rotor-Routing on Directed Graphs
• A survey of random processes with reinforcement
• The rotor-router model on regular trees
• Abelian networks. I: Foundations and examples
• Title not available (Why is that?)
• Transience, recurrence and the speed of a random walk in a site-based feedback environment
• Choosing a spanning tree for the integer lattice uniformly
• A quenched invariance principle for non-elliptic random walk in i.i.d. balanced random environment
• Title not available (Why is that?)
• Title not available (Why is that?)
• Excited random walk
• Excited random walks with Markovian cookie stacks
• Excited random walk with periodic cookies
• On a general many-dimensional excited random walk
• Uniform spanning forests
• Positively and negatively excited random walks on integers, with branching processes
• Recurrence and transience of excited random walks on \(\mathbb Z^d\) and strips
• Title not available (Why is that?)
• Random walks in degenerate random environments
• Transience and recurrence of rotor-router walks on directed covers of graphs
• Edge-reinforced random walk, vertex-reinforced jump process and the supersymmetric hyperbolic sigma model
• Excited random walks: results, methods, open problems
• Potential kernel for two-dimensional random walk
• Recurrent rotor-router configurations
• Rotor-routing on Galton-Watson trees
• Rotor walks on general trees
• Escape rates for rotor walks in \(\mathbb{Z}^d\)
• Rotor-router aggregation on the comb
• Generalized Ray-Knight theory and limit theorems for self-interacting random walks on \(\mathbb{Z}^ 1\)
• Localization for linearly edge reinforced random walks
• Transience of edge-reinforced random walk
• Probability
• The range of a rotor walk
• A random Schrödinger operator associated with the Vertex Reinforced Jump Process on infinite graphs
• Rotor walks on transient graphs and the wired spanning forest
• Title not available (Why is that?)
• Random walks with local memory
• Interpolating between random walk and rotor walk
• A rotor configuration with maximum escape rate
• Abelian networks IV. Dynamics of nonhalting networks

Cited In (2)

• Random rotor walks and i.i.d. sandpiles on Sierpiński graphs
• Walking within growing domains: recurrence versus transience

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)