arXiv subjects

Lianne de Jonge

Publications and source records attributed to Lianne de Jonge.

3 recordsLinked to original sources

arXiv2026

Existence of a plane without edge crossings in projections of the random geometric graph

Consider a random geometric graph $G$ with a vertex set defined by a Poisson point process with intensity $t>0$ in a convex body. We can generate a drawing of the graph by projecting the construction onto some plane $L$. Choosing different planes leads to different drawings, and in particular, potentially more or fewer edge crossings. In this paper, we prove that if the connection radius is smaller than a given threshold, the probability that there exists a plane with zero crossings tends to one as $t\to \infty$. We also state the asymptotic probability that such a plane is found after considering a given number of randomly chosen planes.

math.PR↗

arXiv2025

Coverage of the unit cube by dynamic Boolean models

Motivated by peer-to-peer telecommunication, we study a dynamic Boolean model. We define a Poisson number of random lines through the $(d-1)$-dimensional base of a $d$-dimensional unit cube and dilate them to define cylinders. Letting $ρ$ be the expected number of cylinders, the random variable of interest is the coverage radius $R_ρ$, which is the cylinder radius required to cover the $d$-dimensional unit cube. We show that $R_ρ^{d-1}$ is of the order $\log ρ/ ρ$ with high probability as $ρ$ tends to infinity. We also consider alternative dynamics resulting in generalized cylinders that are generated by dilating the trajectories of stochastic processes, in particular Brownian motions. This leads to a coverage radius of the same order.

math.PR↗

arXiv2025

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

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.

math.PR↗