相关论文: Span observables - "When is a foraging rabbit no l…
For a given barrier $S$ and a one-dimensional jump-diffusion process $X(t),$ starting from $x<S,$ we study the probability distribution of the integral $A_S(x)= \int_0 ^ {\tau_S(x)}X(t) \ dt$ determined by $X(t)$ till its first-crossing…
In this chapter, we review recent results on the starving random walk (RW) problem, a minimal model for resource-limited exploration. Initially, each lattice site contains a single food unit, which is consumed upon visitation by the RW. The…
We study an unbiased, discrete time random walk on the nonnegative integers, with the origin absorbing. The process has a history-dependent step length: the walker takes steps of length v while in a region which has been visited before, and…
Subdiffusive motion of tracer particles in complex crowded environments, such as biological cells, has been shown to be widepsread. This deviation from brownian motion is usually characterized by a sublinear time dependence of the mean…
We study the starvation of a lattice random walker in which each site initially contains one food unit and the walker can travel $\mathcal{S}$ steps without food before starving. When the walker encounters food, the food is completely…
We determine how long a diffusing particle spends in a given spatial range before it dies at an absorbing boundary. In one dimension, for a particle that starts at $x_0$ and is absorbed at $x=0$, the average residence time in the range…
We study the entropy of the distribution of the set R_n of vertices visited by a simple random walk on a graph with bounded degrees in its first n steps. It is shown that this quantity grows linearly in the expected size of R_n if the graph…
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,…
The average number $S_N(t)$ of distinct sites visited up to time t by N noninteracting random walkers all starting from the same origin in a disordered fractal is considered. This quantity $S_N(t)$ is the result of a double average: an…
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 one-dimensional run-and-tumble particle, or persistent random walk, in the presence of an absorbing boundary located at the origin. After each tumbling event, which occurs at a constant rate $\gamma$, the (new) velocity of the…
We develop an analytical method to calculate encounter times of two random walkers in one dimension when each individual is segregated in its own spatial domain and shares with its neighbor only a fraction of the available space, finding…
We study the long-time behavior of the probability density associated with the decoupled continuous-time random walk which is characterized by a superheavy-tailed distribution of waiting times. It is shown that if the random walk is…
Be $X_t$ a random process starting at $x \in [0,1]$ with absorbing boundary conditions at both ends of the interval. Denote $P_1(x)$ the probability to first exit at the upper boundary. For Brownian motion, $P_1(x)=x$, equivalent to…
Random walks have been proposed as a simple method of efficiently searching, or disseminating information throughout, communication and sensor networks. In nature, animals (such as ants) tend to follow correlated random walks, i.e., random…
Motivated by the dynamics of resonant neurons we consider a differentiable, non-Markovian random process $x(t)$ and particularly the time after which it will reach a certain level $x_b$. The probability density of this first passage time is…
We consider one-dimensional discrete-time random walks (RWs) in the presence of finite size traps of length $\ell$ over which the RWs can jump. We study the survival probability of such RWs when the traps are periodically distributed and…
How long does it take a random searcher to visit all sites of a given domain? This time, known as the cover time, is a key observable to quantify the efficiency of exhaustive searches, which require a complete exploration of an area and not…
We study the fate of a forager who searches for food performing a random walk on lattices. The forager consumes the available food on the site it visits and leaves it depleted but can survive up to $S$ steps without food. We introduce the…
We introduce a model of traveling agents ({\it e.g.} frugivorous animals) who feed on randomly located vegetation patches and disperse their seeds, thus modifying the spatial distribution of resources in the long term. It is assumed that…