Mixing times for random walks on geometric random graphs

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics

Volumn , Issue , 2005, Pages 240-249

  Boyd, Stephen ^a   Ghosh, Arpita ^a   Prabhakar, Balaji ^a   Shah, Devavrat ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY GRAPH; POINCARE'S INEQUALITY; RANDOM WALK;

COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; WIRELESS TELECOMMUNICATION SYSTEMS;

GRAPH THEORY;

EID: 32144441170     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. [BBFM03] L. Booth, J. Bruck, M. Franceschetti, and R. Meester. Covering algorithms, continuum percolation, and the geometry of wireless networks. The Annals of Applied Probability, 13(2):722-41, 2003.
2. [BDX04] S. Boyd, P. Diaconis, and L. Xiao. Fastest mixing Markov chain on a graph. To appear in SIAM Review, problems and techniques section, 2004. Available at www.stanford.edu/~boyd/fmmc.html.
3. [BGPS04] S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Gossip algorithms: Design, analysis and applications. 2004. Submitted, available at www.stanford.edu/~devavrat/infocom05.ps.
4. [Bol01] B. Bollobas. Random Graphs. Cambridge University Press, 2001.
5. [DS91] P. Diaconis and D. Stroock. Geometric bounds for eigenvalues of Markov chains. The Annals of Applied Probability, 1(1):36-61, 1991.
6. [GK00] P. Gupta and P. R. Kumar. The capacity of wireless networks. IEEE Transactions on Information Theory, 46(2):388-404, March 2000.
7. [GRK04] A. Goel, S. Rai, and B. Krishnamachari. Sharp threshold for monotone properties in geometric random graphs. In Proc. Conference on Symposium on Theory of Computation. ACM, 2004.
8. [Gur00] V. Guruswami. Rapidly mixing markov chains: A comparison of techniques. May 2000. Available at cs.washington.edu/homes/venkat/ pubs/papers.html.
9. [HJ85] R. Horn and C. Johnson. Matrix Analysis. Cambridge University Press, Cambridge, UK, 1985.
10. [Pen03] M. Penrose. Random geometric graphs. Oxford studies in probability. Oxford University Press, Oxford, 2003.
11. [PXBD03] P. A. Parrilo, L. Xiao, S. Boyd, and P. Diaccnis. Symmetry analysis of reversible markov chains. Technical report No. 2003-38, Department of Statistics, Stanford University, 2003.