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

On the moments of certain first passage times for linear growth processes

Author

Listed:
  • Alsmeyer, Gerold

Abstract

Let be a stochastic process adapted to the filtration and with increments X1, X2, ... Set and Ln = m1 + ... + mn for n [greater-or-equal, slanted] 1. Then we call a linear growth process (LGP) if 1. (1) [mu] [less-than-or-equals, slant] Ln/n [less-than-or-equals, slant] [nu] a.s.f.a. n [greater-or-equal, slanted] n0 and2. (2) Ln/n --> [theta] a.s., as n --> [infinity] for suitable [mu], [nu], [theta] > 0 and some integer n0 [greater-or-equal, slanted] 1. In the case where (2) holds uniformly on a subevent of probability 1, is called a uniform linear growth process (ULGP), and if (1) and (2) are satisfied with Ln/n replaced by mn in (1), then is called a strong linear growth process (SLGP). For b [greater-or-equal, slanted] 0 and positive, continuous functions f on [0, [infinity]) we examine the first passage times [tau] = [tau] (b) = inffn [greater-or-equal, slanted] 1: Sn > b {(n)} as to existence of the moments of [tau] and S[tau] and related asymptotics. We will show that many results which are valid in the i.i.d. case carry over to LGP's under quite weak additional assumptions. In the case where is a SLGP and f(·) [triple bond; length as m-dash] 1, we will furthermore provide uniform integrability of the moments of the excess over the boundary S[tau] - b by renewal theoretic methods. This yields an expansion for E[tau] up to terms of order O(1), as b --> [infinity], when (Sn - n[theta])n[greater-or-equal, slanted]0 constitutes a martingale. In the final section the results will be applied to several examples from applied probability.

Suggested Citation

  • Alsmeyer, Gerold, 1987. "On the moments of certain first passage times for linear growth processes," Stochastic Processes and their Applications, Elsevier, vol. 25, pages 109-136.
  • Handle: RePEc:eee:spapps:v:25:y:1987:i::p:109-136
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0304-4149(87)90193-1
    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.

    Citations

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


    Cited by:

    1. S. Foss & A. Sapozhnikov, 2004. "On the Existence of Moments for the Busy Period in a Single-Server Queue," Mathematics of Operations Research, INFORMS, vol. 29(3), pages 592-601, August.

    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:25:y:1987:i::p:109-136. 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: 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.