IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v62y1996i1p55-72.html
   My bibliography  Save this article

Markov chain convergence: From finite to infinite

Author

Listed:
  • Rosenthal, Jeffrey S.

Abstract

Bounds on convergence rates for Markov chains are a very widely-studied topic, motivated largely by applications to Markov chain Monte Carlo algorithms. For Markov chains on finite state spaces, previous authors have obtained a number of very useful bounds, including those which involve choices of paths. Unfortunately, many Markov chains which arise in practice are not finite. In this paper, we consider the extent to which bounds for finite Markov chains can be extended to infinite chains. Our results take two forms. For countably-infinite state spaces X, we consider the process of enlargements of Markov chains, namely considering Markov chains on finite state spaces X1,X2, ... whose union is X. Bounds for the Markov chains restricted to Xd, if uniform in d, immediately imply bounds on X. Results for finite Markov chains, involving choices of paths, can then be applied to countable chains. We develop these ideas and apply them to several examples of the Metropolis-Hastings algorithm on countable state spaces. For uncountable state spaces, we consider the process of refinements of Markov chains. Namely, we break the original state space X into countable numbers of smaller and smaller pieces, and define a Markov chain on these finite pieces which approximates the original chain. Under certain continuity assumptions, bounds on the countable Markov chains, including those related to choices of paths, will imply bounds on the original chain. We develop these ideas and apply them to an example of an uncountable state space Metropolis algorithm.

Suggested Citation

  • Rosenthal, Jeffrey S., 1996. "Markov chain convergence: From finite to infinite," Stochastic Processes and their Applications, Elsevier, vol. 62(1), pages 55-72, March.
    • Handle: RePEc:eee:spapps:v:62:y:1996:i:1:p:55-72
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0304-4149(95)00082-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Amit, Y. & Grenander, U., 1991. "Comparing sweep strategies for stochastic relaxation," Journal of Multivariate Analysis, Elsevier, vol. 37(2), pages 197-222, May.
    2. Baxter, J. R. & Rosenthal, Jeffrey S., 1995. "Rates of convergence for everywhere-positive Markov chains," Statistics & Probability Letters, Elsevier, vol. 22(4), pages 333-338, March.
    3. Amit, Yali, 1991. "On rates of convergence of stochastic relaxation for Gaussian and non-Gaussian distributions," Journal of Multivariate Analysis, Elsevier, vol. 38(1), pages 82-99, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yuen, Wai Kong, 2000. "Applications of geometric bounds to the convergence rate of Markov chains on," Stochastic Processes and their Applications, Elsevier, vol. 87(1), pages 1-23, May.
    2. Hervé, Loïc & Ledoux, James, 2014. "Approximating Markov chains and V-geometric ergodicity via weak perturbation theory," Stochastic Processes and their Applications, Elsevier, vol. 124(1), pages 613-638.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yuen, Wai Kong, 2000. "Applications of geometric bounds to the convergence rate of Markov chains on," Stochastic Processes and their Applications, Elsevier, vol. 87(1), pages 1-23, May.
    2. Hwang, Chii-Ruey & Sheu, Shuenn-Jyi, 1998. "On the Geometrical Convergence of Gibbs Sampler inRd," Journal of Multivariate Analysis, Elsevier, vol. 66(1), pages 22-37, July.
    3. Lukka Tuomas J. & Kujala Janne V., 2002. "Using Genetic Operators to Speed up Markov Chain Monte Carlo Integration," Monte Carlo Methods and Applications, De Gruyter, vol. 8(1), pages 51-72, December.
    4. Mandel, Antoine & Veetil, Vipin P., 2021. "Monetary dynamics in a network economy," Journal of Economic Dynamics and Control, Elsevier, vol. 125(C).
    5. Claudio Asci, 2009. "Generating Uniform Random Vectors in Z p k : The General Case," Journal of Theoretical Probability, Springer, vol. 22(3), pages 791-809, September.
    6. Sairam Rayaprolu & Zhiyi Chi, 2021. "False Discovery Variance Reduction in Large Scale Simultaneous Hypothesis Tests," Methodology and Computing in Applied Probability, Springer, vol. 23(3), pages 711-733, September.
    7. Tervonen, Tommi & van Valkenhoef, Gert & Baştürk, Nalan & Postmus, Douwe, 2013. "Hit-And-Run enables efficient weight generation for simulation-based multiple criteria decision analysis," European Journal of Operational Research, Elsevier, vol. 224(3), pages 552-559.
    8. Roberto Leon-Gonzalez, "undated". "Data Augmentation in Limited-Dependent Variable Models," Discussion Papers 02/09, Department of Economics, University of York.
    9. Hernández-Lerma, Onésimo & Lasserre, Jean B., 1996. "Existence of bounded invariant probability densities for Markov chains," Statistics & Probability Letters, Elsevier, vol. 28(4), pages 359-366, August.
    10. Marcin Mider & Paul A. Jenkins & Murray Pollock & Gareth O. Roberts, 2022. "The Computational Cost of Blocking for Sampling Discretely Observed Diffusions," Methodology and Computing in Applied Probability, Springer, vol. 24(4), pages 3007-3027, December.
    11. Shephard, N. & Pitt, M.K., 1995. "Likelihood Analysis of Non-Gaussian Parameter-Driven Models," Economics Papers 108, Economics Group, Nuffield College, University of Oxford.
    12. Nielsen, Adam, 2016. "The Monte Carlo computation error of transition probabilities," Statistics & Probability Letters, Elsevier, vol. 118(C), pages 163-170.
    13. Levine, Richard A. & Casella, George, 2006. "Optimizing random scan Gibbs samplers," Journal of Multivariate Analysis, Elsevier, vol. 97(10), pages 2071-2100, November.
    14. Claudio Asci, 2001. "Generating Uniform Random Vectors," Journal of Theoretical Probability, Springer, vol. 14(2), pages 333-356, April.
    15. Anton Molyboha & Michael Zabarankin, 2011. "Optimization of steerable sensor network for threat detection," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(6), pages 564-577, September.

    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:eee:spapps:v:62:y:1996:i:1:p:55-72. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    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.