Related papers: Slowest first passage times, redundancy, and menop…
We present an analytical approximation scheme for the first passage time distribution on a finite interval of a random walker on a random forcing energy landscape. The approximation scheme captures the behavior of the distribution over all…
In this paper we explore the life expectancy limits by based on the stochastic modeling of mortality and applying the first exit or hitting time theory of a stochastic process. The main assumption is that the health state or the "vitality",…
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…
Fastest arrival events, where the first among many diffusing particles reaches a target, are central in triggering signal initiation in molecular stochastic systems. Classical approaches to simulate such events rely on full trajectory…
We reconsider stochastic convergence analyses of particle swarm optimisation, and point out that previously obtained parameter conditions are not always sufficient to guarantee mean square convergence to a local optimum. We show that…
The mean first passage time~(MFPT) of random walks is a key quantity characterizing dynamic processes on disordered media. In a random fractal embedded in the Euclidean space, the MFPT is known to obey the power law scaling with the…
We investigate two coupled properties of Levy stable random motions: The first passage times (FPTs) and the first passage leapovers (FPLs). While, in general, the FPT problem has been studied quite extensively, the FPL problem has hardly…
The mean first-passage time (MFPT) is one standard measure for the reaction time in thermally activated barrier-crossing processes. While the relationship between MFPTs and phenomenological rate coefficients is known for systems that…
First passage time models describe the time it takes for a random process to exit a region of interest and are widely used across various scientific fields. Fast and accurate numerical methods for computing the likelihood function in these…
In this work we address the analysis of discrete-time models of structured metapopulations subject to environmental stochasticity. Previous works on these models made use of the fact that migrations between the patches can be considered…
We investigate the extreme first-passage statistics of $N$ non-interacting random walkers on discrete, hierarchical networks. {By distinguishing between transport limited by escape from localized initial states (injection-limited) and…
We study the statistics of the first-passage time of a single run and tumble particle (RTP) in one spatial dimension, with or without resetting, to a fixed target located at $L>0$. First, we compute the first-passage time distribution of a…
Understanding excitation and charge transfer in disordered media is a significant challenge in chemistry, biophysics and material science. We study two experimentally-relevant measures for carriers transfer in finite-size chains, the…
Networks that are organized as a hierarchy of modules have been the subject of much research, mainly focusing on algorithms that can extract this community structure from data. The question of why modular hierarchical organizations are so…
We derive an approximate but explicit formula for the Mean First Passage Time of a random walker between a source and a target node of a directed and weighted network. The formula does not require any matrix inversion, and it takes as only…
In this paper, by using two different techniques we derive an explicit formula for the mean first-passage time (MFPT) between any pair of nodes on a general undirected network, which is expressed in terms of eigenvalues and eigenvectors of…
We determine the survival probability and first-passage time (FPT) to capture for a harmonically trapped particle, diffusing outside an absorbing spherical boundary by directly solving the differential equation for the survival probability.…
We investigate random walks on complex networks and derive an exact expression for the mean first passage time (MFPT) between two nodes. We introduce for each node the random walk centrality $C$, which is the ratio between its coordination…
The spectral theory of random walks on networks of arbitrary topology can be readily extended to study random walks and L\'evy flights subject to resetting on these structures. When a discrete-time process is stochastically brought back…
We consider the problem of online scheduling on a single machine in order to minimize weighted flow time. The existing algorithms for this problem (STOC '01, SODA '03, FOCS '18) all require exact knowledge of the processing time of each…