Related papers: Occupation times via Bessel functions
In this short communication we study a fluid queue with a finite buffer. The performance measure we are interested in is the occupation time over a finite time period, i.e., the fraction of time the workload process is below some fixed…
We investigate the distribution of occupation times for a particle undergoing a random walk among random energy traps and in the presence of a deterministic potential field $U^{{\rm det}}(x)$. When the distribution of energy traps is…
Our aim is to unify and extend the large deviation upper and lower bounds for the occupation times of a Markov process with $L_2$ semigroups under minimal conditions on the state space and the process trajectories; for example, no strong…
We derive the probability density function of the positive occupation time of one-dimensional Brownian motion with two-valued drift. Long time asymptotics of the density are also computed. We use the result to describe the transitional…
The consistency of the Aalen--Johansen-derived estimator of state occupation probabilities in non-Markov multi-state settings is studied and established via a new route. This new route is based on interval functions and relies on a close…
A class of Fleming-Viot processes with decaying sampling rates and $\alpha$-stable motions that correspond to distributions with growing populations are introduced and analyzed. Almost sure long-time scaling limits for these processes are…
We revisit the work of Dhar and Majumdar [Phys. Rev. E 59, 6413 (1999)] on the limiting distribution of the temporal mean $M_{t}=t^{-1}\int_{0}^{t}du \sign y_{u}$, for a Gaussian Markovian process $y_{t}$ depending on a parameter $\alpha $,…
In this paper we consider two related stochastic models. The first one is a branching system consisting of particles moving according to a Markov family in R^d and undergoing subcritical branching with a constant rate of V>0. New particles…
Occupancy processes are a broad class of discrete time Markov chains on $\{0,1\}^{n}$ encompassing models from diverse areas. This model is compared to a collection of $n$ independent Markov chains on $\{0,1\}$, which we call the…
We consider a branching system consisting of particles moving according to a Markov family in $\Rd$ and undergoing subcritical branching with a constant rate $V>0$. New particles immigrate to the system according to homogeneous space-time…
We study regenerative processes time-changed by state-dependent inverse subordinators. The construction assigns possibly different independent subordinators to measurable classes of excursions and builds a random clock from the…
This paper presents a set of results relating to the occupation time $\alpha(t)$ of a process $X(\cdot)$. The first set of results concerns exact characterizations of $\alpha(t)$ for $t\geq0$, e.g., in terms of its transform up to an…
We prove functional limits theorems for the occupation time process of a system of particles moving independently in $R^d$ according to a symmetric $\alpha$-stable L\'evy process, and starting off from an inhomogeneous Poisson point measure…
We propose the consistent statistical approach to consider a wide class of classical open systems whose states are specified by a set of positive integers(occupation numbers).Such systems are often encountered in physics, chemistry,…
The large time dynamics of a periodically driven Fokker-Planck process possessing several metastable states is investigated. At weak noise transitions between the metastable states are rare. Their dynamics then represent a discrete…
We investigate statistics of occupation times for an over-damped Brownian particle in an external force field. A backward Fokker-Planck equation introduced by Majumdar and Comtet describing the distribution of occupation times is solved.…
Markov processes restarted or reset at random times to a fixed state or region in space have been actively studied recently in connection with random searches, foraging, and population dynamics. Here we study the large deviations of…
This paper concerns discrete-time occupancy processes on a finite graph. Our results can be formulated in two theorems, which are stated for vertex processes, but also applied to edge process (e.g., dynamic random graphs). The first theorem…
This article studies the expected occupancy probabilities on an alphabet. Unlike the standard situation, where observations are assumed to be independent and identically distributed (iid), we assume that they follow a regime switching…
We consider particle systems in locally compact Abelian groups with particles moving according to a process with symmetric stationary independent increments and undergoing one and two levels of critical branching. We obtain long time…