Related papers: Occupation time statistics for non-Markovian rando…

We consider the dynamics of lattice random walks with resetting. The walker moving randomly on a lattice of arbitrary dimensions resets at every time step to a given site with a constant probability $r$. We construct a discrete renewal…

We study the evolution of a random walker on a conservative dynamic random environment composed of independent particles performing simple symmetric random walks, generalizing results of [16] to higher dimensions and more general transition…

In this work we consider a stochastic movement process with random resets to the origin followed by a random residence time there before the walker restarts its motion. First, we study the transport properties of the walker, we derive an…

We consider a system of non-interacting Brownian particles on the line with steplike initial condition and study the statistics of the occupation time on the positive half-line. We demonstrate that this system exhibits long-lasting memory…

We study a general class of random walks driven by a uniquely ergodic Markovian environment. Under a coupling condition on the environment we obtain strong ergodicity properties for the environment as seen from the position of the walker,…

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…

Consider a critical nearest neighbor branching random walk on the $d$-dimensional integer lattice initiated by a single particle at the origin. Let $G_{n}$ be the event that the branching random walk survives to generation $n$. We obtain…

We study a model of multi-excited random walk on a regular tree which generalizes the models of the once excited random walk and the digging random walk introduced by Volkov (2003). We show the existence of a phase transition of the…

For the one-dimensional telegraph process, we obtain explicit distribution of the occupation time of the positive half-line. The long-term limiting distribution is then derived when the initial location of the process is in the range of…

We establish large deviation estimates related to the Darling--Kac theorem and generalized arcsine laws for occupation and waiting times of ergodic transformations preserving an infinite measure, such as non-uniformly expanding interval…

Lazy quantum walks were presented by Andrew M. Childs to prove that the continuous-time quantum walk is a limit of the discrete-time quantum walk [Commun.Math.Phys.294,581-603(2010)]. In this paper, we discuss properties of lazy quantum…

In this paper, we revisit the problem of classical \textit{meeting times} of random walks in graphs. In the process that two tokens (called agents) perform random walks on an undirected graph, the meeting times are defined as the expected…

We analyze time-discrete and continuous `fractional' random walks on undirected regular networks with special focus on cubic periodic lattices in $n=1,2,3,..$ dimensions. The fractional random walk dynamics is governed by a master equation…

The Donsker-Varadhan rate function for occupation-time fluctuations has been seen numerically to exhibit monotone return to stationary nonequilibrium [Phys. Rev. Lett. 107, 010601 (2011)]. That rate function is related to dynamical activity…

We address the theory of records for integrated random walks with finite variance. The long-time continuum limit of these walks is a non-Markov process known as the random acceleration process or the integral of Brownian motion. In this…

The model of a tired random walker, whose jump-length decays exponentially in time, is proposed and the motion of such a tired random walker is studied systematically in one, two and three dimensional contin- uum. In all cases, the…

In this work, we study the effect of a moving detector on a discrete time one dimensional Quantum Random Walk where the movement is realized in the form of hopping/shifts. The occupation probability $f(x,t;n,s)$ is estimated as the number…

We study a general class of random walks driven by a uniquely ergodic Markovian environment. Under a coupling condition on the environment we obtain strong ergodicity properties and concentration inequalities for the environment as seen…

We study discrete-time random walks on arbitrary networks with first-passage resetting processes. To the end, a set of nodes are chosen as observable nodes, and the walker is reset instantaneously to a given resetting node whenever it hits…

By appealing to renewal theory we determine the equations that the mean exit time of a continuous-time random walk with drift satisfies both when the present coincides with a jump instant or when it does not. Particular attention is paid to…