IDEAS home Printed from https://ideas.repec.org/a/spr/jotpro/v38y2025i3d10.1007_s10959-025-01426-9.html
   My bibliography  Save this article

Central Limit Theorem for Crossings in Randomly Embedded Graphs

Author

Listed:
  • Santiago Arenas-Velilla

    (University of Göttingen)

  • Octavio Arizmendi

    (Centro de Investigación en Matemáticas)

  • J. E. Paguyo

    (McMaster University)

Abstract

We consider the number of crossings in a random embedding of a graph, G, with vertices in convex position. We give explicit formulas for the mean and variance of the number of crossings as a function of various subgraph counts of G. Using Stein’s method and size-biased coupling, we establish an upper bound on the Kolmogorov distance between the distribution of the number of crossings and a standard normal random variable. We also consider the case where G is a random graph and obtain a Kolmogorov bound between the distribution of crossings and a Gaussian mixture distribution. As applications, we obtain central limit theorems with convergence rates for the number of crossings in random embeddings of matchings, path graphs, cycle graphs, disjoint union of triangles, random d-regular graphs, and mixtures of random graphs.

Suggested Citation

  • Santiago Arenas-Velilla & Octavio Arizmendi & J. E. Paguyo, 2025. "Central Limit Theorem for Crossings in Randomly Embedded Graphs," Journal of Theoretical Probability, Springer, vol. 38(3), pages 1-31, September.
    • Handle: RePEc:spr:jotpro:v:38:y:2025:i:3:d:10.1007_s10959-025-01426-9
    DOI: 10.1007/s10959-025-01426-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10959-025-01426-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10959-025-01426-9?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.

    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:jotpro:v:38:y:2025:i:3:d:10.1007_s10959-025-01426-9. 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.