Related papers: First-passage processes and the target-based accum…
Consider a team of agents in the plane searching for and visiting target points that appear in a bounded environment according to a stochastic renewal process with a known absolutely continuous spatial distribution. Agents must detect…
We propose TAROT, a targeted data selection framework grounded in optimal transport theory. Previous targeted data selection methods primarily rely on influence-based greedy heuristics to enhance domain-specific performance. While effective…
Even after decades of research the problem of first passage time statistics for quantum dynamics remains a challenging topic of fundamental and practical importance. Using a projective measurement approach, with a sampling time $\tau$, we…
A wide variety of real-life networks share two remarkable generic topological properties: scale-free behavior and modular organization, and it is natural and important to study how these two features affect the dynamical processes taking…
We study the first hitting time statistics between a one-dimensional run-and-tumble particle and a target site that switches intermittently between visible and invisible phases. The two-state dynamics of the target is independent of the…
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 the translocation of a single stranded DNA through a pore which fluctuates between two conformations, using coupled master equations. The probability density function of the first passage times (FPT) of the translocation…
A large and sparse random graph with independent exponentially distributed link weights can be used to model the propagation of messages or diseases in a network with an unknown connectivity structure. In this article we study an extended…
Research in psychology and neuroscience has successfully modeled decision making as a process of noisy evidence accumulation to a decision bound. While there are several variants and implementations of this idea, the majority of these…
In this paper, we study random walks on a small-world scale-free network, also called as pseudofractal scale-free web (PSFW), and analyze the volatilities of first passage time (FPT) and first return time (FRT) by using the variance and the…
The random walk process underlies the description of a large number of real world phenomena. Here we provide the study of random walk processes in time varying networks in the regime of time-scale mixing; i.e. when the network connectivity…
Efficient spatial exploration is a key aspect of search and rescue. In this paper, we present a search algorithm that generates efficient trajectories that optimize the rate at which probability mass is covered by a searcher. This should…
Many out of equilibrium phenomena, such as diffusion-limited reactions or target search processes, are controlled by first-passage events. So far the general determination of the mean first-passage time (FPT) to a target in confinement has…
For rotationally invariant first passage percolation (FPP) on the plane, we use a multi-scale argument to prove stretched exponential concentration of the first passage times at the scale of the standard deviation. Our results are proved…
We consider the mean first passage time (MFPT) for a diffusive particle in a potential landscape with the extra condition that the particle is reset to its original position with some rate r. We study non-smooth and non-convex potentials…
We derive the asymptotic first passage time (FPT) distribution for space-dependent variable-order time-fractional diffusion, where the fractional exponent $\alpha(x)$ varies with position. For any sufficiently smooth $\alpha(x)$ on a finite…
We define and study a class of resources allocation processes where $gN$ agents, by repeatedly visiting $N$ resources, try to converge to optimal configuration where each resource is occupied by at most one agent. The process exhibits a…
In studying randomized search heuristics, a frequent quantity of interest is the first time a (real-valued) stochastic process obtains (or passes) a certain value. The processes under investigation commonly show a bias towards this goal,…
We consider a problem of finding a target located in a finite $d$-dimensional domain, using $N$ independent random walkers, when partial information on the target location is given as a probability distribution. When $N$ is large, the…
We investigate the diffusive motion of an overdamped classical particle in a 1D random potential using the mean first-passage time formalism and demonstrate the efficiency of this method in the investigation of the large-time dynamics of…