On Sharp Thresholds in Random Geometric Graphs
classification
🧮 math.PR
cs.CCcs.DMmath.CO
keywords
geometricrandomsharpthresholdsapplicationcharacterizationexhibitsgive
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.