IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v210y2024ics0167715224000798.html
   My bibliography  Save this article

On the rate of normal approximation for Poisson continuum percolation

Author

Listed:
  • Lo, Tiffany Y.Y.
  • Xia, Aihua

Abstract

It is known that the cardinality of the largest cluster of a percolating Poisson process restricted to a large finite box is asymptotically normal. In this note, we establish a rate of convergence for the statement. As each point in the largest cluster is determined by points as far as the diameter of the box, known results in the literature of normal approximation for Poisson functionals appear to be inapplicable. To disentangle the long-range dependence of the largest cluster, we use the fact that the second largest cluster has comparatively shorter range of dependence to restrict the range of dependence, apply a recent result of Chen et al. (2021) to obtain a Berry–Esseen type bound for the normal approximation of the number of points belonging to clusters that have a restricted range of dependence, and then estimate the gap between this quantity and the cardinality of the largest cluster.

Suggested Citation

  • Lo, Tiffany Y.Y. & Xia, Aihua, 2024. "On the rate of normal approximation for Poisson continuum percolation," Statistics & Probability Letters, Elsevier, vol. 210(C).
    • Handle: RePEc:eee:stapro:v:210:y:2024:i:c:s0167715224000798
    DOI: 10.1016/j.spl.2024.110110
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167715224000798
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.spl.2024.110110?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.

    References listed on IDEAS

    as
    1. Matthias Schulte, 2016. "Normal Approximation of Poisson Functionals in Kolmogorov Distance," Journal of Theoretical Probability, Springer, vol. 29(1), pages 96-117, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Betken, Carina & Hug, Daniel & Thäle, Christoph, 2023. "Intersections of Poisson k-flats in constant curvature spaces," Stochastic Processes and their Applications, Elsevier, vol. 165(C), pages 96-129.

    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:stapro:v:210:y:2024:i:c:s0167715224000798. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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/622892/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.