Related papers: First-passage processes and the target-based accum…
Stochastic resets have lately emerged as a mechanism able to generate finite equilibrium mean square displacement (MSD) when they are applied to diffusive motion. Furthermore, walkers with an infinite mean first arrival time (MFAT) to a…
It is known that the heterogeneity of scale-free networks helps enhancing the efficiency of trapping processes performed on them. In this paper, we show that transport efficiency is much lower in a fractal scale-free network than in…
We consider a continuous-time random walk model with finite-mean waiting-times and we study the mean first-passage time (MFPT) as estimated by an observer in a reference frame $\mathcal{S}$, that is co-moving with a target, and by an…
We consider a run-and-tumble particle on a half-line with an absorbing target at the origin. The particle has an internal velocity state that switches between two opposite values at Poisson-distributed times. The position of the particle…
We consider a random walk in confined geometry, starting from a site and eventually reaching a target site. We calculate analytically the distribution of the occupation time on a third site, before reaching the target site. The obtained…
Random walks process on networks plays a fundamental role in understanding the importance of nodes and the similarity of them, which has been widely applied in PageRank, information retrieval, and community detection, etc. Individual's…
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…
We study the problem of a particle/message that travels as a biased random walk towards a target node in a network in the presence of traps. The bias is represented as the probability $p$ of the particle to travel along the shortest path to…
We present an analytical framework to study the first-passage (FP) and first-return (FR) distributions for the broad family of models described by the one-dimensional Fokker-Planck equation in finite domains, identifying general properties…
The explicit determinations of the mean first-passage time (MFPT) for trapping problem are limited to some simple structure, e.g., regular lattices and regular geometrical fractals, and determining MFPT for random walks on other media,…
Scarce data is a major challenge to scaling robot learning to truly complex tasks, as we need to generalize locally learned policies over different "contexts". Bayesian optimization approaches to contextual policy search (CPS) offer…
We investigate the first passage statistics of active continuous time random walks with Poissonian waiting time distribution on a one dimensional infinite lattice and a two dimensional infinite square lattice. We study the small and large…
The stochastic motion of particles in living cells is often spatially inhomogeneous with a higher effective diffusivity in a region close to the cell boundary due to active transport along actin filaments. As a first step to understand the…
In olfactory search an immobile target emits chemical molecules at constant rate. The molecules are transported by the medium which is assumed to be turbulent. Considering a searcher able to detect such chemical signals and whose motion…
In the random acceleration process, a point particle is accelerated according to $\ddot{x}=\eta(t)$, where the right hand side represents Gaussian white noise with zero mean. We begin with the case of a particle with initial position $x_0$…
In this paper, we analyze a shared access network with a fixed primary node and randomly distributed secondary nodes whose distribution follows a Poisson point process (PPP). The secondaries use a random access protocol allowing them to…
Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not…
Resource allocation takes place in various types of real-world complex systems such as urban traf- fic, social services institutions, economical and ecosystems. Mathematically, the dynamical process of complex resource allocation can be…
The first passage probability (FPP), of trafficked intracellular particles reaching a displacement L, in a given time t or inverse velocity S = t/L, can be calculated robustly from measured particle tracks, and gives a measure of particle…
Scarce data is a major challenge to scaling robot learning to truly complex tasks, as we need to generalize locally learned policies over different task contexts. Contextual policy search offers data-efficient learning and generalization by…