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.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Recursive Relations for the Distribution of Waiting Times in a Markov Chain

Dragan Banjevic
Journal of Applied Probability
Vol. 33, No. 1 (Mar., 1996), pp. 48-56
DOI: 10.2307/3215263
Stable URL: http://www.jstor.org/stable/3215263
Page Count: 9
  • Read Online (Free)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Recursive Relations for the Distribution of Waiting Times in a Markov Chain
Preview not available

Abstract

A Markov chain is used as a model for a sequence of random experiments. The waiting time for sequence patterns is considered. Recursive-type relations for the distribution of waiting times are obtained.

Page Thumbnails

  • Thumbnail: Page 
48
    48
  • Thumbnail: Page 
49
    49
  • Thumbnail: Page 
50
    50
  • Thumbnail: Page 
51
    51
  • Thumbnail: Page 
52
    52
  • Thumbnail: Page 
53
    53
  • Thumbnail: Page 
54
    54
  • Thumbnail: Page 
55
    55
  • Thumbnail: Page 
56
    56