IDEAS home Printed from https://ideas.repec.org/a/spr/jotpro/v34y2021i1d10.1007_s10959-019-00970-5.html
   My bibliography  Save this article

Limit Theorems for Random Walks with Absorption

Author

Listed:
  • Micha Buck

    (Technische Universitat Darmstadt)

Abstract

We introduce a class of absorption mechanisms and study the behavior of real-valued centered random walks with finite variance that do not get absorbed. Our main results serve as a toolkit which allows obtaining persistence and scaling limit results for many different examples in this class. Further, our results reveal new connections between results in Kemperman (The passage problem for a stationary Markov chain. Statistical research monographs, The University of Chicago Press, Chicago, 1961) and Vysotsky (Stoch Processes Appl 125(5):1886–1910, 2015).

Suggested Citation

  • Micha Buck, 2021. "Limit Theorems for Random Walks with Absorption," Journal of Theoretical Probability, Springer, vol. 34(1), pages 241-263, March.
    • Handle: RePEc:spr:jotpro:v:34:y:2021:i:1:d:10.1007_s10959-019-00970-5
    DOI: 10.1007/s10959-019-00970-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10959-019-00970-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10959-019-00970-5?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. Vysotsky, Vladislav, 2015. "Limit theorems for random walks that avoid bounded sets, with applications to the largest gap problem," Stochastic Processes and their Applications, Elsevier, vol. 125(5), pages 1886-1910.
    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. Uchiyama, Kôhei, 2019. "Asymptotically stable random walks of index 1<α<2 killed on a finite set," Stochastic Processes and their Applications, Elsevier, vol. 129(12), pages 5151-5199.
    2. Döring, Leif & Kyprianou, Andreas E. & Weissmann, Philip, 2020. "Stable processes conditioned to avoid an interval," Stochastic Processes and their Applications, Elsevier, vol. 130(2), pages 471-487.

    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:jotpro:v:34:y:2021:i:1:d:10.1007_s10959-019-00970-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.

    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: 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.