Simple derivations of properties of counting processes associated with Markov renewal processes

11Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

A simple, widely applicable method is described for determining factorial moments of Ň t, the number of occurrences in (0, t] of some event defined in terms of an underlying Markov renewal process, and asymptotic expressions for these moments as t → ∞. The factorial moment formulae combine to yield an expression for the probability generating function of N̂ t, and thereby further properties of such counts. The method is developed by considering counting processes associated with events that are determined by the states at two successive renewals of a Markov renewal process, for which it both simplifies and generalises existing results. More explicit results are given in the case of an underlying continuous-time Markov chain. The method is used to provide novel, probabilistically illuminating solutions to some problems arising in the stochastic modelling of ion channels. © Applied Probability Trust 2005.

Cite

CITATION STYLE

APA

Ball, F., & Milne, R. K. (2005). Simple derivations of properties of counting processes associated with Markov renewal processes. Journal of Applied Probability, 42(4), 1031–1043. https://doi.org/10.1239/jap/1134587814

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free