IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v194y2026ics0304414925002960.html

Optimal prediction of the last r-excursion time of Brownian motion models

Author

Listed:
  • Li, B.
  • Lkabous, M.A.
  • Pedraza, J.M.

Abstract

This paper investigates the optimal prediction of the last r-excursion time for a Brownian motion model. The last r-excursion time, denoted by lr, refers to the right endpoint of the last negative excursion lasting longer than a constant r > 0. It reduces to the standard last passage time when r↓0. For a Brownian motion with drift μ > 0 and volatility σ > 0, our goal is to identify an optimal stopping time that minimizes the (L1) distance from the last r-excursion time lr. We find that the optimal stopping barrier exhibits two distinct structures: a constant barrier (characterized as a solution of a non-linear equation) or a moving barrier (characterized by the unique solution to an integral equation) depending on the ratio R=μrσ which integrates a firm’s financial profitability, volatility, and risk tolerance to financial distress. To obtain the optimal stopping time, we examine the smooth fit condition, Lipschitz continuity of the barrier, and probability regularity of the boundary points. As an application in risk management, we develop a decision rule that informs the timing of business expansion and contraction.

Suggested Citation

  • Li, B. & Lkabous, M.A. & Pedraza, J.M., 2026. "Optimal prediction of the last r-excursion time of Brownian motion models," Stochastic Processes and their Applications, Elsevier, vol. 194(C).
  • Handle: RePEc:eee:spapps:v:194:y:2026:i:c:s0304414925002960
    DOI: 10.1016/j.spa.2025.104852
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.spa.2025.104852?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:194:y:2026:i:c:s0304414925002960. 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.