Construct · 1 fields · 1 citations

random geometric graph: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Network science

random graph formed by scattering points in space and joining pairs closer than a fixed distance, a model for wireless and spatial networks.

In network science, random geometric graph refers to random graph formed by scattering points in space and joining pairs closer than a fixed distance, a model for wireless and spatial networks. This meaning comes from Gilbert (1961) in Journal of the Society for Industrial and Applied Mathematics.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how random geometric graph sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

model3 fields · 3 citationsjingle · one word, three constructs network4 fields · 6 citationsjingle · one word, four constructs scattering3 fields · 4 citationsinvariant · one construct, three systems

References

Gilbert, E. N. (1961). Random Plane Networks. Journal of the Society for Industrial and Applied Mathematics, 9(4), 533-543. https://doi.org/10.1137/0109045

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct