The bin-covering technique for thresholding random geometric graph properties

MaRDI QIDQ2921769zbMATH OpenFDO

Authors S. Muthukrishnan, Gopal Pandurangan

Publication date 13 October 2014

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Random graphs (graph-theoretic aspects) (05C80) Communication networks in operations research (90B18)

Recommendations

• Thresholding random geometric graph properties motivated by ad hoc sensor networks
• On threshold probabilities for the realization of a random graph by a geometric graph
• On sharp thresholds in random geometric graphs
• Testing thresholds for high-dimensional sparse random geometric graphs
• The connectivity threshold of random geometric graphs with Cantor distributed vertices
• An exact threshold theorem for random graphs and the node-packing problem
• Automata, Languages and Programming
• The cover time of random geometric graphs
• The cover time of random geometric graphs
• Threshold Functions for Random Graphs on a Line Segment

Cited in

(19)

• Energy efficient randomised communication in unknown AdHoc networks
• Stretch and diameter in random geometric graphs
• Detecting a botnet in a network
• On the cover time and mixing time of random geometric graphs
• Fast message dissemination in random geometric networks
• Broadcasting in UDG radio networks with unknown topology
• Monotone properties of random geometric graphs have sharp thresholds
• Constrained minimum passage time in random geometric graphs
• The coverage holes of the largest component of random geometric graph
• The coverage of the largest component in random geometric graphs with applications in sensor networks
• On Radio Broadcasting in Random Geometric Graphs
• Size of the giant component in a random geometric graph
• One-dimensional geometric random graphs with nonvanishing densities. II: A very strong zero-one law for connectivity
• Initializing sensor networks of non-uniform density in the weak sensor model
• Automata, Languages and Programming
• scientific article; zbMATH DE number 7650120 (Why is no real title available?)
• Reconstruction of random geometric graphs: breaking the \(\varOmega (r)\) distortion barrier
• The phase transitions of diameters in random axis-parallel hyperrectangle intersection graphs
• Thresholding random geometric graph properties motivated by ad hoc sensor networks

This page was built for publication: The bin-covering technique for thresholding random geometric graph properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921769)