×

On the cover time of random geometric graphs. (English) Zbl 1084.05504

Caires, Luís (ed.) et al., Automata, languages and programming. 32nd international colloquium, ICALP 2005, Lisbon, Portugal, July 11–15, 2005. Proceedings. Berlin: Springer (ISBN 3-540-27580-0/pbk). Lecture Notes in Computer Science 3580, 677-689 (2005).
Summary: The cover time of graphs has much relevance to algorithmic applications and has been extensively investigated. Recently, with the advent of ad-hoc and sensor networks, an interesting class of random graphs, namely random geometric graphs, has gained new relevance and its properties have been the subject of much study. A random geometric graph \(\mathcal G(n,r)\) is obtained by placing \(n\) points uniformly at random on the unit square and connecting two points iff their Euclidean distance is at most \(r\). The phase transition behavior with respect to the radius \(r\) of such graphs has been of special interest. We show that there exists a critical radius \(r_{\text{opt}}\) such that for any \(r \geq r_{\text{opt}}\mathcal G(n,r)\) has optimal cover time of \(\Theta (n \log n)\) with high probability, and, importantly, \(r_{\text{opt}} = \Theta (r_{\text{con}})\) where \(r_{\text{con}}\) denotes the critical radius guaranteeing asymptotic connectivity. Moreover, since a disconnected graph has infinite cover time, there is a phase transition and the corresponding threshold width is \(O (r_{\text{con}})\). We are able to draw our results by giving a tight bound on the electrical resistance of \(\mathcal G(n,r)\) via the power of certain constructed flows.
For the entire collection see [Zbl 1078.68001].

MSC:

05C80 Random graphs (graph-theoretic aspects)
68R10 Graph theory (including graph drawing) in computer science
94C15 Applications of graph theory to circuits and networks
PDFBibTeX XMLCite
Full Text: DOI