Random geometric graph
In graph theory, the mathematically simplest spatial network / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Random geometric graph?
Summarize this article for a 10 year old
In graph theory, a random geometric graph (RGG) is the mathematically simplest spatial network, namely an undirected graph constructed by randomly placing N nodes in some metric space (according to a specified probability distribution) and connecting two nodes by a link if and only if their distance is in a given range, e.g. smaller than a certain neighborhood radius, r.
Part of a series on  
Network science  

Network types  
Graphs  


Models  


 
Random geometric graphs resemble real human social networks in a number of ways. For instance, they spontaneously demonstrate community structure  clusters of nodes with high modularity. Other random graph generation algorithms, such as those generated using the Erdős–Rényi model or Barabási–Albert (BA) model do not create this type of structure. Additionally, random geometric graphs display degree assortativity according to their spatial dimension:[1] "popular" nodes (those with many links) are particularly likely to be linked to other popular nodes.
A realworld application of RGGs is the modeling of ad hoc networks.[2] Furthermore they are used to perform benchmarks for graph algorithms.
Oops something went wrong: