相关论文: No more than three favourite sites for simple rand…

We survey the current status of the list of questions related to the favourite (or: most visited) sites of simple random walk on Z, raised by Pal Erdos and Pal Revesz in the early eighties.

For a one-dimensional simple random walk $(S_t)$, for each time $t$ we say a site $x$ is a favorite site if it has the maximal local time. In this paper, we show that with probability 1 three favorite sites occurs infinitely often. Our work…

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…

In this paper, we study favorite sites of one-dimensional asymmetric simple random walks. We show that almost surely, for any fixed integer $r\geq 1$, ``$r$ favorite sites" occurs infinitely often. We also give the asymptotic growth rate of…

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.

Random walk is a very important Markov process and has important applications in many fields.For a one-dimensional simple symmetric random walk $(S_n)$, a site $x$ is called a favorite downcrossing site at time $n$ if its downcrossing local…

For a one-dimensional simple symmetric random walk $(S_n)$, an edge $x$ (between points $x-1$ and $x$) is called a favorite edge at time $n$ if its local time at $n$ achieves the maximum among all edges. In this paper, we show that with…

In this article, we study special points of a simple random walk and a Gaussian free field, such as (nearly) favorite points, late points and high points. In section $2$, we extend results of [19] and suggest open problems for $d=2$. In…

We study the favourite sites of a random walk evolving in a sparse random environment on the set of integers. The walker moves symmetrically apart from some randomly chosen sites where we impose random drift. We prove annealed limit…

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…

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…

We study a strongly Non-Markovian variant of random walk in which the probability of visiting a given site $i$ is a function $f$ of number of previous visits $v(i)$ to the site. If the probability is proportional to number of visits to the…

We consider the proportion of generalized visible lattice points in the plane visited by random walkers. Our work concerns the visible lattice points in random walks in three aspects: (1) generalized visibility along curves; (2) one random…

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…

Consider a transient near-critical (1,2) random walk on the positive half line. We give a criteria for the finiteness of the number of the skipped points (the points never visited) by the random walk. This result generalizes (partially) the…

We consider the model of the one-dimensional cookie random walk when the initial cookie distribution is spatially uniform and the number of cookies per site is finite. We give a criterion to decide whether the limiting speed of the walk is…

Erd\H{o}s and R\'ev\'esz initiated the study of favorite sites by considering the one-dimensional simple random walk. We investigate in this paper the same problem for a class of null-recurrent randomly biased walks on a supercritical…

The class of random walks in one dimension, returning to the origin, restricted by the requirement that any site visited (different from the origin) is visited an even number of times, is analyzed in the present note. We call this class the…

We consider the problem of locating the source (starting vertex) of a simple random walk, given a snapshot of the set of edges (or vertices) visited in the first $n$ steps. Considering lattices $\mathbb{Z}^d$, in dimensions $d \geq 5$, we…

For a symmetric random walk in $Z^2$ which does not necessarily have bounded jumps we study those points which are visited an unusually large number of times. We prove the analogue of the Erd\H{o}s-Taylor conjecture and obtain the…