Live briefing
Everything about Random geometric graph
In graph theory, the mathematically simplest spatial network
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 and connecting two nodes by an edge if and only if their distance is in a given range, e.g. smaller than a certain neighborhood radius, r. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Random geometric graphA 5-minute orientation
- Skim a recent paper: Degree distributions in AB random geometric graphsInfluential work since 2022
- Pick up a classic book: Topology and Geometry of BiopolymersThe most-reprinted book on the subject
- Read the landmark paper: Random geometric graphsCited 414 times
- Go sideways: Hyperbolic geometric graphA closely related topic
- Go sideways: Erdős–Rényi modelA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Random geometric graphs
Onk-connectivity for a geometric random graph
Geometric inhomogeneous random graphs
Random Geometric Graph Diameter in the Unit Ball
On the relation between graph distance and Euclidean distance in random geometric graphs
Disjoint Hamilton cycles in the random geometric graph
The Spectrum of a Random Geometric Graph is Concentrated
Random geometric graph description of connectedness percolation in rod systems
🆕 Influential since 2022
Degree distributions in AB random geometric graphs
Markov random geometric graph, MRGG: A growth model for temporal dynamic networks
Giant component of the soft random geometric graph
On the first and second largest components in the percolated random geometric graph
Connectivity of Random Geometric Hypergraphs
📚 Books worth reading
- 📕Topology and Geometry of BiopolymersErica Flapan, Helen Wong · 2020
- 📕Probabilistic Methods in Geometry, Topology, and Spectral TheoryYaiza Canzani, Linan Chen · 2019
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Hyperbolic geometric graph A hyperbolic geometric graph (HGG) or hyperbolic geometric network (HGN) is a special type of spatial network where (1) latent coordinates of nodes are…
- Erdős–Rényi model In the mathematical field of graph theory, the Erdős–Rényi models are two closely related models for generating random graphs and the evolution of a random…
- Random graph In mathematics, random graph is the general term to refer to probability distributions over graphs. Random graphs may be described simply by a probability…
- Copying mechanism In the study of scale-free networks, a copying mechanism is a process by which such a network can form and grow, by means of repeated steps in which nodes…
- Maximal independent set In graph theory, a maximal independent set (MIS) or maximal stable set is an independent set that is not a subset of any other independent set. In other…
- Network science Network science is an academic field which studies complex networks such as telecommunication networks, computer networks, biological networks, cognitive…
- Scale-free network A scale-free network is a network whose degree distribution follows a power law, at least asymptotically. That is, the fraction P(k) of nodes in the network…
- Graph traversal In computer science, graph traversal (also known as graph search) refers to the process of visiting (checking and/or updating) each vertex in a graph.…