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

A note on summability of ladder heights and the distributions of ladder epochs for random walks

Author

Listed:
  • Uchiyama, Kôhei

Abstract

This paper concerns a recurrent random walk on the real line and obtains a purely analytic result concerning the characteristic function, which is useful for dealing with some problems of probabilistic interest for the walk of infinite variance: it reduces them to the case when the increment variable X takes only values from {...,-2,-1,0,1}. Under the finite expectation of ascending ladder height of the walk, it is shown that given a constant 1 [infinity]) if and only if , where is a de Bruijn [alpha]-conjugate of L and T denotes the first epoch when the walk hits (-[infinity],0]. Analogous results are obtained in the cases [alpha]=1 or 2. The method also provides another derivation of Chow's integrability criterion for the expectation of the ladder height to be finite.

Suggested Citation

  • Uchiyama, Kôhei, 2011. "A note on summability of ladder heights and the distributions of ladder epochs for random walks," Stochastic Processes and their Applications, Elsevier, vol. 121(9), pages 1938-1961, September.
    • Handle: RePEc:eee:spapps:v:121:y:2011:i:9:p:1938-1961
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304414911000998
    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. Doney, R. A., 1982. "On the exact asymptotic behaviour of the distribution of ladder epochs," Stochastic Processes and their Applications, Elsevier, vol. 12(2), pages 203-214, March.
    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. Gerold Alsmeyer & Alexander Iksanov & Matthias Meiners, 2015. "Power and Exponential Moments of the Number of Visits and Related Quantities for Perturbed Random Walks," Journal of Theoretical Probability, Springer, vol. 28(1), pages 1-40, March.
    2. 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.

    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.

      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:121:y:2011:i:9:p:1938-1961. 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.