Random walk in changing environment
From MaRDI portal
Publication:2229693
DOI10.1016/J.SPA.2020.08.003zbMATH Open1454.60058arXiv1504.04870OpenAlexW3082455963MaRDI QIDQ2229693FDOQ2229693
Authors: Gideon Amir, Itai Benjamini, Ori Gurel-Gurevich, Gady Kozma 
Publication date: 18 February 2021
Published in: Stochastic Processes and their Applications (Search for Journal in Brave)
Abstract: In this paper we introduce the notion of Random Walk in Changing Environment - a random walk in which each step is performed in a different graph on the same set of vertices, or more generally, a weighted random walk on the same vertex and edge sets but with different (possibly 0) weights in each step. This is a very wide class of RW, which includes some well known types of RW as special cases (e.g. reinforced RW, true SAW). We define and explore various possible properties of such walks, and provide criteria for recurrence and transience when the underlying graph is or a tree. We provide an example of such a process on where conductances can only change from to (once for each edge) but nevertheless the walk is transient, and conjecture that such behaviour cannot happen when the weights are chosen in advance, that is, do not depend on the location of the RW.
Full work available at URL: https://arxiv.org/abs/1504.04870
Recommendations
- Random Walk in deterministically changing environment
- scientific article; zbMATH DE number 2070282
- scientific article; zbMATH DE number 6458605
- Random walks in a random environment
- Random walks in a random (fluctuating) environment
- Random walks in random environments
- scientific article; zbMATH DE number 1789878
- scientific article
- Random walk in random and non-random environments
- Random walk in dynamic Markovian random environment
Cites Work
- An approximation of partial sums of independent RV's, and the sample DF. II
- Title not available (Why is that?)
- Reinforced random walk
- Title not available (Why is that?)
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- Topics in the Constructive Theory of Countable Markov Chains
- The ``true self-avoiding walk with bond repulsion on \(\mathbb{Z}\): Limit theorems
- Multi-excited random walks on integers
- On estimating the derivatives of symmetric diffusions in stationary random environment, with applications to \(\nabla\varphi\) interface model
- Multidimensional version of the results of Komlos, Major and Tusnady for vectors with finite exponential moments
- A survey of random processes with reinforcement
- Excited random walk
- On range and local time of many-dimensional submartingales
- Evolving sets, mixing and heat kernel bounds
- Extensions of results of Komlós, Major, and Tusnády to the multivariate case
- Hitting probabilities of random walks on \({\mathbb{Z}}^ d\)
- Once edge-reinforced random walk on a tree
- A new approach to strong embeddings
- Walking within growing domains: recurrence versus transience
- Monotone interaction of walk and graph: recurrence versus transience
Cited In (9)
- Out-of-equilibrium random walks
- On random walk on growing graphs
- Title not available (Why is that?)
- Growing in time IDLA cluster is recurrent
- On a random walk that grows its own tree
- Random walks among time increasing conductances: heat kernel estimates
- Convergence of the quantile admission process with veto power
- A process in a randomly fluctuating environment
- More randomness of environment does not always slow down a random walk
This page was built for publication: Random walk in changing environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229693)
