Metraipolis › archive › dc_bf7e6610bb6b
Planarity and number of crossings in general models of random geometric graphs — arXiv:2609.08395
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.08395
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:35:14.825Z
- SHA-256 of the archived text
9223814b8f0d3f206fed3e0e6c3dd1637e0e0fc039ef2e3714433b90568b7071- Stable URL of this page
https://metraipolis.com/documento/dc_bf7e6610bb6b
How to cite
Planarity and number of crossings in general models of random geometric graphs — arXiv:2609.08395 — arXiv (en), https://arxiv.org/abs/2609.08395 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bf7e6610bb6b (Metraipolis archive dc_bf7e6610bb6b, sha256 9223814b8f0d3f206fed3e0e6c3dd1637e0e0fc039ef2e3714433b90568b7071)
BibTeX
@misc{dcbf7e6610bb6b,
title = {Planarity and number of crossings in general models of random geometric graphs — arXiv:2609.08395},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.08395},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bf7e6610bb6b; sha256 9223814b8f0d3f206fed3e0e6c3dd1637e0e0fc039ef2e3714433b90568b7071},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.08395. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Consider a random geometric graph with vertices given by a Poisson point process, and whose edges depend on independent marks corresponding to the vertices and pairs of vertices. In this paper, we study two related questions on this general model: the number of edge crossings in a projection of this graph, and its graph-theoretical planarity. We focus on models with heavy-tailed mark distributions, in particular with polynomial tails with arbitrary exponents. We show that the asymptotic behaviour varies significantly depending on this exponent. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.PR). Categorie arXiv: Probability (math.PR) ; Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.08395 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T14:09:59.798Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).