Random walks with local memory

DOI10.1007/S10955-021-02791-5MaRDI QIDQ2046500zbMATH OpenOpenAlexFDO

Authors Swee Hong Chan, Lila Greco, Lionel Levine, Peter Li

Publication date 18 August 2021

Published in Journal of Statistical Physics (Search for Journal in Brave)

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

zbMATH Keywords

Brownian motionrandom environmentrandom walkrotor walkrotor-routerscaling limitstationary distributionuniform spanning forestwired spanning forest

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Processes in random environments (60K37) Dynamics of random walks, random surfaces, lattice animals, etc. in time-dependent statistical mechanics (82C41)

Abstract: We prove a quenched invariance principle for a class of random walks in random environment on $mathbb{Z}^d$, where the walker alters its own environment. The environment consists of an outgoing edge from each vertex. The walker updates the edge $e$ at its current location to a new random edge $e^{\prime }$ (whose law depends on $e$) and then steps to the other endpoint of $e^{\prime }$. 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.

Recommendations

• The quenched invariance principle for random walks in random environments admitting a bounded cycle representation
• Quenched invariance principle for random walks in balanced random environment
• Quenched invariance principles for random walks with random conductances
• An invariance principle for a class of non-ballistic random walks in random environment
• scientific article

Cites work

• Abelian networks. I: Foundations and examples
• An almost sure invariance principle for random walks in a space-time random environment
• An expansion for self-interacting random walks
• Central limit theorem for the excited random walk in dimension d 2
• Chip-Firing and Rotor-Routing on Directed Graphs
• Choosing a spanning tree for the integer lattice uniformly
• Ergodic theorems and ergodic decomposition for Markov chains
• Excited random walk
• Excited random walk in a Markovian environment
• Excited random walk with periodic cookies
• Excited random walks with Markovian cookie stacks
• Excited random walks: results, methods, open problems
• Functional limit laws for recurrent excited random walks with periodic cookie stacks
• Generalized Ray-Knight theory and limit theorems for self-interacting random walks on \(\mathbb{Z}^ 1\)
• Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
• scientific article; zbMATH DE number 3764885 (Why is no real title available?)
• scientific article; zbMATH DE number 1256746 (Why is no real title available?)
• scientific article; zbMATH DE number 2070282 (Why is no real title available?)
• scientific article; zbMATH DE number 1849077 (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?)
• Interlacements and the wired uniform spanning forest
• Interpolating between random walk and rotor walk
• Limit laws of transient excited random walks on integers
• On a general many-dimensional excited random walk
• On the multi-dimensional elephant random walk
• Probability on trees and networks
• Sandpile groups and spanning trees of directed line graphs
• Scaling limits of recurrent excited random walks on integers
• The ``true self-avoiding walk with bond repulsion on \(\mathbb{Z}\): Limit theorems
• The component graph of the uniform spanning forest: transitions in dimensions \(9,10,11,\ldots\)
• The method of averaging and walks in inhomogeneous environments
• The Random Walk Construction of Uniform Spanning Trees and Uniform Labelled Trees
• The range of a rotor walk
• Transience, recurrence and the speed of a random walk in a site-based feedback environment
• Uniform spanning forests

Cited in

(5)

• Random memory walk
• The shape of a memorised random walk
• Rotor walks on transient graphs and the wired spanning forest
• Recurrence of horizontal-vertical walks
• Law of the iterated logarithm for \(p\)-walks on \(\mathbb{Z}\)

This page was built for publication: Random walks with local memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2046500)