Planarity and number of crossings in general models of random geometric graphs

Abstract

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.