Related papers: Slow movement of random walk in random environment…
We study coupled random walks in the plane such that, at each step, the walks change direction by a uniform random angle plus an extra deterministic angle \theta. We compute the Hausdorff dimension of the \theta for which the walk has an…
In this brief note, we study the strong law of large numbers for random walks in random scenery. Under the assumptions that the random scenery is non-stationary and satisfies weakly dependent condition with an appropriate rate, we establish…
We consider one infinite path of a Random Walk in Random Environment (RWRE, for short) in an unknown environment. This environment consists of either i.i.d.\ site or bond randomness. At each position the random walker stops and tells us the…
The following random process on $\Z^4$ is studied. At first visit to a site, the two first coordinates perform a (2-dimensional) simple random walk step. At further visits, it is the last two coordinates which perform a simple random walk…
Simple random walks on various types of partially horizontally oriented regular lattices are considered. The horizontal orientations of the lattices can be of various types (deterministic or random) and depending on the nature of the…
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…
We consider several variants of a class of random walks whose increment distributions depend on the average value of the process over its most recent $N$ steps. We investigate the speed of the process, and in particular, the limiting speed…
In this article, we study a branching random walk in an environment which depends on the time. This time-inhomogeneous environment consists of a sequence of macroscopic time intervals, in each of which the law of reproduction remains…
A rotor configuration on a graph contains in every vertex an infinite ordered sequence of rotors, each is pointing to a neighbor of the vertex. After sampling a configuration according to some probability measure, a rotor walk is a…
We study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment or being absorbed. We obtain expected number of arrivals and expected…
We consider a nearest neighbor random walk on the one-dimensional integer lattice with drift towards the origin determined by an asymptotically vanishing function of the number of visits to zero. We show the existence of distinct regimes…
In this paper we present a computation of the mean first-passage times both for a random walk in a discrete bounded lattice, between a starting site and a target site, and for a Brownian motion in a bounded domain, where the target is a…
This paper investigates the large deviation problem in the sample path space of the nearest-neighbor random walks on regular trees. We establish the sample path large deviation principle for the law of the distance from a nearest random…
We give new criteria for ballistic behavior of random walks in random environment which are perturbations of the simple symmetric random walk on $\mathbb Z^d$ in dimensions $d\ge 4$. Our results extend those of Sznitman [Ann. Probab. 31,…
We establish a variety of properties of the discrete time simple random walk on a Galton-Watson tree conditioned to survive when the offspring distribution, $Z$ say, is in the domain of attraction of a stable law with index…
We consider a d-dimensional random walk in random scenery X(n), where the scenery consists of i.i.d. with exponential moments but a tail decay of the form exp(-c t^a) with a<d/2. We study the probability, when averaged over both randomness,…
We compute the precise logarithmic corrections to Alexander-Orbach behaviour for various quantities describing the geometric and spectral properties of the four-dimensional uniform spanning tree. In particular, we prove that the volume of…
We propose an approximation for the first return time distribution of random walks on undirected networks. We combine a message-passing solution with a mean-field approximation, to account for the short- and long-term behaviours…
We introduce a novel operator to describe a random walk process on a simplicial complex. Walkers are allowed to wonder across simplices of various dimensions, bridging nodes to edges, and edges to triangles, via a nested organization that…
We introduce a class of nearest-neighbor integer random walks in random and non-random media, which includes excited random walks considered in the literature. At each site the random walker has a drift to the right, the strength of which…