IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-031-89315-5_5.html
   My bibliography  Save this book chapter

Semi-Markov Processes with Discrete State Spaces and Embedded Regenerative Processes

In: Coupling and Ergodic Theorems for Semi-Markov-Type Processes II

Author

Listed:
  • Dmitrii Silvestrov

    (Stockholm University, Department of Mathematics)

Abstract

In Chap. 5 , we present ergodic theorems with explicit upper bounds for convergence rates for semi-Markov processes with discrete state spaces. Such processes are regenerative, and sequential return moments in any state are regeneration moments for them. We present necessary and sufficient conditions of finiteness and give upper bounds for power moments of return times supplemented by some solidarity assertions and necessary and sufficient conditions of finiteness and upper bounds exponential moments of return times using the method of test functions. Then, we obtain ergodic theorems with explicit power and exponential upper bounds for convergence rates for semi-Markov processes with discrete state spaces. Also, we present an example of semi-Markov versions of the Hastings-Metropolis MCMC algorithm and comment on a possible interpretation of the above ergodic theorems applied to the corresponding semi-Markov process as distributional semi-Markov versions of this algorithm.

Suggested Citation

  • Dmitrii Silvestrov, 2025. "Semi-Markov Processes with Discrete State Spaces and Embedded Regenerative Processes," Springer Books, in: Coupling and Ergodic Theorems for Semi-Markov-Type Processes II, chapter 0, pages 183-219, Springer.
    • Handle: RePEc:spr:sprchp:978-3-031-89315-5_5
    DOI: 10.1007/978-3-031-89315-5_5
    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

    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-3-031-89315-5_5. 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.