Related papers: On the telegraph process driven by geometric count…
We study the diffusive transport of Markovian random walks on arbitrary networks with stochastic resetting to multiple nodes. We deduce analytical expressions for the stationary occupation probability and for the mean and global first…
The planar symmetric Markov random flight $\bold X(t), \; t>0,$ is represented by the stochastic motion of a particle moving with constant finite speed $c>0$ in the Euclidean plane $\Bbb R^2$ and taking on its initial and each new…
We consider diffusion in arbitrary spatial dimension d with the addition of a resetting process wherein the diffusive particle stochastically resets to a fixed position at a constant rate $r$. We compute the non-equilibrium stationary state…
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…
We investigate a tight binding quantum walk on a graph. Repeated stroboscopic measurements of the position of the particle yield a measured "trajectory", and a combination of classical and quantum mechanical properties for the walk are…
A telegraph process with an elastic barrier at the origin was studied in [5]; in particular the number of visits of the origin before the absorption is a geometric distributed random variable M. Some asymptotic results (large and moderate…
In recent years, it has been well-established that adding a restart mechanism can alter the firstpassage statistics of a stochastic processes in useful and interesting ways. Though different mecha-nisms have been investigated, we derive a…
We study a diffusion approximation for a model of stochastic motion of a particle in one spatial dimension. The velocity of the particle is constant but the direction of the motion undergoes random changes with a Poisson clock. Moreover,…
We study non-interacting Poissonian run-and-tumble particles (RTPs) in two dimensions whose velocity orientations are controlled by an arbitrary circular distribution $Q(\phi)$. RTP-type active transport has been reported to undergo…
The first hitting times of a stochastic process, i.e., the first time a process reaches a particular level, are of significant interest across various scientific disciplines, including biology, chemistry, and economics. We modify the…
We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…
For the emerging Internet of Things (IoT), one of the most critical problems is the real-time reconstruction of signals from a set of aged measurements. During the reconstruction, distortion occurs between the observed signal and the…
Resetting, in which a system is regularly returned to a given state after a fixed or random duration, has become a useful strategy to optimize the search performance of a system. While earlier theoretical frameworks focused on instantaneous…
Diffusion with stochastic resetting, instantaneous returns of a diffusing particle to a reference point, creates a stationary probability distribution. The paradigm is extended here to a doubly stochastic protocol in which the resetting…
Stochastic resetting breaks detailed balance and drives the formation of nonequilibrium steady states . Here, we consider a chain of diffusive processes $x_i(t)$ that interact unilaterally: at random time intervals, the process $x_n$…
We study the performance of random linear network coding for time division duplexing channels with Poisson arrivals. We model the system as a bulk-service queue with variable bulk size. A full characterization for random linear network…
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 paper we present the distribution of the maximum of the telegraph process in the cases where the initial velocity is positive or negative with an even and an odd number of velocity reversals. For the telegraph process with positive…
Resetting is a strategy for boosting the speed of a target-searching process. Since its introduction over a decade ago, most studies have been carried out under the assumption that resetting takes place instantaneously. However, due to its…
We consider a system of non-interacting particles on a line with initial positions distributed uniformly with density $\rho$ on the negative half-line. We consider two different models: (i) each particle performs independent Brownian motion…