Related papers: Occupation times on a comb with ramified teeth
The paper considers excited random walks (ERWs) on integers in i.i.d. environments with a bounded number of excitations per site. The emphasis is primarily on the critical case for the transition between recurrence and transience which…
Random walks with memory typically involve rules where a preference for either revisiting or avoiding those sites visited in the past are introduced somehow. Such effects have a direct consequence on the statistics of first-passage and…
In practice, wireless networks are deployed over finite domains, the level of mobility is different at different locations, and user mobility is correlated over time. All these features have an impact on the temporal properties of…
We consider networks where each node represents a server with a queue. An active node deactivates at unit rate. An inactive node activates at a rate that depends on its queue length, provided none of its neighbors is active. For complete…
We consider a system of $N$ non-crossing Brownian particles in one dimension. We find the exact rate function that describes the long-time large deviation statistics of their occupation fraction in a finite interval in space. Remarkably, we…
We apply Doeblin's ergodicity coefficient as a computational tool to approximate the occupancy distribution of a set of states in a homogeneous but possibly non-stationary finite Markov chain. Our approximation is based on new properties…
Under certain circumstances, the time behavior of a random walk is modulated by logarithmic periodic oscillations. The goal of this paper is to present a simple and pedagogical explanation of the origin of this modulation for diffusion on a…
We analyze a one-dimensional intermittent random walk on an unbounded domain in the presence of stochastic resetting. In this process, the walker alternates between local intensive search, diffusion, and rapid ballistic relocations in which…
We study the asymptotic behavior of a multidimensional random walk in a general cone. We find the tail asymptotics for the exit time and prove integral and local limit theorems for a random walk conditioned to stay in a cone. The main step…
We prove that the mixing time of driven-dissipative activated random walk on an interval of length $n$ with uniform or central driving exhibits cutoff at $n$ times the critical density for activated random walk on the integers. The proof…
Applying the new tools developed in [G1], we investigate the arcsine aging regime of the random hopping time dynamics of the REM. Our results are optimal in several ways. They cover the full time-scale and temperature domain where this…
We develop an Onsager-Machlup-type theory for nonequilibrium semi-Markov processes. Our main result is an exact large time asymptotics for the joint probability of the occupation times and the currents in the system, establishing some…
In this paper, we are concerned with the long-range voter model on lattices. We prove a stationary fluctuation theorem for the occupation time of the model under a proper time-space scaling. In several cases, the fluctuation limits are…
We investigate the statistics of the local time $\mathcal{T} = \int_0^T \delta(x(t)) dt$ that a run and tumble particle (RTP) $x(t)$ in one dimension spends at the origin, with or without an external drift. By relating the local time to the…
We study a discrete time self interacting random process on graphs, which we call Greedy Random Walk. The walker is located initially at some vertex. As time evolves, each vertex maintains the set of adjacent edges touching it that have not…
This paper deals with a theoretical mathematical analysis of a one-dimensional-moving-boundary problem for the time-fractional diffusion equation, where the time-fractional derivative of order $\al$ $\in (0,1)$ is taken in the Caputo's…
We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…
Recently, random walks on dynamic graphs have been studied because of their adaptivity to the time-varying structure of real-world networks. In general, there is a tremendous gap between static and dynamic graph settings for the lazy simple…
This paper collects facts about the number of occupied boxes in the classical balls-in-boxes occupancy scheme with infinitely many positive frequencies: equivalently, about the number of species represented in samples from populations with…
We consider continuous-time random walk models described by arbitrary sojourn time probability density functions. We find a general expression for the distribution of time-averaged observables for such systems, generalizing some recent…