IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v195y2026ics0304414926000141.html

On k-clusters of high-intensity random geometric graphs

Author

Listed:
  • Penrose, Mathew D.
  • Yang, Xiaochuan

Abstract

Let k, d be positive integers. We determine a sequence of constants that are asymptotic to the probability that the cluster at the origin in a d-dimensional Poisson Boolean model with balls of fixed radius is of order k, as the intensity becomes large. Using this, we determine the asymptotics of the mean of the number of components of order k, denoted Sn,k in a random geometric graph on n uniformly distributed vertices in a smoothly bounded compact region of d-dimensional Euclidean space, with distance parameter r(n) chosen so that the expected degree grows slowly as n becomes large (the so-called mildly dense limiting regime). We also show that the variance of Sn,k is asymptotic to its mean, and prove Poisson and normal approximation results for Sn,k in this limiting regime. We provide analogous results for the corresponding Poisson process (i.e. with a Poisson number of points).

Suggested Citation

  • Penrose, Mathew D. & Yang, Xiaochuan, 2026. "On k-clusters of high-intensity random geometric graphs," Stochastic Processes and their Applications, Elsevier, vol. 195(C).
    • Handle: RePEc:eee:spapps:v:195:y:2026:i:c:s0304414926000141
    DOI: 10.1016/j.spa.2026.104882
    as

    Download full text from publisher

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

    for a different version of it.

    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:eee:spapps:v:195:y:2026:i:c:s0304414926000141. 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.