Related papers: Optimum exploration memory and anomalous diffusion…
The run-and-tumble walk, consisting in randomly reoriented ballistic excursions, models phenomena ranging from gas kinetics to bacteria motility. We evaluate the mean time required for this walk to find a fixed target within a 2D or 3D…
We study several lattice random walk models with stochastic resetting to previously visited sites which exhibit a phase transition between an anomalous diffusive regime and a localization regime where diffusion is suppressed. The localized…
We consider a particle moving in a one dimensional potential which has a symmetric deterministic part and a quenched random part. We study analytically the probability distributions of the local time (spent by the particle around its mean…
Starting from a simple animal-biology example, a general, somewhat counter-intuitive property of diffusion random walks is presented. It is shown that for any (non-homogeneous) purely diffusing system, under any isotropic uniform incidence,…
We consider the random walk Metropolis algorithm on $\mathbb{R}^n$ with Gaussian proposals, and when the target probability measure is the $n$-fold product of a one-dimensional law. In the limit $n\to\infty$, it is well known (see [Ann.…
We consider the penetration length $l$ of random walkers diffusing in a medium of perfect or imperfect absorbers of number density $\rho$. We solve this problem on a lattice and in the continuum in all dimensions $D$, by means of a…
We consider a random walk among a Poisson system of moving traps on ${\mathbb Z}$. In earlier work [DGRS12], the quenched and annealed survival probabilities of this random walk have been investigated. Here we study the path of the random…
Infiltration of anomalously diffusing particles from one material to another through a biased interface is studied using continuous time random walk and Levy walk approaches. Subdiffusion in both systems may lead to a net drift from one…
We consider the single-file dynamics of $N$ identical random walkers moving with diffusivity $D$ in one dimension (walkers bounce off each other when attempting to overtake). Additionally, we require that the separation between neighboring…
Motivated by various recent experimental findings, we propose a dynamical model of intermittently self-propelled particles: active particles that recurrently switch between two modes of motion, namely an active run-state and a turn state,…
We consider a walker moving in a one-dimensional interval with absorbing boundaries under the effect of Markovian resettings to the initial position. The walker's motion follows a random walk characterized by a general waiting time…
We consider a one-dimensional Brownian motion of fixed duration $T$. Using a path-integral technique, we compute exactly the probability distribution of the difference $\tau=t_{\min}-t_{\max}$ between the time $t_{\min}$ of the global…
The transport equation of active motion is generalised to consider time-fractional dynamics for describing the anomalous diffusion of self-propelled particles observed in many different systems. In the present study, we consider an…
An ideal quantum walk transitions from one vertex to another with perfect fidelity, but in physical systems, the particle may be hindered by potential energy barriers. Then the particle has some amplitude of tunneling through the barriers,…
Self-avoidance is a common mechanism to improve the efficiency of a random walker for covering a spatial domain. However, how this efficiency decreases when self-avoidance is impaired or limited by other processes has remained largely…
The Random Walk Metropolis (RWM) algorithm is a Metropolis- Hastings MCMC algorithm designed to sample from a given target distribution \pi with Lebesgue density on R^N. RWM constructs a Markov chain by randomly proposing a new position…
We show that anomalous diffusion can result when the steps of a random walk are not statistically independent. We present an algorithm that counts all the possible paths of particles diffusing on random graphs with arbitrary degree…
We study the excited random walk, in which a walk that is at a site that contains cookies eats one cookie and then hops to the right with probability p and to the left with probability q=1-p. If the walk hops onto an empty site, there is no…
Random walks process on networks plays a fundamental role in understanding the importance of nodes and the similarity of them, which has been widely applied in PageRank, information retrieval, and community detection, etc. Individual's…
We consider random walkers that deform the medium as they move, enabling a faster motion in regions which have been recently visited. This induces an effective attraction between walkers mediated by the medium, which can be regarded as a…