IDEAS home Printed from https://ideas.repec.org/a/bla/stanee/v68y2014i1p25-42.html
   My bibliography  Save this article

Limit theorems for reflected Ornstein–Uhlenbeck processes

Author

Listed:
  • Gang Huang
  • Michel Mandjes
  • Peter Spreij

Abstract

type="main"> This paper studies one-dimensional Ornstein–Uhlenbeck (OU) processes, with the distinguishing feature that they are reflected on a single boundary (put at level 0) or two boundaries (put at levels 0 and d > 0). In the literature, they are referred to as reflected OU (ROU) and doubly reflected OU (DROU), respectively. For both cases, we explicitly determine the decay rates of the (transient) probability to reach a given extreme level. The methodology relies on sample-path large deviations, so that we also identify the associated most likely paths. For DROU, we also consider the ‘idleness process’ L t and the ‘loss process’ U t , which are the minimal non-decreasing processes, which make the OU process remain ≥ 0 and ≤ d, respectively. We derive central limit theorems (CLTs) for U t and L t , using techniques from stochastic integration and the martingale CLT.

Suggested Citation

  • Gang Huang & Michel Mandjes & Peter Spreij, 2014. "Limit theorems for reflected Ornstein–Uhlenbeck processes," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 68(1), pages 25-42, February.
  • Handle: RePEc:bla:stanee:v:68:y:2014:i:1:p:25-42
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1111/stan.12021
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. Archil Gulisashvili, 2020. "Large deviation principles for stochastic volatility models with reflection and three faces of the Stein and Stein model," Papers 2006.15431, arXiv.org.
    2. Michel Mandjes & Peter Spreij, 2017. "A note on the central limit theorem for the idleness process in a one-sided reflected Ornstein–Uhlenbeck model," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 71(3), pages 225-235, August.
    3. Hui Jiang & Qingshan Yang, 2022. "Moderate Deviations for Drift Parameter Estimations in Reflected Ornstein–Uhlenbeck Process," Journal of Theoretical Probability, Springer, vol. 35(2), pages 1262-1283, June.

    More about this item

    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:bla:stanee:v:68:y:2014:i:1:p:25-42. 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: Wiley Content Delivery (email available below). General contact details of provider: http://www.blackwellpublishing.com/journal.asp?ref=0039-0402 .

    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.