IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4613-8230-0_3.html
   My bibliography  Save this book chapter

Constructing the General Markov Chain

In: Approximating Countable Markov Chains

Author

Listed:
  • David Freedman

    (University of California, Department of Statistics)

Abstract

In this chapter, I will construct the general Markov chain with continuous time parameter, countable state space, and stationary standard transitions. Let I be the countable state space. Let I n be a sequence of finite subsets of I which swell to I. For each n, suppose X n is Markov with continuous time parameter, has stationary standard transition, and has right continuous I n -valued step functions for sample functions. Suppose that X n is the restriction of X n+1 to I n , for all n. Here is the necessary and sufficient condition for the existence of a process X whose restriction to each I n is X n . The sum of the lengths of the I2, I3, … -intervals occurring before X1-time t is finite. If X is chosen with moderate care, it is automatically Markov with stationary standard transitions and smooth sample functions. Sections 1.5–6 show this construction is general. I will only do the work when I forms one recurrent class; but it is quite easy to drop this condition.

Suggested Citation

  • David Freedman, 1983. "Constructing the General Markov Chain," Springer Books, in: Approximating Countable Markov Chains, chapter 3, pages 95-127, Springer.
  • Handle: RePEc:spr:sprchp:978-1-4613-8230-0_3
    DOI: 10.1007/978-1-4613-8230-0_3
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4613-8230-0_3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.