Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2020

Highly Cited

2020

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

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

In this paper, we present Batch Informed Trees (BIT*), a planning algorithm based on unifying graph- and sampling-based planning… Expand

Highly Cited

2012

Highly Cited

2012

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

Highly Cited

2011

Highly Cited

2011

We study the expected topological properties of Čech and Vietoris–Rips complexes built on random points in ℝd. We find higher… Expand

2009

2009

In this paper, we study the synchronization properties of random geometric graphs. We show that the onset of synchronization… Expand

Highly Cited

2006

Highly Cited

2006

Motivated by applications to sensor, peer-to-peer, and ad hoc networks, we study distributed algorithms, also known as gossip… Expand

Highly Cited

2004

Highly Cited

2004

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

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

1. Introduction 2. Probabilistic ingredients 3. Subgraph and component counts 4. Typical vertex degrees 5. Geometrical… Expand