On Sharp Thresholds in Random Geometric Graphs

Bradonjic, Milan; Perkins, Will

doi:10.4230/LIPIcs.APPROX-RANDOM.2014.500

Document

On Sharp Thresholds in Random Geometric Graphs

Authors Milan Bradonjic, Will Perkins

Part of: Volume: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: International Conference on Randomization and Computation (RANDOM)
Part of: Conference: International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)
License: Creative Commons Attribution 3.0 Unported license
Publication Date: 2014-09-04

PDF

File

PDF

LIPIcs.APPROX-RANDOM.2014.500.pdf

Filesize: 488 kB
15 pages

Document Identifiers

DOI: 10.4230/LIPIcs.APPROX-RANDOM.2014.500
URN: urn:nbn:de:0030-drops-47195

Subject Classification

Keywords

Sharp thresholds
random geometric graphs
k-SAT

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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 As Get 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

Author Details

Milan Bradonjic

Will Perkins

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail