Related papers: Intermittent random walks for an optimal search st…
Consider $N$ points randomly distributed along a line segment of unitary length. A walker explores this disordered medium moving according to a partially self-avoiding deterministic walk. The walker, with memory $\mu$, leaves from the…
We consider a random walk in a fixed Z environment composed of two point types: (q,1-q) and (p,1-p) for 1/2<q<p. We study the expected hitting time at N for a given number k of p-drifts in the interval [1,N-1], and find that this time is…
The kinetics of a variety of transport-controlled processes can be reduced to the problem of determining the mean time needed to arrive at a given location for the first time, the so called mean first passage time (MFPT) problem. The…
We study the survival of a prey that is hunted by N predators. The predators perform independent random walks on a square lattice with V sites and start a direct chase whenever the prey appears within their sighting range. The prey is…
Animals foraging alone are hypothesized to optimize the encounter rates with resources through L\'evy walks. However, the issue of how the interactions between multiple foragers influence their search efficiency is still not completely…
We study the dynamics of a deterministic walk confined in a narrow two-dimensional space randomly filled with point-like targets. At each step, the walker visits the nearest target not previously visited. Complex dynamics is observed at…
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…
Random walks describe diffusion processes, where movement at every time step is restricted to only the neighbouring locations. We construct a quantum random walk algorithm, based on discretisation of the Dirac evolution operator inspired by…
We consider the dynamics of lattice random walks with resetting. The walker moving randomly on a lattice of arbitrary dimensions resets at every time step to a given site with a constant probability $r$. We construct a discrete renewal…
We study discrete-time random walks on arbitrary networks with first-passage resetting processes. To the end, a set of nodes are chosen as observable nodes, and the walker is reset instantaneously to a given resetting node whenever it hits…
We introduce a formalism based on a continuous time approximation, to study the characteristics of Page Rank random walks. We find that the diffusion of the occupancy probability has a dynamics that exponentially "forgets" the initial…
We study a strongly Non-Markovian variant of random walk in which the probability of visiting a given site $i$ is a function $f$ of number of previous visits $v(i)$ to the site. If the probability is proportional to number of visits to the…
We consider the possible visits to visible points of a random walker moving up and right in the integer lattice (with probability $\alpha$ and $1-\alpha$, respectively) and starting from the origin. We show that, almost surely, the…
We consider a simple random walk W_i in 1 or 2 dimensions, in which the walker may choose to stand still for a limited time. The time horizon is n, the maximum consecutive time steps which can be spent standing still is m_n and the goal is…
Finding a target in a complex environment is a fundamental challenge in nature, from chemical reactions to sperm reaching an egg. An effective strategy to reduce the time needed to reach a target is to deploy many searchers, increasing the…
In this paper we study some aspects of search for an immobile target by a swarm of N non-communicating, randomly moving searchers (numbered by the index k, k = 1, 2,..., N), which all start their random motion simultaneously at the same…
In this paper, we study the dynamics of a random walker diffusing on a disordered one-dimensional lattice with random trappings. The distribution of escape probabilities is computed exactly for any strength of the disorder. These…
We consider a one-dimensional simple random walk killed by quenched soft obstacles. The position of the obstacles is drawn according to a renewal process with a power-law increment distribution. In a previous work, we computed the…
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…
Random walks are the simplest way to explore or search a graph, and have revealed a very useful tool to investigate and characterize the structural properties of complex networks from the real world, e.g. they have been used to identify the…