IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v206y2024ics0167715223002171.html
   My bibliography  Save this article

On Stein’s method for stochastically monotone single-birth chains

Author

Listed:
  • Daly, Fraser

Abstract

We discuss Stein’s method for approximation by the stationary distribution of a single-birth Markov chain, in conjunction with stochastic monotonicity and similar assumptions. We use bounds on the increments of the solution of Poisson’s equation for such a process. Applications include rates of convergence to stationarity, and bounding the total variation distance between the stationary distributions of two Markov chains in the case where one transition matrix dominates the other.

Suggested Citation

  • Daly, Fraser, 2024. "On Stein’s method for stochastically monotone single-birth chains," Statistics & Probability Letters, Elsevier, vol. 206(C).
  • Handle: RePEc:eee:stapro:v:206:y:2024:i:c:s0167715223002171
    DOI: 10.1016/j.spl.2023.109993
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167715223002171
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.spl.2023.109993?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Jiang, Shuxia & Liu, Yuanyuan & Yao, Shuai, 2014. "Poisson’s equation for discrete-time single-birth processes," Statistics & Probability Letters, Elsevier, vol. 85(C), pages 78-83.
    2. Robert B. Lund & Richard L. Tweedie, 1996. "Geometric Convergence Rates for Stochastically Ordered Markov Chains," Mathematics of Operations Research, INFORMS, vol. 21(1), pages 182-194, February.
    Full references (including those not matched with items on IDEAS)

    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. Gareth O. Roberts & Jeffrey S. Rosenthal, 2019. "Hitting Time and Convergence Rate Bounds for Symmetric Langevin Diffusions," Methodology and Computing in Applied Probability, Springer, vol. 21(3), pages 921-929, September.
    2. Stoyanov, Jordan & Pirinsky, Christo, 2000. "Random motions, classes of ergodic Markov chains and beta distributions," Statistics & Probability Letters, Elsevier, vol. 50(3), pages 293-304, November.
    3. Roberts, G. O. & Tweedie, R. L., 1999. "Bounds on regeneration times and convergence rates for Markov chains," Stochastic Processes and their Applications, Elsevier, vol. 80(2), pages 211-229, April.
    4. Kam C. Yuen & Yuhua Lu & Rong Wu, 2009. "The compound Poisson process perturbed by a diffusion with a threshold dividend strategy," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 25(1), pages 73-93, January.
    5. Xi, Fubao & Yin, G., 2010. "Asymptotic properties of nonlinear autoregressive Markov processes with state-dependent switching," Journal of Multivariate Analysis, Elsevier, vol. 101(6), pages 1378-1389, July.
    6. 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.
    7. Liu, Jinpeng & Liu, Yuanyuan & Zhao, Yiqiang Q., 2022. "Augmented truncation approximations to the solution of Poisson’s equation for Markov chains," Applied Mathematics and Computation, Elsevier, vol. 414(C).
    8. Wenpin Tang, 2019. "Exponential ergodicity and convergence for generalized reflected Brownian motion," Queueing Systems: Theory and Applications, Springer, vol. 92(1), pages 83-101, June.

    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:stapro:v:206:y:2024:i:c:s0167715223002171. 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/622892/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.