IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-319-12442-1_11.html
   My bibliography  Save this book chapter

Approximation of a Random Process with Variable Smoothness

In: Mathematical Statistics and Limit Theorems

Author

Listed:
  • Enkelejd Hashorva

    (University of Lausanne, Actuarial Department, HEC Lausanne)

  • Mikhail Lifshits

    (St. Petersburg State University, Department of Mathematics and Mechanics
    Linköping university, MAI)

  • Oleg Seleznjev

    (Umeå University, Department of Mathematics and Mathematical Statistics)

Abstract

We consider the rate of piecewise constant approximation to a locally stationary process $$X(t),t\in [0,1]$$ X ( t ) , t ∈ [ 0 , 1 ] , having a variable smoothness index $$\alpha (t)$$ α ( t ) . Assuming that $$\alpha (\cdot )$$ α ( · ) attains its unique minimum at zero and satisfies $$ \alpha (t)=\alpha _0+b t^\gamma + \mathrm{o}(t^\gamma ) \quad \text{ as } t \rightarrow 0, $$ α ( t ) = α 0 + b t γ + o ( t γ ) as t → 0 , we propose a method for construction of observation points (composite dilated design) such that the integrated mean square error $$ \int _0^1 {\mathbb E}\{(X(t)-X_n(t))^2\} dt \sim \frac{K}{n^{\alpha _0}(\log n)^{(\alpha _0+1)/\gamma }} \qquad \text{ as } n\rightarrow \infty , $$ ∫ 0 1 E { ( X ( t ) - X n ( t ) ) 2 } d t ∼ K n α 0 ( log n ) ( α 0 + 1 ) / γ as n → ∞ , where a piecewise constant approximation $$X_n$$ X n is based on $$N(n)\sim n$$ N ( n ) ∼ n observations of $$X$$ X . Further, we prove that the suggested approximation rate is optimal, and then show how to find an optimal constant $$K$$ K .

Suggested Citation

  • Enkelejd Hashorva & Mikhail Lifshits & Oleg Seleznjev, 2015. "Approximation of a Random Process with Variable Smoothness," Springer Books, in: Marc Hallin & David M. Mason & Dietmar Pfeifer & Josef G. Steinebach (ed.), Mathematical Statistics and Limit Theorems, edition 127, pages 189-208, Springer.
  • Handle: RePEc:spr:sprchp:978-3-319-12442-1_11
    DOI: 10.1007/978-3-319-12442-1_11
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    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:spr:sprchp:978-3-319-12442-1_11. 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.