Related papers: Random walks on randomly oriented lattices
We study the persistent random walk of photons on a one-dimensional lattice of random transmittances. Transmittances at different sites are assumed independent, distributed according to a given probability density $f(t)$. Depending on the…
We introduce the concept of a deterministic walk. Confining our attention to the finite state case, we establish hypotheses that ensure that the deterministic walk is transitive, and show that this property is in some sense robust. We also…
Axis-driven random walks were introduced by P. Andreoletti and P. Debs [AD23] to provide a rough description of the behaviour of a particle trapped in a localized force field. In contrast to their work, we examine the scenario where a…
Inspired by the study of edge statistics of random band matrices, we investigate random walks on large $d$-dimensional periodic lattices, whose transition matrices are determined by discretized density functions. Under certain moment…
We study an homogeneous irreducible markovian random walk in a square lattice of arbitrary dimension, with an antisymmetric perturbation acting only in one point. We compute exactly spatial correction to the diffusive behaviour in the…
Models of random walks are considered in which walkers are born at one location and die at all other locations with uniform death rate. Steady-state distributions of random walkers exhibit dimensionally dependent critical behavior as a…
We study a random walk on $\mathbb{Z}$ which evolves in a dynamic environment determined by its own trajectory. Sites flip back and forth between two modes, $p$ and $q$. $R$ consecutive right jumps from a site in the $q$-mode are required…
A rather simple random walk model on a one-dimensional lattice is put forward. The lattice as a whole switches randomly between two possible states which are spatially symmetric. Both lattice states are identical, but translated by one site…
We study branching random walks on Cayley graphs. A first result is that the trace of a transient branching random walk on a Cayley graph is a.s. transient for the simple random walk. In addition, it has a.s. critical percolation…
Random walks in random scenery are processes defined by $Z_n:=\sum_{k=1}^n\xi_{X_1+...+X_k}$, where $(X_k,k\ge 1)$ and $(\xi_y,y\in\mathbb Z)$ are two independent sequences of i.i.d. random variables. We assume here that their distributions…
Random walks with a general, nonlinear barrier have found recent applications ranging from reionization topology to refinements in the excursion set theory of halos. Here, we derive the first-crossing distribution of random walks with a…
Combs are a simple caricature of various types of natural branched structures, which belong to the category of loopless graphs and consist of a backbone and branches. We study continuous time random walks on combs and present a generic…
We study tail behaviour of the distribution of the area under the positive excursion of a random walk which has negative drift and heavy-tailed increments. We determine the asymptotics for tail probabilities for the area.
We consider a left-transient random walk in a random environment on Z that will be disturbed by cookies inducing a drift to the right of strength 1. The number of cookies per site is i.i.d. and independent of the environment. Criteria for…
Bernoulli random walks, a simple avalanche model, and a special branching process are essesntially identical. The identity gives alternative insights into the properties of these basic model sytems.
We show the critical density for activated random walks on Euclidean lattices is at most one.
We study a model for a random walk of two classes of particles (A and B). Where both species are present in the same site, the motion of A's takes precedence over that of B's. The model was originally proposed and analyzed in Maragakis et…
When random walks on a square lattice are biased horizontally to move solely to the right, the probability distribution of their algebraic area can be exactly obtained. We explicitly map this biased classical random system on a non…
We consider a model for random walks on random environments (RWRE) with random subset of the d-dimensional Euclidean lattice as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the…
We consider two or more simple symmetric walks on some graphs, e.g. the real line, the plane or the two dimensional comb lattice, and investigate the properties of the distance among the walkers.