Related papers: Dominating occupancy processes by the independent …
Occupation times quantify how long a stochastic process remains in a region, and their single-time statistics are famously given by the arcsine law for Brownian and L\'evy processes. By contrast, two-time occupation statistics, which…
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…
The need to model a Markov renewal on-off process with multiple off-states arise in many applications such as economics, physics, and engineering. Characterization of the occupation time of one specific off-state marginally or two…
A discrete time branching process where the offspring distribution is generation-dependent, and the number of reproductive individuals is controlled by a random mechanism is considered. This model is a Markov chain but, in general, the…
The influence model is a discrete-time stochastic model that succinctly captures the interactions of a network of Markov chains. The model produces a reduced-order representation of the stochastic network, and can be used to describe and…
Occupancy mapping has been a key enabler of mobile robotics. Originally based on a discrete grid representation, occupancy mapping has evolved towards continuous representations that can predict the occupancy status at any location and…
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…
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 establish limit theorems for re-scaled occupation time fluctuations of a sequence of branching particle systems in $\R^d$ with anisotropic space motion and weakly degenerate splitting ability. In the case of large dimensions, our limit…
This work focuses on time-inhomogeneous Markov chains with two time scales. Our motivations stem from applications in reliability and dependability, queueing networks, financial engineering and manufacturing systems, where two-time-scale…
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…
Occupancy models are used in statistical ecology to estimate species dispersion. The two components of an occupancy model are the detection and occupancy probabilities, with the main interest being in the occupancy probabilities. We show…
Occupancy models involve both the probability a site is occupied and the probability occupancy is detected. The homogeneous occupancy model, where the occupancy and detection probabilities are the same at each site, admits an orthogonal…
An occupancy problem with an infinite number of bins and a random probability vector for the locations of the balls is considered. The respective sizes of bins are related to the split times of a Yule process. The asymptotic behavior of the…
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…
We present a new method of learning a continuous occupancy field for use in robot navigation. Occupancy grid maps, or variants of, are possibly the most widely used and accepted method of building a map of a robot's environment. Various…
Focusing on semiclassical systems, we show that the parametrically long exponential growth of out-of-time order correlators (OTOCs), also known as scrambling, does not necessitate chaos. Indeed, scrambling can simply result from the…
We consider the connections among `clumped' residual allocation models (RAMs), a general class of stick-breaking processes including Dirichlet processes, and the occupation laws of certain discrete space time-inhomogeneous Markov chains…
Consider a system of $K$ particles moving on the vertex set of a finite connected graph with at most one particle per vertex. If there is one, the particle at $x$ chooses one of the $\hbox{deg} (x)$ neighbors of its location uniformly at…
Consider $ m $ copies of an irreducible, aperiodic Markov chain $ Y $ taking values in a finite state space. The asymptotics as $ m $ tends to infinity, of the first time from which on the trajectories of the $ m $ copies differ, have been…