Abstract
The theory of geometric random graphs was initiated by Gilbert [2] already in 1961 in the context of what is called continuum percolation. In 1972, Hafner [4] focused on the typical properties of large but finite random geometric graphs. Here N points are sampled within a certain region of ℝ d following a certain distribution and any two of them are joined when their Euclidean distance is smaller than some threshold which, in general, is a function of N. In the last two decades, this class of random graphs has been studied extensively — see the monograph of Penrose [6].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
