English
Related papers

Related papers: Self-interacting random walks

200 papers

We study the once-reinforced random walk on $\mathbb Z^d$, which is a self-interacting walk that has a higher probability to cross edges that were already visited. We prove that the walk is transient when $d\ge 6$ and when the reinforcement…

Probability · Mathematics 2026-01-27 Dor Elboim , Gady Kozma

We study a generalisation of the one-dimensional Rademacher random walk introduced in Bhattacharya and Volkov (2023) to $\mathbb{Z}^2$ (for $d\ge 3$, the Rademacher random walk is always transient, as follows from Theorem 8.8 in Englander…

Probability · Mathematics 2026-02-16 Satyaki Bhattacharya , Stanislav Volkov

The characterization of record events is considered for a discrete-time random walk model with long-term memory arising from correlations between successive steps. An important feature is that the correlations are strong enough to give rise…

Statistical Mechanics · Physics 2021-02-02 Michael J. Kearney

The Rademacher random walk associated with a deterministic sequence $(a_n)_{n \geq 1}$ is the walk which starts at zero and, at step $i$, independently steps either up or down by $a_i$ with equal probability. We continue the study begun by…

Probability · Mathematics 2025-12-22 Satyaki Bhattacharya , Edward Crane , Tom Johnston

We consider Reinforced Random Walks where transition probabilities are a function of the proportion of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase transition is observed, similar to…

Probability · Mathematics 2009-07-15 Olivier Raimond , Bruno Schapira

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…

Probability · Mathematics 2017-07-05 Gideon Amir , Itai Benjamini , Ori Gurel-Gurevich , Gady Kozma

We consider d independent walkers on Z, m of them performing simple symmetric random walk and r = d -- m of them performing recurrent RWRE (Sinai walk), in I independent random environments. We show that the product is recurrent, almost…

Probability · Mathematics 2018-07-12 Alexis Devulder , Nina Gantert , Françoise Pene

We introduce a class of nearest-neighbor integer random walks in random and non-random media, which includes excited random walks considered in the literature. At each site the random walker has a drift to the right, the strength of which…

Probability · Mathematics 2007-05-23 Martin P. W. Zerner

We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…

Statistical Mechanics · Physics 2009-11-11 G. Oshanin , R. Voituriez , S. Nechaev , O. Vasilyev , F. Hivert

We quantify superdiffusive transience for a two-dimensional random walk in which the vertical coordinate is a martingale and the horizontal coordinate has a positive drift that is a polynomial function of the individual coordinates and of…

Probability · Mathematics 2024-07-03 Conrado da Costa , Mikhail Menshikov , Vadim Shcherbakov , Andrew Wade

A random walk with counterbalanced steps is a process of partial sums $\check S(n)=\check X_1+ \cdots + \check X_n$ whose steps $\check X_n$ are given recursively as follows. For each $n\geq 2$, with a fixed probability $p$, $\check X_n$ is…

Probability · Mathematics 2022-07-05 Jean Bertoin

We consider a class of self-interacting random walks in deterministic or random environments, known as excited random walks or cookie walks, on the d-dimensional integer lattice. The main purpose of this paper is two-fold: to give a survey…

Probability · Mathematics 2013-05-15 Elena Kosygina , Martin P. W. Zerner

We investigate a self-interacting random walk, whose dynamically evolving environment is a random tree built by the walker itself, as it walks around. At time $n=1,2,\dots$, right before stepping, the walker adds a random number (possibly…

Probability · Mathematics 2023-11-10 János Engländer , Giulio Iacobelli , Rodrigo Ribeiro

The symmetric random walk is known to be recurrent in one and two dimensions, and becomes transient in three or higher dimensions. We compare the symmetric random walk to walks driven by certain \polya\ urns. We show that, in contrast, if…

Probability · Mathematics 2026-04-22 Srinivasan Balaji , Hosam Mahmoud

We consider a model for random walks on random environments (RWRE) with random subset of the d-dimensional Euclidean lattice as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the…

Probability · Mathematics 2011-10-27 Ron Rosenthal

Random walks conditioned to stay positive are a prominent topic in fluctuation theory. One way to construct them is as a random walk conditioned to stay positive up to time $n$, and let $n$ tend to infinity. A second method is conditioning…

Probability · Mathematics 2020-03-10 Osvaldo Angtuncio Hernández

Exploiting the coherent medium approximation, random walk among sites distributed randomly in space is investigated when the jump rate depends on the distance between two adjacent sites. In one dimension, it is shown that when the jump rate…

Statistical Mechanics · Physics 2021-09-27 Takashi Odagaki

Motivated by various recent experimental findings, we propose a dynamical model of intermittently self-propelled particles: active particles that recurrently switch between two modes of motion, namely an active run-state and a turn state,…

Soft Condensed Matter · Physics 2025-10-30 Agniva Datta , Carsten Beta , Robert Großmann

We consider one-dependent random walks on $\mathbb{Z}^d$ in random hypergeometric environment for $d\ge 3$. These are memory-one walks in a large class of environments parameterized by positive weights on directed edges and on pairs of…

Probability · Mathematics 2020-08-10 Tal Orenshtein , Christophe Sabot

We construct examples of a random walk with pairwise-independent steps which is almost-surely bounded, and for any $m$ and $k$ a random walk with $k$-wise independent steps which has no stationary distribution modulo $m$.

Probability · Mathematics 2007-05-23 Itai Benjamini , Gady Kozma , Dan Romik