Related papers: First passage time for subdiffusion: The nonextens…
We show the asymptotic long-time equivalence of a generic power law waiting time distribution to the Mittag-Leffler waiting time distribution, characteristic for a time fractional CTRW. This asymptotic equivalence is effected by a…
Recently, in the paper: T. Koszto{\l}owicz and A. Dutkiewicz, Phys. Rev. E \textbf{104}, 014118 (2021) the $g$--subdiffusion equation with fractional Caputo time derivative with respect to another function $g$ has been considered. This…
Extensive empirical investigation has shown that a plethora of real networks synchronously exhibit scale-free and modular structure, and it is thus of great importance to uncover the effects of these two striking properties on various…
We consider the first-passage problem for $N$ identical independent particles that are initially released uniformly in a finite domain $\Omega$ and then diffuse toward a reactive area $\Gamma$, which can be part of the outer boundary of…
The waiting time distribution has, in recent years, proven to be a useful statistical tool for characterising transport in nanoscale quantum transport. In particular, as opposed to moments of the distribution of transferred charge, which…
The ordinary subdiffusion equation, with a fractional time derivative of at most first order, describes a process in which the propagation velocity of diffusing molecules is unlimited. To avoid this non-physical property different forms of…
In principle, the generalized master equation can be used to efficiently compute the macroscopic first passage time (FPT) distribution of a complex stochastic system from short-term microscopic simulation data. However, computing its…
We consider the initial/boundary value problem for the fractional diffusion and diffusion-wave equations involving a Caputo fractional derivative in time. We develop two "simple" fully discrete schemes based on the Galerkin finite element…
We study analytically and numerically the mean fastest first-passage time (fFPT) to an immobile target for an ensemble of $N$ independent finite-speed random searchers driven by dichotomous noise and described by the telegrapher's equation.…
First-passage processes are pervasive across numerous scientific fields, yet a general framework for understanding their response to external perturbations remains elusive. While the fluctuation-dissipation theorem offers a complete linear…
In this chapter, we review our recent work on first passage time (FPT) problems for absorption by a target whose interface is semipermeable. For pedagogical reasons, we focus on a single Brownian particle searching for a single target in a…
Time evolutions whose infinitesimal generator is a fractional time derivative arise generally in the long time limit. Such fractional time evolutions are considered here for random walks. An exact relationship is given between the…
First passage phenomena arise across physics, biology, and finance when stochastic processes first reach a threshold, triggering downstream events. Examples include the irreversible exit from a domain, a biochemical reaction, a financial…
We propose the first return time distribution (FRTD) of a random walk as an interpretable and mathematically grounded node embedding. The FRTD assigns a probability mass function to each node, allowing us to define a distance between any…
We study the first passage statistics to adsorbing boundaries of a Brownian motion in bounded two-dimensional domains of different shapes and configurations of the adsorbing and reflecting boundaries. From extensive numerical analysis we…
A rapidly increasing number of systems is identified in which the stochastic motion of tracer particles follows the Brownian law $\langle\mathbf{r}^2(t) \rangle\simeq Dt$ yet the distribution of particle displacements is strongly…
We study discrete random walks on the NFSFT and provide new methods to calculate the analytic solutions of the MFPT for any pair of nodes, the MTT for any target node and MDT for any source node. Further more, using the MTT and the MDT as…
We study the first passage time (FPT) problem for biased continuous time random walks. Using the recently formulated framework of fractional Fokker-Planck equations, we obtain the Laplace transform of the FPT density function when the bias…
The first-passage time (FPT) is the time it takes a system variable to cross a given boundary for the first time. In the context of Markov networks, the FPT is the time a random walker takes to reach a particular node (target) by hopping…
Continuous time random walk (CTRW) subdiffusion along with the associated fractional Fokker-Planck equation (FFPE) is traditionally based on the premise of random clock with divergent mean period. This work considers an alternative CTRW and…