Aggregated Markov processes with negative exponential time interval omission

1990 ◽  
Vol 22 (04) ◽  
pp. 802-830 ◽  
Author(s):  
Frank Ball
Keyword(s):  
State Space ◽  
Continuous Time ◽  
Single Channel ◽  
The State ◽  
Time Interval ◽  
Continuous Time Markov Chain ◽  
Negative Exponential Distribution ◽  
Finite State ◽  
Negative Exponential ◽  
Finite State Space

We consider a time reversible, continuous time Markov chain on a finite state space. The state space is partitioned into two sets, termed open and closed, and it is only possible to observe whether the process is in an open or a closed state. Further, short sojourns in either the open or closed states fail to be detected. We consider the situation when the length of minimal detectable sojourns follows a negative exponential distribution with mean μ–1. We show that the probability density function of observed open sojourns takes the form , where n is the size of the state space. We present a thorough asymptotic analysis of f O(t) as μ tends to infinity. We discuss the relevance of our results to the modelling of single channel records. We illustrate the theory with a numerical example.

Aggregated Markov processes with negative exponential time interval omission

1990 ◽  
Vol 22 (4) ◽  
pp. 802-830 ◽  
Author(s):  
Frank Ball
Keyword(s):  
State Space ◽  
Continuous Time ◽  
Single Channel ◽  
The State ◽  
Time Interval ◽  
Continuous Time Markov Chain ◽  
Negative Exponential Distribution ◽  
Finite State ◽  
Negative Exponential ◽  
Finite State Space

We consider a time reversible, continuous time Markov chain on a finite state space. The state space is partitioned into two sets, termed open and closed, and it is only possible to observe whether the process is in an open or a closed state. Further, short sojourns in either the open or closed states fail to be detected. We consider the situation when the length of minimal detectable sojourns follows a negative exponential distribution with mean μ–1. We show that the probability density function of observed open sojourns takes the form , where n is the size of the state space. We present a thorough asymptotic analysis of fO(t) as μ tends to infinity. We discuss the relevance of our results to the modelling of single channel records. We illustrate the theory with a numerical example.

Rate modulation in dams and ruin problems

1996 ◽  
Vol 33 (2) ◽  
pp. 523-535 ◽  
Author(s):  
Søren Asmussen ◽  
Offer Kella
Keyword(s):  
State Space ◽  
Release Rate ◽  
Risk Process ◽  
The State ◽  
Limiting Distribution ◽  
Process Conditions ◽  
Explicit Formulas ◽  
Rate Modulation ◽  
Finite State ◽  
Finite State Space

We consider a dam in which the release rate depends both on the state and some modulating process. Conditions for the existence of a limiting distribution are established in terms of an associated risk process. The case where the release rate is a product of the state and the modulating process is given special attention, and in particular explicit formulas are obtained for a finite state space Markov modulation.

scholarly journals Conditioning an additive functional of a Markov chain to stay nonnegative. I. Survival for a long time

2005 ◽  
Vol 37 (4) ◽  
pp. 1015-1034 ◽  
Author(s):  
Saul D. Jacka ◽  
Zorana Lazic ◽  
Jon Warren
Keyword(s):  
Markov Chain ◽  
Weak Convergence ◽  
State Space ◽  
Continuous Time ◽  
Additive Functional ◽  
Finite State ◽  
Long Time ◽  
Negative Drift ◽  
Irreducible Markov Chain ◽  
Finite State Space

Let (Xt)t≥0 be a continuous-time irreducible Markov chain on a finite state space E, let v be a map v: E→ℝ\{0}, and let (φt)t≥0 be an additive functional defined by φt=∫0tv(Xs)d s. We consider the case in which the process (φt)t≥0 is oscillating and that in which (φt)t≥0 has a negative drift. In each of these cases, we condition the process (Xt,φt)t≥0 on the event that (φt)t≥0 is nonnegative until time T and prove weak convergence of the conditioned process as T→∞.

Clustering of Bursts of Openings in Markov and Semi-Markov Models of Single Channel Gating

1997 ◽  
Vol 29 (01) ◽  
pp. 92-113 ◽  
Author(s):  
Frank Ball ◽  
Sue Davies
Keyword(s):  
Markov Chain ◽  
Ion Channel ◽  
State Space ◽  
Continuous Time ◽  
Markov Models ◽  
Numerical Study ◽  
Channel Gating ◽  
Markov Renewal Process ◽  
Time Interval ◽  
Continuous Time Markov Chain

The gating mechanism of a single ion channel is usually modelled by a continuous-time Markov chain with a finite state space. The state space is partitioned into two classes, termed ‘open’ and ‘closed’, and it is possible to observe only which class the process is in. In many experiments channel openings occur in bursts. This can be modelled by partitioning the closed states further into ‘short-lived’ and ‘long-lived’ closed states, and defining a burst of openings to be a succession of open sojourns separated by closed sojourns that are entirely within the short-lived closed states. There is also evidence that bursts of openings are themselves grouped together into clusters. This clustering of bursts can be described by the ratio of the variance Var (N(t)) to the mean[N(t)] of the number of bursts of openings commencing in (0, t]. In this paper two methods of determining Var (N(t))/[N(t)] and limt→∝Var (N(t))/[N(t)] are developed, the first via an embedded Markov renewal process and the second via an augmented continuous-time Markov chain. The theory is illustrated by a numerical study of a molecular stochastic model of the nicotinic acetylcholine receptor. Extensions to semi-Markov models of ion channel gating and the incorporation of time interval omission are briefly discussed.

scholarly journals Similar States in Continuous-Time Markov Chains

2009 ◽  
Vol 46 (02) ◽  
pp. 497-506 ◽  
Author(s):  
V. B. Yap
Keyword(s):  
Markov Chains ◽  
Continuous Time ◽  
Transition Matrix ◽  
Base Substitution ◽  
Continuous Time Markov Chain ◽  
Rate Matrix ◽  
Dna Base ◽  
Substitution Models ◽  
Finite State ◽  
Finite State Space

In a homogeneous continuous-time Markov chain on a finite state space, two states that jump to every other state with the same rate are called similar. By partitioning states into similarity classes, the algebraic derivation of the transition matrix can be simplified, using hidden holding times and lumped Markov chains. When the rate matrix is reversible, the transition matrix is explicitly related in an intuitive way to that of the lumped chain. The theory provides a unified derivation for a whole range of useful DNA base substitution models, and a number of amino acid substitution models.

A method for approximating the probability functions of a Markov chain

1988 ◽  
Vol 25 (4) ◽  
pp. 808-814 ◽  
Author(s):  
Keith N. Crank
Keyword(s):  
Markov Chain ◽  
Differential Equations ◽  
Finite Number ◽  
Continuous Time ◽  
Finite Time ◽  
The State ◽  
Time Interval ◽  
Continuous Time Markov Chain ◽  
Finite Time Interval ◽  
System Of Differential Equations

This paper presents a method of approximating the state probabilities for a continuous-time Markov chain. This is done by constructing a right-shift process and then solving the Kolmogorov system of differential equations recursively. By solving a finite number of the differential equations, it is possible to obtain the state probabilities to any degree of accuracy over any finite time interval.

Aggregated Markov processes incorporating time interval omission

1988 ◽  
Vol 20 (03) ◽  
pp. 546-572 ◽  
Author(s):  
Frank Ball ◽  
Mark Sansom
Keyword(s):  
State Space ◽  
Renewal Process ◽  
Numerical Study ◽  
Markov Renewal Process ◽  
Time Interval ◽  
Closed Sets ◽  
Finite State ◽  
Dynamic Stochastic ◽  
Stochastic Properties ◽  
Finite State Space

We consider a finite-state-space, continuous-time Markov chain which is time reversible. The state space is partitioned into two sets, termed ‘open' and ‘closed', and it is only possible to observe which set the process is in. Further, short sojourns in either the open or closed sets of states will fail to be detected. We show that the dynamic stochastic properties of the observed process are completely described by an embedded Markov renewal process. The parameters of this Markov renewal process are obtained, allowing us to derive expressions for the moments and autocorrelation functions of successive sojourns in both the open and closed states. We illustrate the theory with a numerical study.

Aggregated semi-Markov processes incorporating time interval omission

1991 ◽  
Vol 23 (04) ◽  
pp. 772-797 ◽  
Author(s):  
Frank Ball ◽  
Robin K. Milne ◽  
Geoffrey F. Yeo
Keyword(s):  
Renewal Process ◽  
Stochastic Modelling ◽  
Complete Information ◽  
Markov Renewal Process ◽  
Time Interval ◽  
Continuous Time Markov Chain ◽  
Finite State ◽  
Semi Markov Process ◽  
Semi Markov Processes ◽  
Finite State Space

We consider a semi-Markov process with finite state space, partitioned into two classes termed ‘open' and ‘closed'. It is possible to observe only which class the process is in. We show that complete information concerning the aggregated process is contained in an embedded Markov renewal process, whose parameters, moments and equilibrium behaviour are determined. Such processes have found considerable application in stochastic modelling of single ion channels. In that setting there is time interval omission, i.e. brief sojourns in either class failed to be detected. Complete information on the aggregated process incorporating time interval omission is contained in a Markov renewal process, whose properties are derived, obtained from the above Markov renewal process by a further embedding. The embedded Markov renewal framework is natural, and its invariance to time interval omission leads to considerable economy in the derivation of properties of the observed process. The results are specialised to the case when the underlying process is a continuous-time Markov chain.

A storage model in which the net growth-rate is a Markov chain

1972 ◽  
Vol 9 (01) ◽  
pp. 129-139 ◽  
Author(s):  
P. J. Brockwell
Keyword(s):  
Markov Chain ◽  
Continuous Time ◽  
Rate Of Change ◽  
Continuous Time Markov Chain ◽  
Finite Capacity ◽  
Storage Model ◽  
Finite State ◽  
Net Growth Rate ◽  
The Times ◽  
Finite State Space

The distribution of the times to first emptiness and first overflow, together with the limiting distribution of content are determined for a dam of finite capacity. It is assumed that the rate of change of the level of the dam is a continuous-time Markov chain with finite state-space (suitably modified when the dam is full or empty).

Sign in / Sign up

Export Citation Format

Share Document