Occupation time of a renewal process coupled to a discrete Markov chain

Abstract

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 time of a two-state Markov process. We provide an explicit expression in Laplace space for the distribution of an arbitrary linear combination of the occupation times in the various states of the process. We discuss several consequences of this result. In particular, we infer the limiting distribution of this quantity rescaled by time in the long-time scaling regime, as well as the finite-time corrections to its moments.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…