Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Two Problems in Markov Chains: A Topological Approach

G. Guardabassi and S. Rinaldi
Operations Research
Vol. 18, No. 2 (Mar. - Apr., 1970), pp. 324-333
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/168690
Page Count: 10
  • Download ($30.00)
  • Cite this Item
Two Problems in Markov Chains: A Topological Approach
Preview not available

Abstract

This paper deals with two problems of asymptotic aggregation of an ergodic Markov chain. The first is concerned with the determination of an aggregated Markov chain, the asymptotic probabilities of which are just equal to conditional asymptotic probabilities defined on the original Markov chain. The second one relates to the determination of an aggregated chain, the asymptotic probabilities of which are equal to the asymptotic probabilities of the elements of a given state partition. Both problems are approached from a topological point of view and solutions are given in terms of signal-flow graph techniques. Comments about the main computational features of the method are also included.

Page Thumbnails

  • Thumbnail: Page 
324
    324
  • Thumbnail: Page 
325
    325
  • Thumbnail: Page 
326
    326
  • Thumbnail: Page 
327
    327
  • Thumbnail: Page 
328
    328
  • Thumbnail: Page 
329
    329
  • Thumbnail: Page 
330
    330
  • Thumbnail: Page 
331
    331
  • Thumbnail: Page 
332
    332
  • Thumbnail: Page 
333
    333