Related papers: Three favorite sites occurs infinitely often for o…
We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…
We consider one-dimensional excited random walks with finitely many cookies at each site. There are certain natural monotonicity results that are known for the excited random walk under some partial orderings of the cookie environments. We…
We investigate a problem suggested by Dembo, Peres, Rosen, and Zeitouni, which states that the growth exponent of favorite points associated with a simple random walk in ${\mathbb Z}^2$ coincides, on average and almost surely, with those of…
Let $(X_t, t \geq 0)$ be an $\alpha$-stable random walk with values in $\Z^d$. Let $l_t(x) = \int_0^t \delta_x(X_s) ds$ be its local time. For $p>1$, not necessarily integer, $I_t = \sum_x l_t^p(x)$ is the so-called $p$-fold self-…
Suppose that S is an asymptotically stable random walk with norming sequence c_{n} and that T_{x} is the time that S first enters (x,\inf), where x\ge 0. The asymptotic behaviour of P(T_0=n) has been described in a recent paper of Vatutin…
An old question posed by Erd\H{o}s asked whether there exists a set of $n$ points such that $c \cdot n$ distances occur more than $n$ times. We provide an affirmative answer to this question, showing that there exists a set of $n$ points…
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…
A study of persistence dynamics is made for the first time in a quantum system by considering the dynamics of a quantum random walk. For a discrete walk on a line starting at $x=0$ at time $t=0$, the persistence probability $P(x,t)$ that a…
The evaluation of the average number S_N(t) of distinct sites visited up to time t by N independent random walkers all starting from the same origin on an Euclidean lattice is addressed. We find that, for the nontrivial time regime and for…
In this paper, we give a detailed construction of an example of excited random walk with speed zero in an ergodic random environment that have an infinite average number of cookies in each site. This example confirms that a result of…
In this paper we continue our study of exit times for random walks with independent but not necessarily identical distributed increments. Our paper "First-passage times for random walks with non-identically distributed increments" was…
Sinai's walk is a recurrent one-dimensional nearest-neighbor random walk in random environment. It is known for a phenomenon of strong localization, namely, the walk spends almost all time at or near the bottom of deep valleys of the…
We obtain the leading orders of the maximum and the minimum of local times for the simple random walk on the two-dimensional torus at time proportional to the cover time. We also estimate the number of points with large (or small) values of…
We consider $d$ independent walkers in the same random environment in $\mathbb{Z}$. Our assumption on the law of the environment is such that a single walker is transient to the right but subballistic. We show that - no matter what $d$ is -…
For a diffusion X_t in a one-dimensional Wiener medium W, it is known that there is a certain process b_x(W) that depends only on the environment W, so that X_t-b_{logt}(W) converges in distribution as t goes to infinity. We prove that,…
We prove for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n has the order of square root of n. Moment or symmetry assumptions are not necessary. In removing…
Coalescing random walk on a unimodular random rooted graph for which the root has finite expected degree visits each site infinitely often almost surely. A corollary is that an opinion in the voter model on such graphs has infinite expected…
In a recent paper, K. Raschel and R. Garbit proved that the exponential decreasing rate of the probability that a random walk (with all exponential moments) stays in a $d$-dimensional orthant is given by the minimum on this orthant of the…
We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…
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…