The cover time of random geometric graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 48-57

  Cooper, Colin ^a   Frieze, Alan ^b  

^a KING'S COLLEGE LONDON   (United Kingdom)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

COVER TIME; D DIMENSIONS; EDGE-SETS; RANDOM GEOMETRIC GRAPHS; UNIT BALL; VERTEX SET;

GEOMETRY;

EID: 70349127287     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.6     Document Type: Conference Paper

References (19)

1. D. Aldous and J. Fill. Reversible Markov Chains and Random Walks on Graphs.
2. R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovász and C. Rackoff, Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems. Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science (1979) 218-223.
3. C. Avin and G. Ercal, On the cover time and mixing time of random geometric graphs, Theoretical Computer Science 380 (2007) 2-22 (Pubitemid 46754590)
4. A.K. Chandra, P. Raghavan, W.L. Ruzzo and R. Smolensky, The electrical resistance of a graph captures its commute and cover times, Proceedings of 21st. ACM Symposium on Theory of Computing, (1989) 574-586.
5. C. Cooper and A. M. Frieze, The cover time of random regular graphs, SIAM Journal on Discrete Mathematics, 18 (2005) 728-740.
6. C. Cooper and A. M. Frieze, The cover time of the preferential attachment graph. Journal of Combinatorial Theory Series B, Series B, 97(2) 269-290 (2007).
7. C. Cooper and A. M. Frieze, The cover time of sparse random graphs, Random Structures and Algorithms 30 (2007) 1-16.
8. C. Cooper and A. M. Frieze, The cover time of the giant component of a random graph, Random Structures and Algorithms, 32, 401-439 (2008).
9. C. Cooper and A. M. Frieze, The cover time of random digraphs, Proceedings of RANDOM 2007, (11th. International Workshop on Randomized Techniques in Computation)
10. P. G. Doyle and J. L. Snell Random Walks and Electrical Networks. Carus Mathematical Monograph 22, AMA (1984).
11. R. Durrett, Probability: Theory and Examples, Brooks/Cole 1991.
12. U. Feige, A tight upper bound for the cover time of random walks on graphs, Random Structures and Algorithms, 6 (1995) 51-54.
13. U. Feige, A tight lower bound for the cover time of random walks on graphs, Random Structures and Algorithms, 6 (1995) 433-438.
14. P. Gupta and P.R. Kumar, Critical power for asymptotic connectivity in wireless networks, In Stochastic Analysis, Control, Optimization and Applications, Birkhauser, Boston, 1998.
15. P. Gupta and P.R. Kumar, Internets in the sky: the capacity of three dimensional wireless networks. Communications in Information and Systems, 1 (2001) 33-50.
16. M. Jerrum and A. Sinclair. The Markov chain Monte Carlo method: an approach to approximate counting and integration. In Approximation Algorithms for NP-hard Problems. (D. Hochbaum ed.) PWS (1996) 482-520
17. M. D. Penrose. Random Geometric Graphs. Oxford University Press (2003).
18. A. Sinclair. Improved bounds for mixing rates of Markov chains and multicommodity flow. Combinatorics, probability and Computing, 1 (1992), 351-370.
19. F. Xue and P. R. Kumar, Scaling laws for ad hoc wireless networks: an information theoretic approach. Foundations and Trends in Networking, 1(2) (2006) 145-270.