Exploration and trapping of mortal random walkers

Adsorption and Permeation Events in Molecular Diffusion

How many times can a diffusing molecule permeate across a membrane or be adsorbed on a substrate? We employ an encounter-based approach to find the statistics of adsorption or permeation events for molecular diffusion in a general confining medium. Various features of these statistics are illustrated for two practically relevant cases: a flat boundary and a spherical confinement. Some applications of these fundamental results are discussed.

Dynamic redundancy as a mechanism to optimize collective random searches

We explore the case of a group of random walkers looking for a target randomly located in space, such that the number of walkers is not constant but new ones can join the search, or those that are active can abandon it, with constant rates r_{b} and r_{d}, respectively. Exact analytical solutions are provided both for the fastest-first-passage time and for the collective time cost required to reach the target, for the exemplifying case of Brownian walkers with r_{d}=0. We prove that even for such a simple situation there exists an optimal rate r_{b} at which walkers should join the search to minimize the collective search costs. We discuss how these results open a new line to understand the optimal regulation in searches conducted through multiparticle random walks, e.g., in chemical or biological processes.

Constructing efficient strategies for the process optimization by restart

Optimization of the mean completion time of random processes by restart is a subject of active theoretical research in statistical physics and has long found practical application in computer science. Meanwhile, one of the key issues remains largely unsolved: how to construct a restart strategy for a process whose detailed statistics are unknown to ensure that the expected completion time will reduce? Addressing this query here we propose several constructive criteria for the effectiveness of various protocols of noninstantaneous restart in the mean completion time problem and in the success probability problem. Being expressed in terms of a small number of easily estimated statistical characteristics of the original process (MAD, median completion time, low-order statistical moments of completion time), these criteria allow informed restart decision based on partial information.

Optimizing the random search of a finite-lived target by a Lévy flight

In many random search processes of interest in chemistry, biology, or during rescue operations, an entity must find a specific target site before the latter becomes inactive, no longer available for reaction or lost. We present exact results on a minimal model system, a one-dimensional searcher performing a discrete time random walk, or Lévy flight. In contrast with the case of a permanent target, the capture probability and the conditional mean first passage time can be optimized. The optimal Lévy index takes a nontrivial value, even in the long lifetime limit, and exhibits an abrupt transition as the initial distance to the target is varied. Depending on the target lifetime, this transition is discontinuous or continuous, separated by a nonconventional tricritical point. These results pave the way to the optimization of search processes under time constraints.

Diffusion-Controlled Reactions: An Overview

We review the milestones in the century-long development of the theory of diffusion-controlled reactions. Starting from the seminal work by von Smoluchowski, who recognized the importance of diffusion in chemical reactions, we discuss perfect and imperfect surface reactions, their microscopic origins, and the underlying mathematical framework. Single-molecule reaction schemes, anomalous bulk diffusions, reversible binding/unbinding kinetics, and many other extensions are presented. An alternative encounter-based approach to diffusion-controlled reactions is introduced, with emphasis on its advantages and potential applications. Some open problems and future perspectives are outlined.

Bernoulli trial under restarts: A comparative study of resetting transitions

A Bernoulli trial describing the escape behavior of a lamb to a safe haven in pursuit by a lion is studied under restarts. The process ends in two ways: either the lamb makes it to the safe haven (success) or is captured by the lion (failure). We study the first passage properties of this Bernoulli trial and find that only mean first passage time exists. Considering Poisson and sharp resetting, we find that the success probability is a monotonically decreasing function of the restart rate. The mean time, however, exhibits a nonmonotonic dependence on the restart rate taking a minimal value at an optimal restart rate. Furthermore, for sharp restart, the mean time possesses a local and a global minima. As a result, the optimal restart rate exhibits a continuous transition for Poisson resetting while it exhibits a discontinuous transition for sharp resetting as a function of the relative separation of the lion and the lamb. We also find that the distribution of first passage times under sharp resetting exhibits a periodic behavior.

Slowest first passage times, redundancy, and menopause timing

Biological events are often initiated when a random "searcher" finds a "target," which is called a first passage time (FPT). In some biological systems involving multiple searchers, an important timescale is the time it takes the slowest searcher(s) to find a target. For example, of the hundreds of thousands of primordial follicles in a woman's ovarian reserve, it is the slowest to leave that trigger the onset of menopause. Such slowest FPTs may also contribute to the reliability of cell signaling pathways and influence the ability of a cell to locate an external stimulus. In this paper, we use extreme value theory and asymptotic analysis to obtain rigorous approximations to the full probability distribution and moments of slowest FPTs. Though the results are proven in the limit of many searchers, numerical simulations reveal that the approximations are accurate for any number of searchers in typical scenarios of interest. We apply these general mathematical results to models of ovarian aging and menopause timing, which reveals the role of slowest FPTs for understanding redundancy in biological systems. We also apply the theory to several popular models of stochastic search, including search by diffusive, subdiffusive, and mortal searchers.

Encounter-based approach to the escape problem

We revise the encounter-based approach to imperfect diffusion-controlled reactions, which employs the statistics of encounters between a diffusing particle and the reactive region to implement surface reactions. We extend this approach to deal with a more general setting, in which the reactive region is surrounded by a reflecting boundary with an escape region. We derive a spectral expansion for the full propagator and investigate the behavior and probabilistic interpretations of the associated probability flux density. In particular, we obtain the joint probability density of the escape time and the number of encounters with the reactive region before escape, and the probability density of the first-crossing time of a prescribed number of encounters. We briefly discuss generalizations of the conventional Poissonian-type surface reaction mechanism described by Robin boundary condition and potential applications of this formalism in chemistry and biophysics.

Effects of mortality on stochastic search processes with resetting

We study the first-passage time to the origin of a mortal Brownian particle, with mortality rate μ, diffusing in one dimension. The particle starts its motion from x>0 and it is subject to stochastic resetting with constant rate r. We first unveil the relation between the probability of reaching the target and the mean first-passage time of the corresponding problem in absence of mortality, which allows us to deduce under which conditions the former can be increased by adjusting the restart rate. We then consider the first-passage time conditioned on the event that the particle reaches the target before dying, and provide exact expressions for the mean and the variance as functions of r, corroborated by numerical simulations. By studying the impact of resetting for different mortality regimes, we also show that, if the average lifetime τ_{μ}=1/μ is long enough with respect to the diffusive time scale τ_{D}=x^{2}/(4D), there exist both a resetting rate r_{μ}^{*} that maximizes the probability and a rate r_{m} that minimizes the mean first-passage time. However, the two never coincide for positive μ, making the optimization problem highly nontrivial.

Diffusion toward a nanoforest of absorbing pillars

Spiky coatings (also known as nanoforests or Fakir-like surfaces) have found many applications in chemical physics, material sciences, and biotechnology, such as superhydrophobic materials, filtration and sensing systems, and selective protein separation, to name but a few. In this paper, we provide a systematic study of steady-state diffusion toward a periodic array of absorbing cylindrical pillars protruding from a flat base. We approximate a periodic cell of this system by a circular tube containing a single pillar, derive an exact solution of the underlying Laplace equation, and deduce a simple yet exact representation for the total flux of particles onto the pillar. The dependence of this flux on the geometric parameters of the model is thoroughly analyzed. In particular, we investigate several asymptotic regimes, such as a thin pillar limit, a disk-like pillar, and an infinitely long pillar. Our study sheds light onto the trapping efficiency of spiky coatings and reveals the roles of pillar anisotropy and diffusional screening.

Optimal escape-and-feeding dynamics of random walkers: Rethinking the convenience of ballistic strategies

Excited random walks represent a convenient model to study food intake in a media which is progressively depleted by the walker. Trajectories in the model alternate between (i) feeding and (ii) escape (when food is missed and so it must be found again) periods, each governed by different movement rules. Here, we explore the case where the escape dynamics is adaptive, so at short times an area-restricted search is carried out, and a switch to extensive or ballistic motion occurs later if necessary. We derive for this case explicit analytical expressions of the mean escape time and the asymptotic growth of the depleted region in one dimension. These, together with numerical results in two dimensions, provide surprising evidence that ballistic searches are detrimental in such scenarios, a result which could explain why ballistic movement is barely observed in animal searches at microscopic and millimetric scales, therefore providing significant implications for biological foraging.

Extreme first-passage times for random walks on networks

Many biological, social, and communication systems can be modeled by "searchers" moving through a complex network. For example, intracellular cargo is transported on tubular networks, news and rumors spread through online social networks, and the rapid global spread of infectious diseases occurs through passengers traveling on the airport network. To understand the timescale of search (or "transport" or "spread"), one commonly studies the first-passage time (FPT) of a single searcher (or "transporter" or "spreader") to a target. However, in many scenarios the relevant timescale is not the FPT of a single searcher to a target, but rather the FPT of the fastest searcher to a target out of many searchers. For example, many processes in cell biology are triggered by the first molecule to find a target out of many, and the time it takes an infectious disease to reach a particular city depends on the first infected traveler to arrive out of potentially many infected travelers. Such fastest FPTs are called extreme FPTs. In this paper, we study extreme FPTs for a general class of continuous-time random walks on networks (which includes continuous-time Markov chains). In the limit of many searchers, we find explicit formulas for the probability distribution and all the moments of the kth fastest FPT for any fixed k≥1. These rigorous formulas depend only on network parameters along a certain geodesic path(s) from the starting location to the target since the fastest searchers take a direct route to the target. Hence, the extreme FPTs are independent of the details of the network outside this geodesic(s) and can be drastically faster and less variable than conventional FPTs of single searchers. Furthermore, our results allow one to estimate if a particular system is in a regime characterized by fast extreme FPTs. We also prove similar results for mortal searchers on a network that are conditioned to find the target before a fast inactivation time. We illustrate our results with numerical simulations and uncover potential pitfalls of modeling diffusive or subdiffusive processes involving extreme statistics. In particular, we find that the many searcher limit does not commute with the diffusion limit for random walks, and thus care must be taken when choosing spatially continuous versus spatially discrete diffusion models.

Surface hopping propagator: An alternative approach to diffusion-influenced reactions

Dynamics of a particle diffusing in a confinement can be seen a sequence of bulk-diffusion-mediated hops on the confinement surface. Here, we investigate the surface hopping propagator that describes the position of the diffusing particle after a prescribed number of encounters with that surface. This quantity plays the central role in diffusion-influenced reactions and determines their most common characteristics such as the propagator, the first-passage time distribution, and the reaction rate. We derive explicit formulas for the surface hopping propagator and related quantities for several Euclidean domains: half-space, circular annuli, circular cylinders, and spherical shells. These results provide the theoretical ground for studying diffusion-mediated surface phenomena. The behavior of the surface hopping propagator is investigated for both "immortal" and "mortal" particles.

Paradigm Shift in Diffusion-Mediated Surface Phenomena

Diffusion-mediated surface phenomena are crucial for human life and industry, with examples ranging from oxygen capture by lung alveolar surface to heterogeneous catalysis, gene regulation, membrane permeation, and filtration processes. Their current description via diffusion equations with mixed boundary conditions is limited to simple surface reactions with infinite or constant reactivity. In this Letter, we propose a probabilistic approach based on the concept of boundary local time to investigate the intricate dynamics of diffusing particles near a reactive surface. Reformulating surface-particle interactions in terms of stopping conditions, we obtain in a unified way major diffusion-reaction characteristics such as the propagator, the survival probability, the first-passage time distribution, and the reaction rate. This general formalism allows us to describe new surface reaction mechanisms such as for instance surface reactivity depending on the number of encounters with the diffusing particle that can model the effects of catalyst fooling or membrane degradation. The disentanglement of the geometric structure of the medium from surface reactivity opens far-reaching perspectives for modeling, optimization, and control of diffusion-mediated surface phenomena.

Diffusion toward non-overlapping partially reactive spherical traps: Fresh insights onto classic problems

Several classic problems for particles diffusing outside an arbitrary configuration of non-overlapping partially reactive spherical traps in three dimensions are revisited. For this purpose, we describe the generalized method of separation of variables for solving boundary value problems of the associated modified Helmholtz equation. In particular, we derive a semi-analytical solution for the Green function that is the key ingredient to determine various diffusion-reaction characteristics such as the survival probability, the first-passage time distribution, and the reaction rate. We also present modifications of the method to determine numerically or asymptotically the eigenvalues and eigenfunctions of the Laplace operator and the Dirichlet-to-Neumann operator in such perforated domains. Some potential applications in chemical physics and biophysics are discussed, including diffusion-controlled reactions for mortal particles.

Probability distribution of the boundary local time of reflected Brownian motion in Euclidean domains

How long does a diffusing molecule spend in a close vicinity of a confining boundary or a catalytic surface? This quantity is determined by the boundary local time, which plays thus a crucial role in the description of various surface-mediated phenomena, such as heterogeneous catalysis, permeation through semipermeable membranes, or surface relaxation in nuclear magnetic resonance. In this paper, we obtain the probability distribution of the boundary local time in terms of the spectral properties of the Dirichlet-to-Neumann operator. We investigate the short-time and long-time asymptotic behaviors of this random variable for both bounded and unbounded domains. This analysis provides complementary insights onto the dynamics of diffusing molecules near partially reactive boundaries.

First-passage properties of mortal random walks: Ballistic behavior, effective reduction of dimensionality, and scaling functions for hierarchical graphs

We consider a mortal random walker on a family of hierarchical graphs in the presence of some trap sites. The configuration comprising the graph, the starting point of the walk, and the locations of the trap sites is taken to be exactly self-similar as one goes from one generation of the family to the next. Under these circumstances, the total probability that the walker hits a trap is determined exactly as a function of the single-step survival probability q of the mortal walker. On the nth generation graph of the family, this probability is shown to be given by the nth iterate of a certain scaling function or map q→f(q). The properties of the map then determine, in each case, the behavior of the trapping probability, the mean time to trapping, the temporal scaling factor governing the random walk dimension on the graph, and other related properties. The formalism is illustrated for the cases of a linear hierarchical lattice and the Sierpinski graphs in two and three Euclidean dimensions. We find an effective reduction of the random walk dimensionality due to the ballistic behavior of the surviving particles induced by the mortality constraint. The relevance of this finding for experiments involving travel times of particles in diffusion-decay systems is discussed.

Heterogeneous continuous-time random walks

We introduce a heterogeneous continuous-time random walk (HCTRW) model as a versatile analytical formalism for studying and modeling diffusion processes in heterogeneous structures, such as porous or disordered media, multiscale or crowded environments, weighted graphs or networks. We derive the exact form of the propagator and investigate the effects of spatiotemporal heterogeneities onto the diffusive dynamics via the spectral properties of the generalized transition matrix. In particular, we show how the distribution of first-passage times changes due to local and global heterogeneities of the medium. The HCTRW formalism offers a unified mathematical language to address various diffusion-reaction problems, with numerous applications in material sciences, physics, chemistry, biology, and social sciences.

The escape problem for mortal walkers

We introduce and investigate the escape problem for random walkers that may eventually die, decay, bleach, or lose activity during their diffusion towards an escape or reactive region on the boundary of a confining domain. In the case of a first-order kinetics (i.e., exponentially distributed lifetimes), we study the effect of the associated death rate onto the survival probability, the exit probability, and the mean first passage time. We derive the upper and lower bounds and some approximations for these quantities. We reveal three asymptotic regimes of small, intermediate, and large death rates. General estimates and asymptotics are compared to several explicit solutions for simple domains and to numerical simulations. These results allow one to account for stochastic photobleaching of fluorescent tracers in bio-imaging, degradation of mRNA molecules in genetic translation mechanisms, or high mortality rates of spermatozoa in the fertilization process. Our findings provide a mathematical ground for optimizing storage containers and materials to reduce the risk of leakage of dangerous chemicals or nuclear wastes.

Nonstationary dynamics of encounters: Mean valuable territory covered by a random searcher

Inspired by recent experiments on the organism Caenorhabditis elegans we present a stochastic problem to capture the adaptive dynamics of search in living beings, which involves the exploration-exploitation dilemma between remaining in a previously preferred area and relocating to new places. We assess the question of search efficiency by introducing a new magnitude, the mean valuable territory covered by a Browinan searcher, for the case where each site in the domain becomes valuable only after a random time controlled by a nonhomogeneous rate which expands from the origin outwards. We explore analytically this magnitude for domains of dimensions 1, 2, and 3 and discuss the theoretical and applied (biological) interest of our approach. As the main results here, we (i) report the existence of some universal scaling properties for the mean valuable territory covered as a function of time and (ii) reveal the emergence of an optimal diffusivity which appears only for domains in two and higher dimensions.

Reaction–diffusion with stochastic decay rates

Microscopic physical and chemical fluctuations in a reaction–diffusion system lead to anomalous chemical kinetics and transport on the mesoscopic scale. Emergent non-Markovian effects lead to power-law reaction times and localization of reacting species.

Search in patchy media: Exploitation-exploration tradeoff

How to best exploit patchy resources? We introduce a minimal exploitation-migration model that incorporates the coupling between a searcher's trajectory, modeled by a random walk, and ensuing depletion of the environment by the searcher's consumption of resources. The searcher also migrates to a new patch when it takes S consecutive steps without finding resources. We compute the distribution of consumed resources F_{t} at time t for this non-Markovian searcher and show that consumption is maximized by exploring multiple patches. In one dimension, we derive the optimal strategy to maximize F_{t}. This strategy is robust with respect to the distribution of resources within patches and the criterion for leaving the current patch. We also show that F_{t} has an optimum in the ecologically relevant case of two-dimensional patchy environments.

Universality classes of foraging with resource renewal

We determine the impact of resource renewal on the lifetime of a forager that depletes its environment and starves if it wanders too long without eating. In the framework of a minimal starving random-walk model with resource renewal, there are three universal classes of behavior as a function of the renewal time. For sufficiently rapid renewal, foragers are immortal, while foragers have a finite lifetime otherwise. In the specific case of one dimension, there is a third regime, for sufficiently slow renewal, in which the lifetime of the forager is independent of the renewal time. We outline an enumeration method to determine the mean lifetime of the forager in the mortal regime.

Phase transitions in optimal search times: How random walkers should combine resetting and flight scales

Recent works have explored the properties of Lévy flights with resetting in one-dimensional domains and have reported the existence of phase transitions in the phase space of parameters which minimizes the mean first passage time (MFPT) through the origin [L. Kusmierz et al., Phys. Rev. Lett. 113, 220602 (2014)]. Here, we show how actually an interesting dynamics, including also phase transitions for the minimization of the MFPT, can also be obtained without invoking the use of Lévy statistics but for the simpler case of random walks with exponentially distributed flights of constant speed. We explore this dynamics both in the case of finite and infinite domains, and for different implementations of the resetting mechanism to show that different ways to introduce resetting consistently lead to a quite similar dynamics. The use of exponential flights has the strong advantage that exact solutions can be obtained easily for the MFPT through the origin, so a complete analytical characterization of the system dynamics can be provided. Furthermore, we discuss in detail how the phase transitions observed in random walks with resetting are closely related to several ideas recurrently used in the field of random search theory, in particular, to other mechanisms proposed to understand random search in space as mortal random walks or multiscale random walks. As a whole, we corroborate that one of the essential ingredients behind MFPT minimization lies in the combination of multiple movement scales (regardless of their specific origin).

Analytical solution and scaling of fluctuations in complex networks traversed by damped, interacting random walkers

A general model for random walks (RWs) on networks is proposed. It incorporates damping and time-dependent links, and it includes standard (undamped, noninteracting) RWs (SRWs), coalescing RWs, and coalescing-branching RWs as special cases. The exact, time-dependent solutions for the average numbers of visits (w) to nodes and their fluctuations (σ2) are given, and the long-term σ-w relation is studied. Although σ ∝ w(1/2) for SRWs, this power law can be fragile when coalescing-branching interaction is present. Damping, however, often strengthens it but with an exponent generally different from 1/2.

Lévy Walks Suboptimal under Predation Risk

A key challenge in movement ecology is to understand how animals move in nature. Previous studies have predicted that animals should perform a special class of random walks, called Lévy walk, to obtain more targets. However, some empirical studies did not support this hypothesis, and the relationship between search strategy and ecological factors is still unclear. We focused on ecological factors, such as predation risk, and analyzed whether Lévy walk may not be favored. It was remarkable that the ecological factors often altered an optimal search strategy from Lévy walk to Brownian walk, depending on the speed of the predator's movement, density of predators, etc. This occurred because higher target encounter rates simultaneously led searchers to higher predation risks. Our findings indicate that animals may not perform Lévy walks often, and we suggest that it is crucial to consider the ecological context for evaluating the search strategy performed by animals in the field.

Mortality, redundancy, and diversity in stochastic search

We investigate a stochastic search process in one dimension under the competing roles of mortality, redundancy, and diversity of the searchers. This picture represents a toy model for the fertilization of an oocyte by sperm. A population of N independent and mortal diffusing searchers all start at x=L and attempt to reach the target at x=0. When mortality is irrelevant, the search time scales as τ_{D}/lnN for lnN≫1, where τ_{D}~L^{2}/D is the diffusive time scale. Conversely, when the mortality rate μ of the searchers is sufficiently large, the search time scales as sqrt[τ_{D}/μ], independent of N. When searchers have distinct and high mortalities, a subpopulation with a nontrivial optimal diffusivity is most likely to reach the target. We also discuss the effect of chemotaxis on the search time and its fluctuations.

Optimal search strategies of space-time coupled random walkers with finite lifetimes

We present a simple paradigm for detection of an immobile target by a space-time coupled random walker with a finite lifetime. The motion of the walker is characterized by linear displacements at a fixed speed and exponentially distributed duration, interrupted by random changes in the direction of motion and resumption of motion in the new direction with the same speed. We call these walkers "mortal creepers." A mortal creeper may die at any time during its motion according to an exponential decay law characterized by a finite mean death rate ω(m). While still alive, the creeper has a finite mean frequency ω of change of the direction of motion. In particular, we consider the efficiency of the target search process, characterized by the probability that the creeper will eventually detect the target. Analytic results confirmed by numerical results show that there is an ω(m)-dependent optimal frequency ω=ω(opt) that maximizes the probability of eventual target detection. We work primarily in one-dimensional (d=1) domains and examine the role of initial conditions and of finite domain sizes. Numerical results in d=2 domains confirm the existence of an optimal frequency of change of direction, thereby suggesting that the observed effects are robust to changes in dimensionality. In the d=1 case, explicit expressions for the probability of target detection in the long time limit are given. In the case of an infinite domain, we compute the detection probability for arbitrary times and study its early- and late-time behavior. We further consider the survival probability of the target in the presence of many independent creepers beginning their motion at the same location and at the same time. We also consider a version of the standard "target problem" in which many creepers start at random locations at the same time.

Competing reaction processes on a lattice as a paradigm for catalyst deactivation

We mobilize both a generating function approach and the theory of finite Markov processes to compute the probability of irreversible absorption of a randomly diffusing species on a lattice with competing reaction centers. We consider an N-site lattice populated by a single deep trap, and N-1 partially absorbing traps (absorption probability 0<s<1). The influence of competing reaction centers on the probability of reaction at a target site (the deep trap) and the mean walk length of the random walker before localization (a measure of the reaction efficiency) are computed for different geometries. Both analytic expressions and numerical results are given for reactive processes on two-dimensional surfaces of Euler characteristic Ω=0 and Ω=2. The results obtained allow a characterization of catalyst deactivation processes on planar surfaces and on catalyst pellets where only a single catalytic site remains fully active (deep trap), the other sites being only partially active as a result of surface poisoning. The central result of our study is that the predicted dependence of the reaction efficiency on system size N and on s is in qualitative accord with previously reported experimental results, notably catalysts exhibiting selective poisoning due to surface sites that have different affinities for chemisorption of the poisoning agent (e.g., acid zeolite catalysts). Deviations from the efficiency of a catalyst with identical sites are quantified, and we find that such deviations display a significant dependence on the topological details of the surface (for fixed values of N and s we find markedly different results for, say, a planar surface and for the polyhedral surface of a catalyst pellet). Our results highlight the importance of surface topology for the efficiency of catalytic conversion processes on inhomogeneous substrates, and in particular for those aimed at industrial applications. From our exact analysis we extract results for the two limiting cases s≈1 and s≈0, corresponding respectively to weak and strong catalyst poisoning (decreasing s leads to a monotonic decrease in the efficiency of catalytic conversion). The results for the s≈0 case are relevant for the dual problem of light-energy conversion via trapping of excitations in the chlorophyll antenna network. Here, decreasing the probability of excitation trapping s at sites other than the target molecule does not result in a decrease of the efficiency as in the catalyst case, but rather in enhanced efficiency of light-energy conversion, which we characterize in terms of N and s. The one-dimensional case and its connection with a modified version of the gambler's ruin problem are discussed. Finally, generalizations of our model are described briefly.

Depletion-controlled starvation of a diffusing forager

We study the starvation of a lattice random walker in which each site initially contains one food unit and the walker can travel S steps without food before starving. When the walker encounters food, it is completely eaten, and the walker can again travel S steps without food before starving. When the walker hits an empty site, the time until the walker starves decreases by 1. In spatial dimension d=1, the average lifetime of the walker ⟨τ⟩∝S, while for d>2, ⟨τ⟩≃exp(S^{ω}), with ω→1 as d→∞; the latter behavior suggests that the upper critical dimension is infinite. In the marginal case of d=2, ⟨τ⟩∝S^{z}, with z≈2. Long-lived walks explore a highly ramified region so they always remain close to sources of food and the distribution of distinct sites visited does not obey single-parameter scaling.

Anomalous diffusion models and their properties: non-stationarity, non-ergodicity, and ageing at the centenary of single particle tracking

This Perspective summarises the properties of a variety of anomalous diffusion processes and provides the necessary tools to analyse and interpret recorded anomalous diffusion data.

Evanescent continuous-time random walks

We study how an evanescence process affects the number of distinct sites visited by a continuous-time random walker in one dimension. We distinguish two very different cases, namely, when evanescence can only occur concurrently with a jump, and when evanescence can occur at any time. The first is characteristic of trapping processes on a lattice, whereas the second is associated with spontaneous death processes such as radioactive decay. In both of these situations we consider three different forms of the waiting time distribution between jumps, namely, exponential, long tailed, and ultraslow.