Related papers: Nine and ten lonely runners

A particle moves among the vertices of an $(m+1)$-gon which are labeled clockwise as $0,1,...,m$. The particle starts at 0 and thereafter at each step it moves to the adjacent vertex, going clockwise with a known probability $p$, or…

We study the random walk in random environment on {0,1,2,...}, where the environment is subject to a vanishing (random) perturbation. The two particular cases we consider are: (i) random walk in random environment perturbed from Sinai's…

We prove a quenched functional central limit theorem for a one-dimensional random walk driven by a simple symmetric exclusion process. This model can be viewed as a special case of the random walk in a balanced random environment, for which…

Eight combinatorial identities are listed and proved by counting paths in the one-dimensional random walk. Four of these identities are assumed to be new.

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…

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…

The well-known three distance theorem states that there are at most three distinct gaps between consecutive elements in the set of the first n multiples of any real number. We generalise this theorem to higher dimensions under a suitable…

Consider the invariance principle for a random walk with random environment (denoted by $\mu$) in time on $\bfR$ in a weak quenched sense. We show that a sequence of the random probability measures on $\bfR$ generated by a bounded Lipschitz…

Consider a sequence of independent random isometries of Euclidean space with a previously fixed probability law. Apply these isometries successively to the origin and consider the sequence of random points that we obtain this way. We prove…

We consider a ballistic random walk in an i.i.d. random environment that does not allow retreating in a certain fixed direction. Homogenization and regeneration techniques combine to prove a law of large numbers and an averaged invariance…

The speed of an exhaustive search can be measured by a cover time, which is defined as the time it takes a random searcher to visit every state in some target set. Cover times have been studied in both the physics and probability…

We consider a random walk among i.i.d. obstacles on the one dimensional integer lattice under the condition that the walk starts from the origin and reaches a remote location y. The obstacles are represented by a killing potential, which…

A collection of identical and independent rare event first passage times is considered. The problem of finding the fastest out of $N$ such events to occur is called an extreme first passage time. The rare event times are singular and limit…

We prove a law of large numbers for random walks in certain kinds of i.i.d. random environments in Z^d that is an extension of a result of Bolthausen, Sznitman and Zeitouni (2003). We use this result, along with the lace expansion for…

We prove a strong law of large numbers and an annealed invariance principle for a random walk in a one-dimensional dynamic random environment evolving as the simple exclusion process with jump parameter $\gamma$. First, we establish that if…

Central limit theorems for random walks in quenched random environments have attracted plenty of attention in the past years. More recently still, finer local limit theorems -- yielding a Gaussian density multiplied by a highly oscillatory…

Quantum random walks have been much studied recently, largely due to their highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum random walk on the line: the use of multiple…

On an $r\times (n-r)$ lattice rectangle, we first consider walks that begin at the SW corner, proceed with unit steps in either of the directions E or N, and terminate at the NE corner of the rectangle. For each integer $k$ we ask for…

We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…

We introduce a method for studying monotonicity of the speed of excited random walks in high dimensions, based on a formula for the speed obtained via cut-times and Girsanov's transform. While the method gives rise to similar results as…