Sharp thresholds For monotone properties in random geometric graphs
From MaRDI portal
Publication:3581011
DOI10.1145/1007352.1007441zbMath1192.05145MaRDI QIDQ3581011
Ashish Goel, Bhaskar Krishnamachari, Sanatan Rai
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
05C80: Random graphs (graph-theoretic aspects)
Related Items
Thresholding random geometric graph properties motivated by ad hoc sensor networks, Balanced cut approximation in random geometric graphs, A tutorial survey of topics in wireless networking. II, 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