English
Related papers

Related papers: A simple proof of a recurrence theorem for random …

200 papers

We discuss the question of recurrence for persistent, or Newtonian, random walks in Z^2, i.e., random walks whose transition probabilities depend both on the walker's position and incoming direction. We use results by Toth and Schmidt-Conze…

Probability · Mathematics 2008-05-27 Marco Lenci

We present an easy proof of Polya's theorem on random walks: with the probability one a random walk on the two-dimensional lattice returns to the starting point.

Combinatorics · Mathematics 2018-03-05 Yury Kochetkov

A short proof of the equivalence of the recurrence of non-backtracking random walk and that of simple random walk on regular infinite graphs is given. It is then shown how this proof can be extended in certain cases where the graph in…

Probability · Mathematics 2019-05-21 Paul Jung , Greg Markowsky

We prove that in any recurrent reversible random rooted graph, two independent simple random walks started at the same vertex collide infinitely often almost surely. This applies to the Uniform Infinite Planar Triangulation and…

Probability · Mathematics 2018-05-01 Tom Hutchcroft , Yuval Peres

We prove that any vertex-reinforced random walk on the integer lattice with non-decreasing reinforcement sequence $w$ satisfying $w(k) = o(k^{\alpha})$ for some $\alpha < 1/2$ is recurrent. This improves on previous results of Volkov (2006)…

Probability · Mathematics 2014-01-07 Arvind Singh

For the simple random walk in Z^2 we study those points which are visited an unusually large number of times, and provide a new proof of the Erdos-Taylor conjecture describing the number of visits to the most visited point.

Probability · Mathematics 2007-05-23 Jay Rosen

We define a random walk on the set of primitive points of $\mathbb{Z}^d$. We prove that for walks generated by measures satisfying mild conditions these walks are recurrent in a strong sense. That is, we show that the associated Markov…

Probability · Mathematics 2017-11-03 Oliver Sargent

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

In the present paper we define conservative and semiconservative random walks in $\mathbb{Z}^d$ and study different families of random walks. The family of symmetric random walks is one of the families of conservative random walks, and…

Probability · Mathematics 2018-11-26 Vyacheslav M. Abramov

Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We suppose that the distributions of…

Probability · Mathematics 2011-12-06 Nadine Guillotin-Plantard , Françoise Pène

In this paper we consider an irreducible random walk on the integer lattice $\mathbb{Z}$ that is in the domain of normal attraction of a strictly stable process with index $\alpha\in (1, 2)$ and obtain the asymptotic form of the…

Probability · Mathematics 2018-08-07 Kohei Uchiyama

We consider a walker that at each step keeps the same direction with a probabilitythat depends on the time already spent in the direction the walker is currently moving. In this paper, we study some asymptotic properties of this persistent…

Probability · Mathematics 2015-09-15 Peggy Cénac , Basile De Loynes , Arnaud Le Ny , Yoann Offret

We present a class of graphs where simple random walk is recurrent, yet two independent walkers meet only finitely many times almost surely. In particular, the comb lattice, obtained from Z^2 by removing all horizontal edges off the X-axis,…

Probability · Mathematics 2007-05-23 Manjunath Krishnapur , Yuval Peres

Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…

Probability · Mathematics 2015-08-18 Andrea Collevecchio , Kais Hamza , Meng Shi

We consider a recurrent RWRE $(X_n)_{n \in \mathbb{N}_0}$ on $\mathbb{Z}$ and investigate the quenched return probabilities of the RWRE to the origin for which we state results on their decay in terms of summability. Additionally, we give…

Probability · Mathematics 2012-11-21 Michael Kochler

It is shown that the path of a simple random walk on any graph, consisting of all vertices visited and edges crossed by the walk, is almost surely a recurrent subgraph.

Probability · Mathematics 2008-08-05 Itai Benjamini , Ori Gurel-Gurevich

We study the recurrence properties of a random walk in a stratified medium.

Dynamical Systems · Mathematics 2016-06-03 Julien Brémont

We prove that vertex-reinforced random walk on the integers with weight of order k to the power alpha, for alpha in [0, 1/2), is recurrent. This confirms a conjecture of Volkov for alpha<1/2. The conjecture for alpha in [1/2, 1) remains…

Probability · Mathematics 2016-06-20 Jun Chen , Gady Kozma

We study branching random walks in random i.i.d. environment in $\Z^d, d \geq 1$. For this model, the population size cannot decrease, and a natural definition of recurrence is introduced. We prove a dichotomy for recurrence/transience,…

Probability · Mathematics 2007-05-23 Francis Comets , Serguei Popov

We consider a random walk on a second countable locally compact topological space endowed with an invariant Radon measure. We show that if the walk is symmetric and if every subset which is invariant by the walk has zero or infinite…

Dynamical Systems · Mathematics 2022-10-18 Timothée Bénard
‹ Prev 1 2 3 10 Next ›