IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-04344911.html
   My bibliography  Save this paper

Explicit Non-Asymptotic Bounds for the Distance to the First-Order Edgeworth Expansion
[Limites non asymptotiques explicites pour la distance à l'expansion de Edgeworth du premier ordre]

Author

Listed:
  • Alexis Derumigny

    (TU Delft - Delft University of Technology)

  • Lucas Girard

    (CREST - Centre de Recherche en Économie et Statistique - ENSAI - Ecole Nationale de la Statistique et de l'Analyse de l'Information [Bruz] - X - École polytechnique - IP Paris - Institut Polytechnique de Paris - ENSAE Paris - École Nationale de la Statistique et de l'Administration Économique - CNRS - Centre National de la Recherche Scientifique)

  • Yannick Guyonvarch

    (UMR PSAE - Paris-Saclay Applied Economics - AgroParisTech - Université Paris-Saclay - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement)

Abstract

In this article, we obtain explicit bounds on the uniform distance between the cumulative distribution function of a standardized sum S-n of n independent centered random variables with moments of order four and its first-order Edgeworth expansion. Those bounds are valid for any sample size with n(-1/)2 rate under moment conditions only and n(-1) rate under additional regularity constraints on the tail behavior of the characteristic function of Sn. In both cases, the bounds are further sharpened if the variables involved in Sn are unskewed. We also derive new Berry-Esseen-type bounds from our results and discuss their links with existing ones. Following these theoretical results, we discuss the practical use of our bounds, which depend on possibly unknown moments of the distribution of S-n. Finally, we apply our bounds to investigate several aspects of the non-asymptotic behavior of one-sided tests: informativeness, sufficient sample size in experimental design, distortions in terms of levels and p-values.

Suggested Citation

  • Alexis Derumigny & Lucas Girard & Yannick Guyonvarch, 2023. "Explicit Non-Asymptotic Bounds for the Distance to the First-Order Edgeworth Expansion [Limites non asymptotiques explicites pour la distance à l'expansion de Edgeworth du premier ordre]," Post-Print hal-04344911, HAL.
    • Handle: RePEc:hal:journl:hal-04344911
    DOI: 10.1007/s13171-023-00320-y
    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 search for a similarly titled item that would be available.

    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:hal:journl:hal-04344911. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.