Sharp thresholds For monotone properties in random geometric graphs

DOI10.1145/1007352.1007441zbMath1192.05145OpenAlexW2119221712MaRDI QIDQ3581011

Bhaskar Krishnamachari, Sanatan Rai, Ashish Goel

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1007352.1007441

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (10)

Topological properties of random wireless networks ⋮ On the cover time and mixing time of random geometric graphs ⋮ The spectrum of a random geometric graph is concentrated ⋮ Thresholding random geometric graph properties motivated by ad hoc sensor networks ⋮ A variational approach to the consistency of spectral clustering ⋮ Plane and planarity thresholds for random geometric graphs ⋮ Balanced cut approximation in random geometric graphs ⋮ A tutorial survey of topics in wireless networking. II ⋮ On Treewidth and Related Parameters of Random Geometric Graphs ⋮ Continuum limit of total variation on point clouds

This page was built for publication: Sharp thresholds For monotone properties in random geometric graphs