English
Related papers

Related papers: Frequent points for random walks in two dimensions

200 papers

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

The set of visited sites and the number of visited sites are two basic properties of the random walk trajectory. We consider two independent random walks on a hyper-cubic lattice and study ordering probabilities associated with these…

Statistical Mechanics · Physics 2022-11-23 E. Ben-Naim , P. L. Krapivsky

In the classical paper of Dvoretzky-Erd\H{o}s, asymptotics for the expected value and the variance of the number of distinct sites visited by a Simple Symmetric Random Walk were calculated. Here, these results are generalized for Random…

Probability · Mathematics 2016-03-25 Péter Nándori

Consider a symmetric aperiodic random walk in $Z^d$, $d\geq 3$. There are points (called heavy points) where the number of visits by the random walk is close to its maximum. We investigate the local times around these heavy points and show…

Probability · Mathematics 2007-05-23 Endre Csáki , Antónia Földes , Pál Révész

This paper considers the question: how many times does a simple random walk revisit the most frequently visited site among the inner boundary points? It is known that in ${\mathbb{Z}}^2$, the number of visits to the most frequently visited…

Probability · Mathematics 2016-02-19 Izumi Okada

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

In this paper, we study the asymptotic behavior of the number of rarely visited edges (i.e., edges that visited only once) of a simple symmetric random walk on $\mathbb{Z}$. Let $\alpha(n)$ be the number of rarely visited edges up to time…

Probability · Mathematics 2026-01-21 Ze-Chun Hu , Xue Peng , Renming Song , Yuan Tan

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 develop a framework to determine the complete statistical behavior of a fundamental quantity in the theory of random walks, namely, the probability that $n_1$, $n_2$, $n_3$, . . . distinct sites are visited at times $t_1$, $t_2$, $t_3$,…

Statistical Mechanics · Physics 2022-06-22 Léo Régnier , Maxim Dolgushev , Sidney Redner , Olivier Bénichou

The asymptotic mean number of distinct sites visited by a subdiffusive continuous time random walker in two dimensions seems not to have been explicitly calculated anywhere in the literature. This number has been calculated for other…

Statistical Mechanics · Physics 2008-03-17 Santos Bravo Yuste , J. Klafter , Katja Lindenberg

We consider random variables observed at arrival times of a renewal process, which possibly depends on those observations and has regularly varying steps with infinite mean. Due to the dependence and heavy tailed steps, the limiting…

Probability · Mathematics 2016-08-08 Bojan Basrak , Drago Špoljarić

Considering a simple symmetric random walk in dimension $d\geq 3$, we study the almost sure joint asymptotic behavior of two objects: first the local times of a pair of neighboring points, then the local time of a point and the occupation…

Probability · Mathematics 2016-08-16 Endre Csáki , Antónia Földes , Pál Révész

On the trace of a discrete-time simple random walk on $\mathbb{Z}^d$ for $d\geq 2$, we consider the evolution of favorite sites, i.e., sites that achieve the maximal local time at a certain time. For $d=2$, we show that almost surely three…

Probability · Mathematics 2025-11-13 Chenxu Hao , Xinyi Li , Izumi Okada , Yushu Zheng

A simple symmetric random walk in the space $\mathbb{Z}^2$ is considered. The asymptotic behavior as the number of jumps tends to infinity of the probability that a fixed edge of the random walk lies in the polygon that forms the boundary…

Probability · Mathematics 2026-05-05 Aleksandr Mysliuk

We consider the slow movement of randomly biased random walk $(X_n)$ on a supercritical Galton--Watson tree, and are interested in the sites on the tree that are most visited by the biased random walk. Our main result implies tightness of…

Probability · Mathematics 2015-02-11 Yueyun Hu , Zhan Shi

We study a random walk in random environment on the non-negative integers. The random environment is not homogeneous in law, but is a mixture of two kinds of site, one in asymptotically vanishing proportion. The two kinds of site are (i)…

Probability · Mathematics 2014-04-28 Ostap Hryniv , Mikhail V. Menshikov , Andrew R. Wade

We consider Random Walk in Random Scenery, denoted $X_n$, where the random walk is symmetric on $Z^d$, with $d>4$, and the random field is made up of i.i.d random variables with a stretched exponential tail decay, with exponent $\alpha$…

Probability · Mathematics 2007-05-23 Amine Asselah , Fabienne Castell

We consider the possible visits to visible points of a random walker moving up and right in the integer lattice (with probability $\alpha$ and $1-\alpha$, respectively) and starting from the origin. We show that, almost surely, the…

Number Theory · Mathematics 2015-12-16 Javier Cilleruelo , José L. Fernández , Pablo Fernández

Spatially homogeneous random walks in $(\mathbb{Z}_{+})^{2}$ with non-zero jump probabilities at distance at most 1, with non-zero drift in the interior of the quadrant and absorbed when reaching the axes are studied. Absorption…

Probability · Mathematics 2012-05-16 Irina Kurkova , Kilian Raschel

We study random walks in i.i.d. random environments on $\mathbb{Z}^d$ when there are two basic types of vertices, which we call "blue" and "red". Each color represents a different probability distribution on transition probability vectors.…

Probability · Mathematics 2025-01-03 Daniel J. Slonim
‹ Prev 1 2 3 10 Next ›