Hostname: page-component-7b7567c8c-jswmv Total loading time: 0 Render date: 2026-11-15T22:36:53.052Z Has data issue: false hasContentIssue false

Superposition of Interacting Aggregated Continuous-Time Markov Chains

Published online by Cambridge University Press:  01 July 2016

Frank Ball*
Affiliation:
The University of Nottingham
Robin K. Milne*
Affiliation:
The University of Western Australia
Ian D. Tame*
Affiliation:
The University of Nottingham
Geoffrey F. Yeo*
Affiliation:
Murdoch University
*
∗ Postal address: Department of Mathematics, The University of Nottingham, Nottingham, NG7 2RD, UK. E-mail address: fgb@maths.nott.ac.uk
∗∗ Postal address: Department of Mathematics, The University of Western Australia, Nedlands, 6907, Australia. E-mail address: milne@maths.uwa.edu.au
∗∗∗ Postal address: Area of Humanities and Science, Bridgwater College, Bath Road, Bridgwater, Somerset, TA6 4PZ, UK.
∗∗∗∗ Postal address: School of Physical Sciences, Engineering and Technology, Murdoch University, Murdoch, 6150, Australia. E-mail address: yeo@prodigal.murdoch.edu.au

Abstract

Consider a system of interacting finite Markov chains in continuous time, where each subsystem is aggregated by a common partitioning of the state space. The interaction is assumed to arise from dependence of some of the transition rates for a given subsystem at a specified time on the states of the other subsystems at that time. With two subsystem classes, labelled 0 and 1, the superposition process arising from a system counts the number of subsystems in the latter class. Key structure and results from the theory of aggregated Markov processes are summarized. These are then applied also to superposition processes. In particular, we consider invariant distributions for the level m entry process, marginal and joint distributions for sojourn-times of the superposition process at its various levels, and moments and correlation functions associated with these distributions. The distributions are obtained mainly by using matrix methods, though an approach based on point process methods and conditional probability arguments is outlined. Conditions under which an interacting aggregated Markov chain is reversible are established. The ideas are illustrated with simple examples for which numerical results are obtained using Matlab. Motivation for this study has come from stochastic modelling of the behaviour of ion channels; another application is in reliability modelling.

Information

Type
General Applied Probability
Copyright
Copyright © Applied Probability Trust 1997 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable