Hostname: page-component-89b8bd64d-sd5qd Total loading time: 0 Render date: 2026-05-08T11:51:09.467Z Has data issue: false hasContentIssue false

Limit theorems for the number of crossings and stress in projections of a random geometric graph

Published online by Cambridge University Press:  01 October 2025

Hanna Döring*
Affiliation:
Osnabrück University
Lianne De Jonge*
Affiliation:
Osnabrück University
*
*Postal address: Institute of Mathematics, Osnabrück University, Germany.
*Postal address: Institute of Mathematics, Osnabrück University, Germany.
Rights & Permissions [Opens in a new window]

Abstract

We consider the number of edge crossings in a random graph drawing generated by projecting a random geometric graph on some compact convex set $W\subset \mathbb{R}^d$, $d\geq 3$, onto a plane. The positions of these crossings form the support of a point process. We show that if the expected number of crossings converges to a positive but finite value, this point process converges to a Poisson point process in the Kantorovich–Rubinstein distance. We further show a multivariate central limit theorem between the number of crossings and a second variable called the stress that holds when the expected vertex degree in the random geometric graph converges to a positive finite value.

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2025. Published by Cambridge University Press on behalf of Applied Probability Trust
Figure 0

FIGURE 1. Projection of a graph in $\mathbb{R}^3$ onto a plane.

Figure 1

FIGURE 2. Vertex relationships in L.

Figure 2

FIGURE 3. Two-dimensional representation of a function h(v) (gray), the infimum $h_-(v)$, and the supremum $h_+(v)$. Solid lines indicate the domain $W_L$ and dashed lines the domain $L\setminus W_L$.