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

On a first-passage problem for a cumulative process with exponential decay

Author

Listed:
  • Tsurui, Akira
  • Osaki, Shunji

Abstract

A first-passage problem for a cumulative process is investigated. The cumulative process is assumed to be generated by a Poisson process, and the amplitude generated by an event is assumed to decay exponentially. An integral equation for the probability density of the first-passage time until the total amplitude exceeds a pre-specified threshold level is derived. The Laplace transform of the probability density of the first-passage time is obtained explicity when each amplitude generated by an event is distributed exponentially. The mean first-passage times are given in a closed form and plotted versus the threshold level.

Suggested Citation

  • Tsurui, Akira & Osaki, Shunji, 1976. "On a first-passage problem for a cumulative process with exponential decay," Stochastic Processes and their Applications, Elsevier, vol. 4(1), pages 79-88, January.
    • Handle: RePEc:eee:spapps:v:4:y:1976:i:1:p:79-88
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0304-4149(76)90027-2
    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. Jacobsen, Martin & Jensen, Anders Tolver, 2007. "Exit times for a class of piecewise exponential Markov processes with two-sided jumps," Stochastic Processes and their Applications, Elsevier, vol. 117(9), pages 1330-1356, September.
    2. Alexander Novikov & R. E. Melchers & E. Shinjikashvili & N. Kordzakhia, 2003. "First Passage Time of Filtered Poisson Process with Exponential Shape Function," Research Paper Series 109, Quantitative Finance Research Centre, University of Technology, Sydney.
    3. Borovkov, Konstantin & Novikov, Alexander, 2008. "On exit times of Lévy-driven Ornstein-Uhlenbeck processes," Statistics & Probability Letters, Elsevier, vol. 78(12), pages 1517-1525, September.
    4. Zhou, Jiang & Wu, Lan & Bai, Yang, 2017. "Occupation times of Lévy-driven Ornstein–Uhlenbeck processes with two-sided exponential jumps and applications," Statistics & Probability Letters, Elsevier, vol. 125(C), pages 80-90.

    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:4:y:1976:i:1:p:79-88. 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.