Monotone properties of random geometric graphs have sharp thresholds

DOI10.1214/105051605000000575zbMath1098.60011arXivmath/0310232OpenAlexW2037549896MaRDI QIDQ2496499

Ashish Goel, Bhaskar Krishnamachari, Sanatan Rai

Publication date: 10 July 2006

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0310232

zbMATH Keywords

wireless networkssharp thresholdsgeometric random graphs

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Group preferences (91B10) Applications of global differential geometry to the sciences (53C80)

Related Items (10)

Localization in random geometric graphs with too many edges ⋮ Geometric random graphs and Rado sets in sequence spaces ⋮ Random geometric graph: some recent developments and perspectives ⋮ Infinite random geometric graphs ⋮ Clique colourings of geometric graphs ⋮ Burning graphs: a probabilistic perspective ⋮ Frugal Routing on Wireless Ad-Hoc Networks ⋮ On the equivalence between random graph models ⋮ The peculiar phase structure of random graph bisection ⋮ On the treewidth of random geometric graphs and percolated grids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimax grid matching and empirical measures
• Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
• The longest edge of the random minimal spanning tree
• Influences of variables and threshold intervals under group symmetries
• Covering algorithms, continuum percolation and the geometry of wireless networks
• Internets in the sky: The capacity of three dimensional wireless networks
• Trees and matchings from point processes
• The connectivity of a graph on uniform points on [0,\,1\(^{d}\).]
• Random Geometric Graphs
• The capacity of wireless networks
• Every monotone graph property has a sharp threshold
• Threshold Functions for Random Graphs on a Line Segment
• On the connectivity of a random interval graph
• Probability

This page was built for publication: Monotone properties of random geometric graphs have sharp thresholds