The maximal degree in a Poisson-Delaunay graph
Abstract
We investigate the maximal degree in a Poisson-Delaunay graph in Rd, d≥ 2, over all nodes in the window W:= 1/d[0,1]d as goes to infinity. The exact order of this maximum is provided in any dimension. In the particular setting d=2, we show that this quantity is concentrated on two consecutive integers with high probability. An extension of this result is discussed when d≥ 3
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.