# On recurrence and transience of self-interacting random walks

@article{Peres2013OnRA, title={On recurrence and transience of self-interacting random walks}, author={Yuval Peres and Serguei Yu. Popov and Perla Sousi}, journal={Bulletin of the Brazilian Mathematical Society, New Series}, year={2013}, volume={44}, pages={841-867} }

Let µ1,...,µk be d-dimensional probabilitymeasures in ℝd with mean 0. At each time we choose one of the measures based on the history of the process and take a step according to that measure. We give conditions for transience of such processes and also construct examples of recurrent processes of this type. In particular, in dimension 3 we give the complete picture: every walk generated by two measures is transient and there exists a recurrent walk generated by three measures.

## 16 Citations

Martingale defocusing and transience of a self-interacting random walk

- Mathematics
- 2014

Suppose that (X;Y;Z) is a random walk in Z 3 that moves in the following way: on the rst visit to a vertex only Z changes by 1 equally likely, while on later visits to the same vertex (X;Y ) performs…

Law of large numbers for random walks on attractive spin-flip dynamics

- Mathematics
- 2017

Abstract We prove a law of large numbers for certain random walks on certain attractive dynamic random environments when initialised from all sites equal to the same state. This result applies to…

Anomalous recurrence properties of many-dimensional zero-drift random walks

- MathematicsAdvances in Applied Probability
- 2016

Abstract Famously, a d-dimensional, spatially homogeneous random walk whose increments are nondegenerate, have finite second moments, and have zero mean is recurrent if d∈{1,2}, but transient if d≥3.…

Recurrence of horizontal-vertical walks

- Mathematics
- 2020

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…

LECTURE NOTES FOR MARKOV CHAINS: MIXING TIMES, HITTING TIMES, AND COVER TIMES

- 2013

These are the notes for the tutorial for Saint Petersburg Summer School. Most material is taken from the books [2, 6, 7]. We follow the tutorials available at 1. Preliminaries. We start with…

An Overview of the Balanced Excited Random Walk

- Mathematics
- 2020

The balanced excited random walk, introduced by Benjamini, Kozma and Schapira in 2011, is defined as a discrete time stochastic process in \(\mathbb Z^d\), depending on two integer parameters 1 ≤ d1,…

Markov Chains and Mixing Times: Second Edition

- Mathematics
- 2017

Unlike most books reviewed in the Intelligencer this is definitely a textbook. It assumes knowledge one might acquire in the first two years of an undergraduate mathematics program – basic…

How many matrices can be spectrally balanced simultaneously?

- Mathematics
- 2016

We prove that any ℓ positive definite d × d matrices, M1,...,Mℓ, of full rank, can be simultaneously spectrally balanced in the following sense: for any k < d such that ℓ ≤ $$\ell \leqslant…

## References

SHOWING 1-10 OF 23 REFERENCES

Recurrence and transience of excited random walks on $Z^d$ and strips

- Mathematics
- 2006

We investigate excited random walks on $Z^d, d\ge 1,$ and on planar strips $Z\times{0,1,\ldots,L-1}$ which have a drift in a given direction. The strength of the drift may depend on a random i.i.d.…

On a general many-dimensional excited random walk

- Mathematics
- 2012

In this paper we study a substantial generalization of the model of excited random walk introduced in [Electron. Commun. Probab. 8 (2003) 86–92] by Benjamini and Wilson. We consider a discrete-time…

Vertex-reinforced random walks and a conjecture of Pemantle

- Mathematics
- 1997

We discuss and disprove a conjecture of Pemantle concerning vertex-reinforced random walks. The setting is a general theory of non-Markovian discrete-time random processes on a finite space E =…

Vertex-reinforced random walk on Z has finite range

- Mathematics
- 1999

A stochastic process called vertex-reinforced random walk (VRRW) is defined in Pemantle [Ann. Probab. 16 1229-1241]. We consider this process in the case where the underlying graph is an infinite…

A balanced excited random walk

- Mathematics
- 2010

The following random process on $\Z^4$ is studied. At first visit to a site, the two first coordinates perform a (2-dimensional) simple random walk step. At further visits, it is the last two…

RECURRENCE OF EDGE-REINFORCED RANDOM WALK ON A TWO-DIMENSIONAL GRAPH

- Mathematics
- 2009

We consider a linearly edge-reinforced random walk on a class of two-dimensional graphs with constant initial weights. The graphs are obtained from ℤ 2 by replacing every edge by a sufficiently…

VERTEX-REINFORCED RANDOM WALKS AND A CONJECTURE OF PEMANTLE

- 2002

We discuss and disprove a conjecture of Pemantle concerning vertexreinforced random walks. The setting is a general theory of non-Markovian discrete-time random 4 processes on a finite space E 1, . .…

On some generalized reinforced random walk on integers

- Mathematics
- 2008

We consider Reinforced Random Walks where transitions probabilities are a function of the proportions of times the walk has traversed an edge. We give conditions for recurrence or transience. A phase…

Vertex-reinforced random walk on arbitrary graphs

- Mathematics
- 1999

Vertex-reinforced random walk (VRRW), defined by Pemantle, is a random process in a continuously changing environment which is more likely to visit states it has visited before. We consider VRRW on…

Monotonicity for excited random walk in high dimensions

- Mathematics
- 2008

We prove that the drift θ(d, β) for excited random walk in dimension d is monotone in the excitement parameter $${\beta \in [0,1]}$$ , when d is sufficiently large. We give an explicit criterion for…