generate random geometric graph
positive integer or list of vertices
positive real number; distance threshold
(optional) positive integer; number of dimensions of random points
(optional) one or more options as specified below
distribution : algebraic or list(algebraic)
A continuous distribution as supported by the Statistics package, or list of such distributions. The default is the uniform distribution between 0 and 1.
norm : integer or one of Frobenius or infinity.
Specifies the norm to be used in computing distances. The default is 2, the Euclidean norm.
For more information on norms, see LinearAlgebra[Norm].
seed : integer or none
Seed for the random number generator. Equivalent to calling randomize(seed) immediately before invoking this function.
weighted : true or false
If weighted=true, the result is a weighted graph whose edge weights correspond to the distance between points using the specified norm. Default is false.
RandomGeometricGraph(n,t,dims,opts) creates a random geometric graph on n vertices. A random geometric graph is a graph whose vertices correspond to a set of randomly generated points, and whose edges correspond with those pairs of points whose distance falls under a specified threshold t.
If omitted, the parameter dims is assumed to be 2 unless a multidimensional distribution was specified with the distribution option, in which case dims is taken to be numelems(distribution).
The random number generator used can be seeded using the randomize function or the seed option.
G1≔Graph 1: an undirected unweighted graph with 100 vertices and 4795 edge(s)
G2≔Graph 2: an undirected weighted graph with 100 vertices and 4837 edge(s)
G3≔Graph 3: an undirected unweighted graph with 200 vertices and 441 edge(s)
The GraphTheory[RandomGraphs][RandomGeometricGraph] command was introduced in Maple 2020.
For more information on Maple 2020 changes, see Updates in Maple 2020.
Download Help Document
What kind of issue would you like to report? (Optional)