On the cover time of random geometric graphs

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 677-689

  Avin, Chen ^a   Ercal, Gunes ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; PHASE TRANSITIONS; PROBABILITY;

ALGORITHMIC APPLICATIONS; EUCLIDEAN DISTANCE; RANDOM GEOMETRIC GRAPHS;

GRAPH THEORY;

EID: 26444568628     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_55     Document Type: Conference Paper

References (36)

1. Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science. (2003) 482-491
2. Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: in Proc. 23 Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). (2004)
3. Wagner, I.A., Lindenbaum, M., Bruckstein, A.M.: Robotic exploration, brownian motion and electrical resistance. Lecture Notes in Computer Science 1518 (1998) 116-130
4. Jerrum, M., Sinclair, A.: The markov chain monte carlo method: an approach to approximate counting and integration. In: Approximations for NP-hard Problems, Dorit Hochbaum ed. PWS Publishing, Boston, MA (1997) 482-520
5. Avin, C., Brito, C.: Efficient and robust query processing in dynamic environments using random walk techniques. In: Proc. of the third international symposium on Information processing in sensor networks. (2004) 277-286
6. Matthews, P.: Covering problems for Brownian motion on spheres. Ann. Probab. 16 (1988) 189-199
7. Aldous, D.J.: Lower bounds for covering times for reversible Markov chains and random walks on graphs. J. Theoret. Probab. 2 (1989) 91-100
8. Chandra, A.K., Raghavan, P., Ruzzo, W.L., Smolensky, R.: The electrical resistance of a graph captures its commute and cover times. In: Proc. of the 21st annual ACM symposium on Theory of computing. (1989) 574-586
9. Broder, A., Karlin, A.: Bounds on the cover time. J. Theoret. Probab. 2 (1989) 101-120
10. Zuckerman, D.: A technique for lower bounding the cover time. In: Proc. of the twenty-second annual ACM symposium on Theory of computing. (1990) 254-259
11. Aleliunas, R., Karp, R.M., Lipton, R.J., Lovász, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: 20th Annual Symposium on Foundations of Computer Science (San Juan, Puerto Rico, 1979). IEEE, New York (1979) 218-223
12. Jonasson, J.: On the cover time for random walks on random graphs. Comb. Probab. Comput. 7 (1998) 265-279
13. Jonasson, J., Schramm, O.: On the cover time of planar graphs. Electronic Communications in Probability 5 (2000) 85-90
14. Cooper, C., Frieze, A.: The cover time of sparse random graphs. In: Proc. of the fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-03). (2003) 140-147
15. Penrose, M.D.: Random Geometric Graphs. Volume 5 of Oxford Studies in Probability. Oxford University Press (2003)
16. Estrin, D., Govindan, R., Heidemann, J., Kumar, S.: Next century challenges: Scalable coordination in sensor networks. In: Proc. of the ACM/IEEE International Conference on Mobile Computing and Networking. (1999) 263-270
17. Pottie, G.J., Kaiser, W.J.: Wireless integrated network sensors. Communications of the ACM 43 (2000) 51-58
18. Goel, A., Rai, S., Krishnamachari, B.: Monotone properties have sharp thresholds in random geometric graphs. STOC slides (2004) http://www.stanford. edu/ sanat/slides/thresholdsstoc.pdf.
19. Avin, C., Ercal, G.: Bounds on the mixing time and partial cover of ad-hoc and sensor networks. In: Proceedings of the 2nd European Workshop on Wireless Sensor Networks (EWSN 2005). (2005) 1-12
20. Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Gossip and mixing times of random walks on random graphs. Unpublished, http://www.stanford.edu/boyd/ reports/gossip_gnr.pdf (2004)
21. Sadagopan, N., Krishnamachari, B., Helmy, A.: Active query forwarding in sensor networks (acquire). To appear Elsevier journal on Ad Hoc Networks (2003)
22. Braginsky, D., Estrin, D.: Rumor routing algorthim for sensor networks. In: Proc. of the 1st ACM Int. workshop on Wireless sensor networks and applications. (2002) 22-31
23. Servetto, S.D., Barrenechea, G.: Constrained random walks on random graphs: routing algorithms for large scale wireless sensor networks. In: Proc. of the 1st Int. workshop on Wireless sensor networks and applications. (2002) 12-21
24. Penrose, M.D.: The longest edge of the random minimal spanning tree. The Annals of Applied Probability 7 (1997) 340-361
25. Gupta, P., Kumar, P.R.: Critical power for asymptotic connectivity in wireless networks. In Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W. H. Fleming (1998) 547-566
26. Feige, U.: A tight lower bound on the cover time for random walks on graphs. Random Structures and Algorithms 6 (1995) 433-438
27. Rai, S.: The spectrum of a random geometric graph is concentrated. http://arxiv.org/PS_cache/math/pdf/0408/0408103.pdf (2004)
28. Winkler, P., Zuckerman, D.: Multiple cover time. Random Structures and Algorithms 9 (1996) 403-411
29. Dolev, S., Schiller, E., Welch, J.: Random walk for self-stabilizing group communication in ad-hoc networks. In: Proc. of the 21st IEEE Symposium on Reliable Distributed Systems (SRDS'02), IEEE Computer Society (2002) 70
30. Goel, A., Rai, S., Krishnamachari, B.: Sharp thresholds for monotone properties in random geometric graphs. In: Proc. of the thirty-sixth annual ACM symposium on Theory of computing. (2004) 580-586
31. Avin, C., Ercal, G.: On the cover time of random geometric graphs. Technical Report 040050, UCLA (2004) ftp://ftp.cs.ucla.edu/tech-report/2004- reports/040050.pdf.
32. Doyle, P.G., Snell, J.L.: Random Walks and Electric Networks. Volume 22. The Mathematical Association of America (1984)
33. Bollobás, B.: Random Graphs. Academic Press, Orlando, FL (1985)
34. Muthukrishnan, S., Pandurangan, G.: The bin-covering technique for thresholding random geometric graph properties. In: Proc. of the ACM-SIAM Symposium on Discrete Algorithms, to appear. (2005)
35. Synge, J.L.: The fundamental theorem of electrical networks. Quarterly of Applied Math. (1951) 113-127
36. Aldous, D., Fill, J.: Reversible markov chains and random walks on graphs. Unpublished. http://stat-www.berkeley.edu/users/aldous/RWG/book.html (1997)