Sciweavers

260 search results - page 7 / 52
» Dynamic Random Geometric Graphs
Sort
View
WAW
2007
Springer
162views Algorithms» more  WAW 2007»
14 years 5 months ago
Random Dot Product Graph Models for Social Networks
Inspired by the recent interest in combining geometry with random graph models, we explore in this paper two generalizations of the random dot product graph model proposed by Kraet...
Stephen J. Young, Edward R. Scheinerman
CORR
2006
Springer
101views Education» more  CORR 2006»
13 years 11 months ago
Geographic Gossip: Efficient Aggregation for Sensor Networks
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
PPL
2000
110views more  PPL 2000»
13 years 10 months ago
Faulty Random Geometric Networks
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
Josep Díaz, Jordi Petit, Maria J. Serna
ENDM
2008
118views more  ENDM 2008»
13 years 11 months ago
Number of Crossing-Free Geometric Graphs vs. Triangulations
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
Andreas Razen, Jack Snoeyink, Emo Welzl
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 11 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...