Sciweavers

14 search results - page 1 / 3
» On the Probability of the Existence of Fixed-Size Components...
Sort
View
49
Voted
CORR
2008
Springer
75views Education» more  CORR 2008»
15 years 3 months ago
On the Probability of the Existence of Fixed-Size Components in Random Geometric Graphs
Josep Díaz, Dieter Mitsche, Xavier Pé...
125
Voted
SODA
2010
ACM
201views Algorithms» more  SODA 2010»
16 years 1 months ago
Efficient Broadcast on Random Geometric Graphs
A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
Milan Bradonji, Robert Elsässer, Tobias Friedrich...
147
Voted
IM
2008
15 years 3 months ago
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
Chen Avin
151
Voted
DCG
2011
14 years 10 months ago
Random Geometric Complexes
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...
Matthew Kahle
123
Voted
MONET
2006
157views more  MONET 2006»
15 years 3 months ago
Connectivity in Wireless Ad-hoc Networks with a Log-normal Radio Model
In this paper we study connectivity in wireless ad-hoc networks by modeling the network as an undirected geometric random graph. The novel aspect in our study is that for finding t...
Ramin Hekmat, Piet Van Mieghem