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â€¦Â (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Consider a graph on n uniform random points in the unit square, each pair being connected by an edge with probability p if theâ€¦Â (More)
Is this relevant?
2015
2015
• Random Struct. Algorithms
• 2015
Let GÎ» be the graph whose vertices are points of a planar Poisson process of density Î», with vertices adjacent if they are withinâ€¦Â (More)
Is this relevant?
2009
2009
• Random Struct. Algorithms
• 2009
We study the cover time of random geometric graphs. Let I(d) = [0, 1]d denote the unit torus in d dimensions. Let D(x, r) denoteâ€¦Â (More)
Is this relevant?
2008
2008
A random geometric graph Gn is constructed by taking vertices X1, . . . , Xn âˆˆ R at random (i.i.d. according to some probabilityâ€¦Â (More)
Is this relevant?
2006
2006
• Algorithmica
• 2006
The unit ball random geometric graph $G=G^d_p(\lambda,n)$ has as its vertices n points distributed independently and uniformly inâ€¦Â (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
• SODA
• 2005
We study the emerging phenomenon of ad hoc, sensor-based communication networks. The communication is modeled by the geometricâ€¦Â (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
• STOC
• 2004
Random geometric graphs result from taking n uniformly distributed points in the unit cube, [0,1]d, and connecting two points ifâ€¦Â (More)
Is this relevant?
2004
2004
Consider n points distributed uniformly in [0, 1] d. Form a graph by connecting two points if their mutual distance is no greaterâ€¦Â (More)
Is this relevant?
2001
2001
• J. Algorithms
• 2001
In this paper, we study the approximability of several layout problems on a family of random geometric graphs. Vertices of randomâ€¦Â (More)
Is this relevant?
1983
1983
We prove that, in the Gilbert model for a random geometric graph, almost every graph becomes Hamiltonian exactly when it firstâ€¦Â (More)
Is this relevant?