Related papers: On the telegraph process driven by geometric count…
We combine the processes of resetting and first-passage to define \emph{first-passage resetting}, where the resetting of a random walk to a fixed position is triggered by a first-passage event of the walk itself. In an infinite domain,…
Consider a stationary Poisson point process in $\mathbb{R}^d$ and connect any two points whenever their distance is less than or equal to a prescribed distance parameter. This construction gives rise to the well known random geometric…
First passage in a stochastic process may be influenced by the presence of an external confining potential, as well as "stochastic resetting" in which the process is repeatedly reset back to its initial position. Here we study the interplay…
We consider a random walker on a ring, subjected to resetting at Poisson-distributed times to the initial position (the walker takes the shortest path along the ring to the initial position at resetting times). In the case of a Brownian…
This paper presents a diffusion process with a novel resetting mechanism in which the amplitude of the process is instantaneously converted to a proportion of its value at random times. This model is described by a Langevin equation with…
A new model of search based on stochastic resetting is introduced, wherein rate of resets depends explicitly on time elapsed since the beginning of the process. It is shown that rate inversely proportional to time leads to paradoxical…
Consider two independent Goldstein-Kac telegraph processes $X_1(t)$ and $X_2(t)$ on the real line $\Bbb R$. The processes $X_k(t), \; k=1,2,$ are performed by stochastic motions at finite constant velocities $c_1>0, \; c_2>0,$ that start at…
We consider a discrete-time Markovian random walk with resets on a connected undirected network. The resets, in which the walker is relocated to randomly chosen nodes, are governed by an independent discrete-time renewal process. Some nodes…
Diffusion with stochastic resetting is a paradigm of resetting processes. Standard renewal or master equation approach are typically used to study steady state and other transport properties such as average, mean squared displacement etc.…
During a random search, resetting the searcher's position from time to time to the starting point often reduces the mean completion time of the process. Although many different resetting models have been studied over the past ten years,…
We discuss a non-equilibrium statistical system on a graph or network. Identical particles are injected, interact with each other, traverse, and leave the graph in a stochastic manner described in terms of Poisson rates, possibly dependent…
Linear response theory lies at the foundation of transport phenomena, predicting that physical systems respond proportionally to weak external forces. Here we show that this principle can break down in a minimal nonequilibrium setting due…
We consider the problem of the first passage time to the origin of a spatially non-homogeneous random walk with a position-dependent drift, known as the Gillis random walk, in the presence of resetting. The walk starts from an initial site…
Hypergraph has been selected as a powerful candidate for characterizing higher-order networks and has received increasing attention in recent years. In this article, we study random walks with resetting on hypergraph by utilizing spectral…
Stochastic systems that undergo random restarts to their initial state have been widely investigated in recent years, both theoretically and in experiments. Oftentimes, however, resetting to a fixed state is impossible due to thermal noise…
We study random walks with stochastic resetting to the initial position on arbitrary networks. We obtain the stationary probability distribution as well as the mean and global first passage times, which allow us to characterize the effect…
We study interacting particle systems on the real line which generalize the Hammersley process [D. Aldous and P. Diaconis, Prob. Theory Relat. Fields 103, 199-213 (1995)]. Particles jump to the right to a randomly chosen point between their…
The telegraph process $X(t)$, $t>0$, (Goldstein, 1951) and the geometric telegraph process $S(t) = s_0 \exp\{(\mu -\frac12\sigma^2)t + \sigma X(t)\}$ with $\mu$ a known constant and $\sigma>0$ a parameter are supposed to be observed at…
We consider a problem of estimation for the telegrapher's process on the line, say X(t), driven by a Poisson process with non constant rate. It turns out that the finite-dimensional law of the process X(t) is a solution to the telegraph…
Renewal processes are zero-dimensional processes defined by independent intervals of time between zero crossings of a random walker. We subject renewal processes them to stochastic resetting by setting the position of the random walker to…