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

A sharp bound on the expected number of upcrossings of an L2-bounded Martingale

Author

Listed:
  • Gilat, David
  • Meilijson, Isaac
  • Sacerdote, Laura

Abstract

For a martingale M starting at x with final variance σ2, and an interval (a,b), let Δ=b−aσ be the normalized length of the interval and let δ=|x−a|σ be the normalized distance from the initial point to the lower endpoint of the interval. The expected number of upcrossings of (a,b) by M is at most 1+δ2−δ2Δ if Δ2≤1+δ2 and at most 11+(Δ+δ)2 otherwise. Both bounds are sharp, attained by Standard Brownian Motion stopped at appropriate stopping times. Both bounds also attain the Doob upper bound on the expected number of upcrossings of (a,b) for submartingales with the corresponding final distribution. Each of these two bounds is at most σ2(b−a), with equality in the first bound for δ=0. The upper bound σ2 on the length covered by M during upcrossings of an interval restricts the possible variability of a martingale in terms of its final variance. This is in the same spirit as the Dubins & Schwarz sharp upper bound σ on the expected maximum of M above x, the Dubins & Schwarz sharp upper bound σ2 on the expected maximal distance of M from x, and the Dubins, Gilat & Meilijson sharp upper bound σ3 on the expected diameter of M.

Suggested Citation

  • Gilat, David & Meilijson, Isaac & Sacerdote, Laura, 2018. "A sharp bound on the expected number of upcrossings of an L2-bounded Martingale," Stochastic Processes and their Applications, Elsevier, vol. 128(6), pages 1849-1856.
  • Handle: RePEc:eee:spapps:v:128:y:2018:i:6:p:1849-1856
    DOI: 10.1016/j.spa.2017.08.012
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.spa.2017.08.012?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. David Gilat & Isaac Meilijson & Laura Sacerdote, 2022. "A note on the maximal expected local time of $${\text {L}}_2$$ L 2 -bounded martingales," Journal of Theoretical Probability, Springer, vol. 35(3), pages 1952-1955, September.

    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:128:y:2018:i:6:p:1849-1856. 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.