Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Random geometric graph

Known as: RGG, Random geometric graphs 
In graph theory, a random geometric graph (RGG) is the mathematically simplest spatial network, namely an undirected graph constructed by randomly… Expand
Wikipedia

Related topics

Related topics

5 relations
Geometric graph theoryGraph theoryGraphCrunchHyperbolic geometric graph
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2020
Highly Cited
2020
Error Estimates for Spectral Convergence of the Graph Laplacian on Random Geometric Graphs Toward the Laplace–Beltrami Operator
We study the convergence of the graph Laplacian of a random geometric graph generated by an i.i.d. sample from a m -dimensional… Expand
Highly Cited
2016
Highly Cited
2016
CONNECTIVITY OF SOFT RANDOM GEOMETRIC GRAPHS
Consider a graph on $n$ uniform random points in the unit square, each pair being connected by an edge with probability $p$ if… Expand
Highly Cited
2015
Highly Cited
2015
Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs
In this paper, we present Batch Informed Trees (BIT*), a planning algorithm based on unifying graph- and sampling-based planning… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2012
Highly Cited
2012
Random Hyperbolic Graphs: Degree Sequence and Clustering
In the last decades, the study of models for large real-world networks has been a very popular and active area of research. A… Expand
  • figure 1
Highly Cited
2011
Highly Cited
2011
Random Geometric Complexes
  • M. Kahle
  • Discret. Comput. Geom.
  • 2011
    • Corpus ID: 2128627
We study the expected topological properties of Čech and Vietoris–Rips complexes built on random points in ℝd. We find higher… Expand
  • figure 1
  • figure 2
  • figure 3
2009
2009
Synchronization in Random Geometric Graphs
In this paper, we study the synchronization properties of random geometric graphs. We show that the onset of synchronization… Expand
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2006
Highly Cited
2006
Randomized gossip algorithms
Motivated by applications to sensor, peer-to-peer, and ad hoc networks, we study distributed algorithms, also known as gossip… Expand
  • figure 1
  • figure 2
  • figure 3
Highly Cited
2004
Highly Cited
2004
Sharp thresholds For monotone properties in random geometric graphs
Random geometric graphs result from taking n uniformly distributed points in the unit cube, [0,1]d, and connecting two points if… Expand
2004
2004
The Spectrum of a Random Geometric Graph is Concentrated
Consider n points, x1,... , xn, distributed uniformly in [0, 1]d. Form a graph by connecting two points xi and xj if $$\Vert x_i… Expand
Highly Cited
2003
Highly Cited
2003
Random Geometric Graphs
1. Introduction 2. Probabilistic ingredients 3. Subgraph and component counts 4. Typical vertex degrees 5. Geometrical… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE