Advertisement
Published in:
2018 | OriginalPaper | Chapter
9. Random Geometric Graphs
Author : Marc Barthelemy
Published in: Morphogenesis of Spatial Networks
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
In this chapter, we discuss the random geometric graph (also called the unit disk graph) which is an important model for spatial networks. We will also introduce and discuss some of the variants of this model. The random geometric graph is obtained from a random distribution of points in the plane and a geometric rule for connecting these points and creating edges. The simplest case is obtained when a proximity rule is used and which states that nodes only within a certain distance are connected.