Random walks avoiding their convex hull with a finite memory
From MaRDI portal
Publication:2288227
DOI10.1016/j.indag.2019.11.002zbMath1471.60065arXiv1902.09812OpenAlexW2991903544WikidataQ126628194 ScholiaQ126628194MaRDI QIDQ2288227
Mikhail V. Menshikov, Andrew R. Wade, Francis Comets
Publication date: 17 January 2020
Published in: Indagationes Mathematicae. New Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.09812
Sums of independent random variables; random walks (60G50) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Random convex sets and integral geometry (aspects of convex geometry) (52A22)
Related Items (2)
Stochastic processes under constraints. Abstracts from the workshop held September 27 -- October 3, 2020 (hybrid meeting) ⋮ Variations of the elephant random walk
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Greedy clearing of persistent Poissonian dust
- Random walk with barycentric self-interaction
- Markov chains and stochastic stability
- The self-avoiding walk.
- An asymptotic result for Brownian polymers
- Families of prudent self-avoiding walks
- Scaling limit of the prudent walk
- A survey of random processes with reinforcement
- Self-avoiding random walk: A Brownian motion model with local time drift
- The true self-repelling motion
- The critical greedy server on the integers is recurrent
- Excited random walk
- Random walks that avoid their past convex hull
- The ``true self-avoiding walk with bond repulsion on \(\mathbb{Z}\): Limit theorems
- Greedy walk on the real line
- Scaling limit of the uniform prudent walk
- On the speed of a planar random walk avoiding its past convex hull
- A simple coupling of renewal processes
- The Gillis–Domb–Fisher correlated random walk
- A martingale approach for the elephant random walk
- Stability of the Greedy Algorithm on the Circle
- Probability
This page was built for publication: Random walks avoiding their convex hull with a finite memory
