Language:   Search:   Contact
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

Query:
Fill in the form and click »Search«...
Format:
Display: entries per page entries
Zbl 0623.60089
Gibson, Diana; Seneta, E.
Monotone infinite stochastic matrices and their augmented truncations.
(English)
[J] Stochastic Processes Appl. 24, 287-292 (1987). ISSN 0304-4149

Let $P=[P(i,j)]$ be a stochastic matrix indexed by the set of positive integers, assumed irreducible and positive recurrent, and let $\pi$ be the unique P-invariant probability distribution. For each n, let $P\sb n$ be the restriction of P to $\{$ 1,...,n$\}\times \{1,...,n\}$, let $\tilde P\sb n$ be any $n\times n$ stochastic matrix such that $\tilde P\sb n\ge P\sb n$ (elementwise), and let $\pi\sb n$ be any invariant distribution for $\tilde P\sb n$. It was known previously [the second author, Linear Algebra Appl. 34, 259-267 (1980; Zbl 0484.65086)] that $\pi\sb n\to \pi$ if and only if $\pi\sb n$ is tight. \par In this paper, the authors show that tightness holds provided P is stochastically monotone; that is, if whenever $i<k$, the probability distribution P(i,$\cdot)$ is stochastically less than P(k,$\cdot)$, in the sense that $\sum\sp{\ell}\sb{j=1}P(i,j)\ge \sum\sp{\ell}\sb{j=1}P(k,j)$ for every $\ell$.
[A.F.Karr]
MSC 2000:
*60J10 Markov chains with discrete parameter
15A51 Stochastic matrices

Keywords: stochastic matrix; irreducible and positive recurrent; tightness; stochastically monotone

Citations: Zbl 0484.65086

Highlights
Master Server