Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions

A random geometric graph (RGG) is defined by placing n points uniformly at random in [0,n1/d]d, and joining two points by an edge whenever their Euclidean distance is at most some fixed r. We assume that r is larger than the critical value for the emergence of a connected component with Ω(n) nodes. We show that, with high probability (w.h.p.), for any two connected nodes with a Euclidean distance of $\omega (\frac{\log n}{r^{d-1}} )$, their graph distance is only a constant factor larger than their Euclidean distance. This implies that the diameter of the largest connected component is Θ(n1/d/r) w.h.p. We also prove that the condition on the Euclidean distance above is essentially tight.We also analyze the following randomized broadcast algorithm on RGGs. At the beginning, only one node from the largest connected component of the RGG is informed. Then, in each round, each informed node chooses a neighbor independently and uniformly at random and informs it. We prove that w.h.p. this algorithm informs every node in the largest connected component of an RGG within Θ(n1/d/r+logn) rounds.

[1]  Thomas Sauerwald,et al.  On the runtime and robustness of randomized broadcasting , 2006, Theor. Comput. Sci..

[2]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[3]  Chen Avin,et al.  On the cover time and mixing time of random geometric graphs , 2007, Theor. Comput. Sci..

[4]  S. Muthukrishnan,et al.  Thresholding random geometric graph properties motivated by ad hoc sensor networks , 2010, J. Comput. Syst. Sci..

[5]  H. Poincaré,et al.  Percolation ? , 1982 .

[6]  Vlady Ravelomanana,et al.  Extremal properties of three-dimensional sensor networks with applications , 2004, IEEE Transactions on Mobile Computing.

[7]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[8]  Desmond J. Higham,et al.  Fitting a geometric graph to a protein-protein interaction network , 2008, Bioinform..

[9]  Kuo-Feng Ssu,et al.  Sensor Position Determination with Flying Anchors in Three-Dimensional Wireless Sensor Networks , 2008, IEEE Transactions on Mobile Computing.

[10]  Alan M. Frieze,et al.  The cover time of random geometric graphs , 2009, SODA.

[11]  Catherine H. Yan,et al.  Random Geometric Graph Diameter in the Unit Ball , 2006, Algorithmica.

[12]  C. Newman,et al.  First Passage Percolation for Random Colorings of $\mathbb{Z}^d$ , 1993 .

[13]  J. Deuschel,et al.  Surface order large deviations for high-density percolation , 1996 .

[14]  S. Muthukrishnan,et al.  The bin-covering technique for thresholding random geometric graph properties , 2005, SODA '05.

[15]  Thomas Sauerwald,et al.  On Mixing and Edge Expansion Properties in Randomized Broadcasting , 2007, Algorithmica.

[16]  Eli Upfal,et al.  Randomized Broadcast in Networks , 1990, Random Struct. Algorithms.

[17]  R. Schonmann,et al.  Domination by product measures , 1997 .

[18]  B. Pittel.  On spreading a rumor , 1987 .

[19]  M. Penrose.  The longest edge of the random minimal spanning tree , 1997 .

[20]  Thomas Sauerwald,et al.  Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs , 2007, STACS.

[21]  Alan M. Frieze,et al.  The cover time of the giant component of a random graph , 2008, Random Struct. Algorithms.

[22]  Dario Pompili,et al.  Underwater acoustic sensor networks: research challenges , 2005, Ad Hoc Networks.

[23]  Alan M. Frieze,et al.  Broadcasting in Random Graphs , 1994, Discret. Appl. Math..

[24]  Alan M. Frieze,et al.  The shortest-path problem for graphs with random arc-lengths , 1985, Discret. Appl. Math..

[25]  Ãgoston Pisztora,et al.  ON THE CHEMICAL DISTANCE FOR SUPERCRITICAL BERNOULLI PERCOLATION , 1996 .

[26]  Mathew D. Penrose,et al.  On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.

[27]  R. Meester,et al.  Continuum percolation: References , 1996 .

[28]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[29]  Wei Hong,et al.  A macroscope in the redwoods , 2005, SenSys '05.

[30]  M. Penrose,et al.  Large deviations for discrete and continuous percolation , 1996, Advances in Applied Probability.

[31]  Konstantinos Panagiotou,et al.  Rumor spreading on random regular graphs and expanders , 2010, Random Struct. Algorithms.

[32]  A. Frieze,et al.  The cover time of the giant component of a random graph , 2008 .

[33]  Thomas Sauerwald,et al.  Efficient broadcast on random geometric graphs , 2010, SODA '10.