On Sharp Thresholds in Random Geometric Graphs
Probability
2014-09-05 v2 Computational Complexity
Discrete Mathematics
Combinatorics
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.
Cite
@article{arxiv.1308.1084,
title = {On Sharp Thresholds in Random Geometric Graphs},
author = {Milan Bradonjić and Will Perkins},
journal= {arXiv preprint arXiv:1308.1084},
year = {2014}
}
Comments
Replaces an earlier version with the title "Thresholds for Random Geometric k-SAT"