Hostname: page-component-76d6cb85b7-ntvhh Total loading time: 0 Render date: 2026-07-25T08:43:31.345Z Has data issue: false hasContentIssue false

A Matrix Factorization Problem in the Theory of Random Variables Defined on a Finite Markov Chain

Published online by Cambridge University Press:  24 October 2008

H. D. Miller
Affiliation:
Statistical LaboratoryUniversity of Cambridge

Summary

Let {kr} (r = 0, 1, 2, …; 1 ≤ krh) be a positively regular, finite Markov chain with transition matrix P = (pjk). For each possible transition jk let gjk(x)(− ∞ ≤ x ≤ ∞) be a given distribution function. The sequence of random variables {ξr} is defined where ξr has the distribution gjk(x) if the rth transition takes the chain from state j to state k. It is supposed that each distribution gjk(x) admits a two-sided Laplace-Stieltjes transform in a real t-interval surrounding t = 0. Let P(t) denote the matrix {Pjkmjk(t)}. It is shown, using probability arguments, that IsP(t) admits a Wiener-Hopf type of factorization in two ways for suitable values of s where the plus-factors are non-singular, bounded and have regular elements in a right half of the complex t-plane and the minus-factors have similar properties in an overlapping left half-plane (Theorem 1).

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1962

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