Related papers: Target competition for resources under diffusive s…
We study first-passage time problems for a diffusive particle with stochastic resetting with a finite rate $r$. The optimal search time is compared quantitatively with that of an effective equilibrium Langevin process with the same…
Cover times quantify the speed of exhaustive search. In this work, we compute exactly the mean cover time associated with a one-dimensional Brownian search under exponentially distributed resetting. We also approximate the moments of cover…
We investigate the search of a target with a given spatial distribution in a finite one-dimensional domain. The searcher follows Brownian dynamics and is always reset to its initial position when reaching the boundaries of the domain…
We extend the theoretical framework used to study search processes with stochastic resetting to the case of partially absorbing targets. Instead of an absorption event occurring when the search particle reaches the boundary of a target, the…
The problem of finding a resource residing in a network node (the \emph{resource location problem}) is a challenge in complex networks due to aspects as network size, unknown network topology, and network dynamics. The problem is especially…
This paper considers the problem of resource-constrained and noise-limited localization and estimation of dynamic targets that are sparsely distributed over a large area. We generalize an existing framework [Bashan et al, 2008] for adaptive…
We consider a stochastic search model with resetting for an unknown stationary target $a\in\mathbb{R}^d,\ d\ge1$, with known distribution $\mu$. The searcher begins at the origin and performs Brownian motion with diffusion coefficient $D$.…
In this paper we use singular perturbation theory to solve the 2D narrow capture problem for a set of partially accessible targets $\calU_k$, $k=1,\ldots,N$, in a bounded domain $\Omega\subset \R^2$. In contrast to previous models of narrow…
Stochastic processes that are randomly reset to an initial condition serve as a showcase to investigate non-equilibrium steady states. However, all existing results have been restricted to the special case of memoryless resetting protocols.…
In this article, we study the optimization of resource distributions in a one-dimensional logistic diffusive model. The goal is to determine a distribution on a bounded one-dimensional domain that maximizes the total population at…
We study a multi-objective model on the allocation of reusable resources under model uncertainty. Heterogeneous customers arrive sequentially according to a latent stochastic process, request for certain amounts of resources, and occupy…
We consider a model of nomadic agents exploring and competing for time-varying location-specific resources, arising in crowdsourced transportation services, online communities, and in traditional location based economic activity. This model…
The dynamics of dispersal-structured populations, consisting of competing individuals that are characterized by different diffusion coefficients but are otherwise identical, is investigated. Competition is taken into account through…
A random search of a partially absorbing target by a run-and-tumble particle in a confined one-dimensional space is investigated. We analytically obtain the mean searching time, which shows a non-monotonic behavior as a function of the…
We consider a particle undergoing diffusion with stochastic resetting in a bounded domain $\calU\subset \R^d$ for $d=2,3$. The domain is perforated by a set of partially absorbing targets within which the particle may be absorbed at a rate…
Stochastic resetting has emerged as a useful strategy to reduce the completion time for a broad class of first passage processes. In the canonical setup, one intermittently resets a given system to its initial configuration only to start…
We consider the mean time to absorption by an absorbing target of a diffusive particle with the addition of a process whereby the particle is reset to its initial position with rate $r$. We consider several generalisations of the model of…
The first passage search of a diffusing target (prey) by multiple searchers (predators) in confinement is an important problem in the stochastic process literature. While the analogous problem in open space has been studied in some details,…
In this paper we consider the diffusive search for a bounded target $\Omega \in \R^d$ with its boundary $\partial \Omega$ totally absorbing. We assume that the target is surrounded by a semipermeable interface given by the closed surface…
Resetting has been shown to reduce the completion time for a stochastic process, such as the first passage time for a diffusive searcher to find a target. The time between two consecutive resetting events is drawn from a waiting time…