On Sharp Thresholds in Random Geometric Graphs
Milan Bradonjić, Perkins, Will · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2013
We give a characterization of vertex-monotone properties with sharp thresholds in a Poisson random geometric graph or hypergraph. As an application we show that a geometric model of random k-SAT exhibits a sharp threshold for satisfiability.