相关论文: Dynamic redundancy as a mechanism to optimize coll…
The statistics of first-passage times of random walks to target sites has proved to play a key role in determining the kinetics of space exploration in various contexts. In parallel, the number of distinct sites visited by a random walker…
We study a model of collective search by teams. Discoveries beget discoveries and correlated search results are governed by a Brownian path. Search results' variation at any point -- the search scope -- is jointly controlled. Agents…
In this paper, we deal with a size-variable group of pedestrians moving in a unknown confined environment and searching for an exit. Pedestrian dynamics are simulated by means of a recently introduced microscopic (agent-based) model,…
Let $a\in\mathbb{R}$ denote an unknown stationary target with a known distribution $\mu\in\mathcal{P(\mathbb{R}})$, the space of probability measures on $\mathbb{R}$. A diffusive searcher $X(\cdot)$ sets out from the origin to locate the…
We investigate the distribution of the time spent by a random walker to the right of a boundary moving with constant velocity v. For the continuous-time problem (Brownian motion), we provide a simple alternative proof of Newman's recent…
We introduce a general approach for the study of the collective dynamics of non-interacting random walkers on connected networks. We analyze the movement of $R$ independent (Markovian) walkers, each defined by its own transition matrix. By…
Brownian diffusion subject to stochastic resetting to a fixed position has been widely studied for applications to random search processes. In an unbounded domain, the mean first-passage time at a target site can be minimized for a…
Finding efficient algorithms to explore large networks with the aim of recovering information about their structure is an open problem. Here, we investigate this challenge by proposing a model in which random walkers with previously…
We investigate the effects of markovian resseting events on continuous time random walks where the waiting times and the jump lengths are random variables distributed according to power law probability density functions. We prove the…
In this paper, we investigate the problem of joint searching and tracking of multiple mobile targets by a group of mobile agents. The targets appear and disappear at random times inside a surveillance region and their positions are random…
Random walks describe diffusion processes, where movement at every time step is restricted to only the neighbouring locations. We construct a quantum random walk algorithm, based on discretisation of the Dirac evolution operator inspired by…
The kinetics of a variety of transport-controlled processes can be reduced to the problem of determining the mean time needed to arrive at a given location for the first time, the so called mean first passage time (MFPT) problem. The…
In this paper we present a computation of the mean first-passage times both for a random walk in a discrete bounded lattice, between a starting site and a target site, and for a Brownian motion in a bounded domain, where the target is a…
In this paper, we conduct a literature review of laws of motion based on stochastic search strategies which are mainly focused on exploring highly dynamic environments. In this regard, stochastic search strategies represent an interesting…
Redundancy in biology may be explained by the need to optimize extreme searching processes, where one or few among many particles are requested to reach the target like in human fertilization. We show that non-Gaussian rare fluctuations in…
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…
In this paper we study some aspects of search for an immobile target by a swarm of N non-communicating, randomly moving searchers (numbered by the index k, k = 1, 2,..., N), which all start their random motion simultaneously at the same…
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…
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…
We investigate exploration patterns of a microswimmer, modeled as an active Brownian particle, searching for a target region located in a well of an energy landscape and separated from the initial position of the particle by high barriers.…