LIPIcs.APPROX-RANDOM.2014.500.pdf
- Filesize: 488 kB
- 15 pages
Document
On Sharp Thresholds in Random Geometric Graphs
Authors
-
Part of:
Volume:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Randomization and Computation (RANDOM)
Conference: International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2014-09-04
File
Document Identifiers
Cite AsGet BibTex
Milan Bradonjic and Will Perkins. On Sharp Thresholds in Random Geometric Graphs. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 500-514, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.500
https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.500
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.
Keywords
- Sharp thresholds
- random geometric graphs
- k-SAT
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads