Limiting second moments for transient states of Markov chains

1973 ◽  
Vol 10 (4) ◽  
pp. 891-894 ◽  
Author(s):  
H. P. Wynn

The set of transient states of a Markov chain is considered as a system. If numbers of arrivals to the system at discrete time points have constant mean and covariance matrix then there is a limiting distribution of numbers in the states. Necessary and sufficient conditions are given for this distribution to yield zero correlations between states.

1973 ◽  
Vol 10 (04) ◽  
pp. 891-894
Author(s):  
H. P. Wynn

The set of transient states of a Markov chain is considered as a system. If numbers of arrivals to the system at discrete time points have constant mean and covariance matrix then there is a limiting distribution of numbers in the states. Necessary and sufficient conditions are given for this distribution to yield zero correlations between states.


1978 ◽  
Vol 15 (4) ◽  
pp. 848-851 ◽  
Author(s):  
Jean-François Mertens ◽  
Ester Samuel-Cahn ◽  
Shmuel Zamir

For an aperiodic, irreducible Markov chain with the non-negative integers as state space it is shown that the existence of a solution to in which yi → ∞is necessary and sufficient for recurrence, and the existence of a bounded solution to the same inequalities, with yk < yo, · · ·, yN–1 for some k ≧ N, is necessary and sufficient for transience.


1978 ◽  
Vol 15 (04) ◽  
pp. 848-851 ◽  
Author(s):  
Jean-François Mertens ◽  
Ester Samuel-Cahn ◽  
Shmuel Zamir

For an aperiodic, irreducible Markov chain with the non-negative integers as state space it is shown that the existence of a solution to in which yi → ∞is necessary and sufficient for recurrence, and the existence of a bounded solution to the same inequalities, with yk &lt; y o, · · ·, yN –1 for some k ≧ N, is necessary and sufficient for transience.


1956 ◽  
Vol 9 (3) ◽  
pp. 387
Author(s):  
J Gani

The paper generalizes a proof, and outlines an alternative to it, for the well-known theorem on the conditions of regularity in a simple Markov chain; this is that the necessary and sufficient conditions for a chain to be regular are that the latent root 1 of the stochastic matrix for the chain must be simple, and the remaining roots have moduli less than 1.


2001 ◽  
Vol 33 (2) ◽  
pp. 505-519 ◽  
Author(s):  
James Ledoux ◽  
Laurent Truffet

In this paper, we obtain Markovian bounds on a function of a homogeneous discrete time Markov chain. For deriving such bounds, we use well-known results on stochastic majorization of Markov chains and the Rogers–Pitman lumpability criterion. The proposed method of comparison between functions of Markov chains is not equivalent to generalized coupling method of Markov chains, although we obtain same kind of majorization. We derive necessary and sufficient conditions for existence of our Markovian bounds. We also discuss the choice of the geometric invariant related to the lumpability condition that we use.


Author(s):  
Przemysław Przyborowski ◽  
Tadeusz Kaczorek

Positive 2D Discrete-Time Linear Lyapunov SystemsTwo models of positive 2D discrete-time linear Lyapunov systems are introduced. For both the models necessary and sufficient conditions for positivity, asymptotic stability, reachability and observability are established. The discussion is illustrated with numerical examples.


1985 ◽  
Vol 22 (01) ◽  
pp. 123-137 ◽  
Author(s):  
Hideo Ōsawa

This paper studies the reversibility conditions of stationary Markov chains (discrete-time Markov processes) with general state space. In particular, we investigate the Markov chains having atomic points in the state space. Such processes are often seen in storage models, for example waiting time in a queue, insurance risk reserve, dam content and so on. The necessary and sufficient conditions for reversibility of these processes are obtained. Further, we apply these conditions to some storage models and present some interesting results for single-server queues and a finite insurance risk model.


Sign in / Sign up

Export Citation Format

Share Document