Related papers: Discrete space-time resetting model: Application t…
Random walks with memory typically involve rules where a preference for either revisiting or avoiding those sites visited in the past are introduced somehow. Such effects have a direct consequence on the statistics of first-passage and…
Consider a randomly-oriented two dimensional Manhattan lattice where each horizontal line and each vertical line is assigned, once and for all, a random direction by flipping independent and identically distributed coins. A deterministic…
We study branching random walks in random i.i.d. environment in $\Z^d, d \geq 1$. For this model, the population size cannot decrease, and a natural definition of recurrence is introduced. We prove a dichotomy for recurrence/transience,…
We consider a basic one-dimensional model of diffusion which allows to obtain a diversity of diffusive regimes whose speed depends on the moments of the per-site trapping time. This model is closely related to the continuous time random…
A discrete implementation on a lattice of the Active Walker Model is presented. After the model's validity is shown in simple simulations, more complex simulations of walkers passing consecutively a lattice from an arbitrary starting point…
We introduce a family of two-dimensional reflected random walks in the positive quadrant and study their Martin boundary. While the minimal boundary is systematically equal to a union of two points, the full Martin boundary exhibits an…
The study of diffusion with preferential returns to places visited in the past has attracted an increased attention in recent years. In these highly non-Markov processes, a standard diffusive particle intermittently resets at a given rate…
We study the first passage time (FPT) problem for biased continuous time random walks. Using the recently formulated framework of fractional Fokker-Planck equations, we obtain the Laplace transform of the FPT density function when the bias…
We consider the motion of a randomly accelerated particle in one dimension under stochastic resetting mechanism. Denoting the position and velocity by $x$ and $v$ respectively, we consider two different resetting protocols - (i) complete…
We study the transmission of random walkers through a finite-size inhomogeneous material with a quenched, long-range correlated distribution of scatterers. We focus on a finite one-dimensional structure where walkers undergo random…
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…
In this paper we present a computer simulation of a random walk (RW) for diffusion on a rearranging lattice. The lattice consists of two types of sites -- one good conducting (type 1) and the other poor conducting (type 2), distributed at…
Lock step walker model is a one-dimensional integer lattice walker model in discrete time. Suppose that initially there are infinitely many walkers on the non-negative even integer sites. At each tick of time, each walker moves either to…
Strongly non-Markovian random walks offer a promising modeling framework for understanding animal and human mobility, yet, few analytical results are available for these processes. Here we solve exactly a model with long range memory where…
Classical first passage under resetting is a paradigm in the search process. Despite its multitude of applications across interdisciplinary sciences, experimental realizations of such resetting processes posit practical challenges in…
We introduce the pushy random walk, where a walker can push multiple obstacles, thereby penetrating large distances in environments with finite obstacle density. This process provides a minimal model for experimentally observed interactions…
In this paper we consider an irreducible random walk on the integer lattice $\mathbb{Z}$ that is in the domain of normal attraction of a strictly stable process with index $\alpha\in (1, 2)$ and obtain the asymptotic form of the…
We study a generalization of the standard trapping problem of random walk theory in which particles move subdiffusively on a one-dimensional lattice. We consider the cases in which the lattice is filled with a one-sided and a two-sided…
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…
We study a Brownian particle diffusing under a time-modulated stochastic resetting mechanism to a fixed position. The rate of resetting r(t) is a function of the time t since the last reset event. We derive a sufficient condition on r(t)…