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

Abstract

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 $n^{\mathrm{th}}$ generation graph of the family, this probability is shown to be given by the $n^{\mathrm{th}}$ iterate of a certain scaling function or map $q\to 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 $2$ and $3$ 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.

arXiv comment40 pages, 6 figures

References in corpus (17)

• Exact mean first-passage time on the T-graph
• Restart could optimize the probability of success in a Bernoulli trial
• Occupation times of random walks in confined geometries: From random trap model to diffusion limited reactions
• Mortality, Redundancy, and Diversity in Stochastic Search
• Exact calculations of first-passage quantities on recursive networks
• Determining mean first-passage time on a class of treelike regular fractals
• Exploration and Trapping of Mortal Random Walkers
• The escape problem for mortal walkers
• Depletion-Controlled Starvation of a Diffusing Forager
• Optimal search strategies of space-time coupled random walkers with finite lifetimes
• Evanescent continuous time random walks
• Role of Depletion on the Dynamics of a Diffusing Forager
• The number statistics and optimal history of non-equilibrium steady states of mortal diffusing particles
• Starvation Dynamics of a Greedy Forager
• First-passage method for the study of the efficiency of a two-channel reaction on a lattice
• Reaction rate in an evanescent random walkers system
• Random Walks on Lattices. Influence of Competing Reaction Centers on Diffusion-Controlled Processes

Cited by in corpus (4)

• Effects of mortality on stochastic search processes with resetting
• Exact and Approximate Mean First Passage Times on Trees and other Necklace Structures: a Local Equilibrium Approach
• A molecular relay race: sequential first-passage events to the terminal reaction centre in a cascade of diffusion controlled processes
• Energy-constrained random walk with boundary replenishment