Related papers: Occupation time distributions for the telegraph pr…
In this paper we study the joint distributions of the telegraph process and its maximum conditioned on the number of changes of direction and the initial velocity. We prove that in the case of positive starting velocity, a form of the…
We obtain the fluctuations for the occupation time of one-dimensional symmetric exclusion processes with speed change, where the transition rates (conductances) are driven by a general function W. The approach does not require sharp bounds…
Sticky Brownian motion on the real line can be obtained as a weak solution of a system of stochastic differential equations. We find the conditional distribution of the process given the driving Brownian motion, both at an independent…
A semi-Markov process is one that changes states in accordance with a Markov chain but takes a random amount of time between changes. We consider the generalisation to semi-Markov processes of the classical Lamperti law for the occupation…
We consider a particle diffusing along the links of a general graph possessing some absorbing vertices. The particle, with a spatially-dependent diffusion constant D(x) is subjected to a drift U(x) that is defined in every point of each…
Given a network of fixed size $n$ and an initial distribution of data, we derive sufficient connectivity conditions on a sequence of time-varying digraphs for (a) data collection and (b) data dissemination, within at most $(n-1)$…
The $(d,\alpha,\beta,\gamma)$-branching particle system consists of particles moving in $R^d$ according to a symmetric $\alpha$-stable L\'evy process $(0<\alpha\leq 2)$, splitting with a critical $(1+\beta)$-branching law $(0<\beta\leq 1)$,…
The occupation time of an age-dependent branching particle system in $\Rd$ is considered, where the initial population is a Poisson random field and the particles are subject to symmetric $\alpha$-stable migration, critical binary branching…
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…
We show analogs of the classical arcsine theorem for the occupation time of a random walk in $(-\infty,0)$ in the case of a small positive drift. To study the asymptotic behavior of the total time spent in $(-\infty,0)$ we consider…
We study the asymmetric one-dimensional telegraph process in the bounded domain. Lower boundary is absorbing and upper boundary is reflecting with delay. Point stays in the upper boundary until switch of regime occurs. We obtain the…
We present a systematic study of the statistics of the occupation time and related random variables for stochastic processes with independent intervals of time. According to the nature of the distribution of time intervals, the probability…
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…
For a given homogeneous Poisson point process in $\mathbb{R}^d$ two points are connected by an edge if their distance is bounded by a prescribed distance parameter. The behaviour of the resulting random graph, the Gilbert graph or random…
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 classical and extended occupancy distributions are useful for examining the number of occupied bins in problems involving random allocation of balls to bins. We examine the extended occupancy problem by framing it as a Markov chain and…
We study normal approximations for a class of discrete-time occupancy processes, namely, Markov chains with transition kernels of product Bernoulli form. This class encompasses numerous models which appear in the complex networks…
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…
In the random acceleration process a point particle moving in one dimension is accelerated by Gaussian white noise with zero mean. Although several fundamental statistical properties of the motion have been analyzed in detail, the…
This paper considers a GI/GI/1 processor sharing queue in which jobs have soft deadlines. At each point in time, the collection of residual service times and deadlines is modeled using a random counting measure on the right half-plane. The…