IDEAS home Printed from https://ideas.repec.org/a/spr/jotpro/v14y2001i3d10.1023_a1017505509361.html
   My bibliography  Save this article

Bounding the Maximal Height of a Diffusion by the Time Elapsed

Author

Listed:
  • Goran Peskir

    (University of Aarhus
    University of Zagreb)

Abstract

Let X=(X t ) t≥0 be a one-dimensional time-homogeneous diffusion process associated with the infinitesimal generator $$\mathbb{L}_X = \mu (x)\frac{\partial }{{\partial x}} + \frac{{\sigma ^2 (x)}}{2}\frac{{\partial ^2 }}{{\partial x^2 }}$$ where x↦μ(x) and x↦σ(x)>0 are continuous. We show how the question of finding a function x↦H(x) such that $$c_1 E(H(\tau )) \leqslant E(\mathop {\max }\limits_{0 \leqslant {\text{t}} \leqslant \tau } \left| {X_t } \right|) \leqslant c_2 E(H(\tau ))$$ holds for all stopping times τ of X relates to solutions of the equation: $$\mathbb{L}_X (F) = 1$$ Explicit expressions for H are derived in terms of μ and σ. The method of proof relies upon a domination principle established by Lenglart and Itô calculus.

Suggested Citation

  • Goran Peskir, 2001. "Bounding the Maximal Height of a Diffusion by the Time Elapsed," Journal of Theoretical Probability, Springer, vol. 14(3), pages 845-855, July.
  • Handle: RePEc:spr:jotpro:v:14:y:2001:i:3:d:10.1023_a:1017505509361
    DOI: 10.1023/A:1017505509361
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1017505509361
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1023/A:1017505509361?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.

    Citations

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


    Cited by:

    1. Michael J. Klass & Ming Yang, 2012. "Maximal Inequalities for Additive Processes," Journal of Theoretical Probability, Springer, vol. 25(4), pages 981-1012, December.
    2. Chen Jia, 2019. "Sharp Moderate Maximal Inequalities for Upward Skip-Free Markov Chains," Journal of Theoretical Probability, Springer, vol. 32(3), pages 1382-1398, September.
    3. Xian Chen & Yong Chen & Yumin Cheng & Chen Jia, 2024. "Moderate and $$L^p$$ L p Maximal Inequalities for Diffusion Processes and Conformal Martingales," Journal of Theoretical Probability, Springer, vol. 37(4), pages 2990-3014, November.

    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:14:y:2001:i:3:d:10.1023_a:1017505509361. 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: 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.