Plane and planarity thresholds for random geometric graphs

DOI10.1142/S1793830920500056MaRDI QIDQ5216443zbMATH OpenOpenAlexFDO

Authors Ahmad Biniaz, Anil Maheshwari, Evangelos Kranakis, Michiel Smid

Publication date 18 February 2020

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830920500056

zbMATH Keywords

distance thresholdplanar graphplane graphrandom geometric graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Random graphs (graph-theoretic aspects) (05C80) General theory of incidence groups (51J05)

Recommendations

• Sharp thresholds for monotone properties in random geometric graphs
• Monotone properties of random geometric graphs have sharp thresholds
• scientific article; zbMATH DE number 1340281
• Random Geometric Graphs
• On the relation between graph distance and Euclidean distance in random geometric graphs

Cites work

• Approximating the bottleneck plane perfect matching of a point set
• Critical density thresholds in distributed wireless networks
• Every monotone graph property has a sharp threshold
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 4152425 (Why is no real title available?)
• scientific article; zbMATH DE number 1254188 (Why is no real title available?)
• scientific article; zbMATH DE number 1302648 (Why is no real title available?)
• scientific article; zbMATH DE number 1340281 (Why is no real title available?)
• On sharp thresholds in random geometric graphs
• On the connectivity of a random interval graph
• On the coverage of k-dimensional space by k-dimensional spheres
• Random coverings in several dimensions
• Random Geometric Graphs
• Random Graphs
• Random graphs.
• Random Plane Networks
• Sharp thresholds for monotone properties in random geometric graphs
• The connectivity of a graph on uniform points on [0,\,1]\(^{d}\).
• The longest edge of the random minimal spanning tree
• The probabilistic method
• Threshold functions
• Threshold Functions for Random Graphs on a Line Segment

Cited in

(4)

• Monotone properties of random geometric graphs have sharp thresholds
• On the distance-profile of random rooted plane graphs
• Sharp thresholds for monotone properties in random geometric graphs
• scientific article; zbMATH DE number 4112650 (Why is no real title available?)

This page was built for publication: Plane and planarity thresholds for random geometric graphs

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