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

Coupling and Ergodic Theorems for Finite Markov Chains

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

Author

Listed:
  • Dmitrii Silvestrov

    (Stockholm University, Department of Mathematics)

Abstract

In Chap. 10.1007/978-3-031-89311-7_3 , the maximal coupling constructions are described for discrete-time, homogeneous Markov chains with finite state spaces. The main features of the coefficients of ergodicity, which play a key role in ergodic theorems with an exponential rate of convergence, are described, and ergodic relations for finite Markov chains with explicit exponential upper bounds for convergence rates are obtained using the coupling method. Relationships of coupling ergodic theorems for finite Markov chains with the Perron-Frobenius theorem are discussed. Also, modifications of the above coupling ergodic theorems for Markov chains with a general communicative structure of state spaces and ergodic theorems with explicit upper bounds for convergence rates for finite, discrete-time Markov chains with damping perturbed matrices of transition probabilities are given.

Suggested Citation

  • Dmitrii Silvestrov, 2025. "Coupling and Ergodic Theorems for Finite Markov Chains," Springer Books, in: Coupling and Ergodic Theorems for Semi-Markov-Type Processes I, chapter 0, pages 101-140, Springer.
    • Handle: RePEc:spr:sprchp:978-3-031-89311-7_3
    DOI: 10.1007/978-3-031-89311-7_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

    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-89311-7_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.