On the cover time and mixing time of random geometric graphs

The cover time and mixing 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 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_opt such that for any r ≥ r_optG (n, r) has optimal cover time of Θ (n log n) with high probability, and, importantly, r_opt = Θ (r_con) where r_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_con). On the other hand, the radius required for rapid mixing r_rapid = ω (r_con), and, in particular, r_rapid = Θ (1 / poly (log n)). We are able to draw our results by giving a tight bound on the electrical resistance and conductance of G (n, r) via certain constructed flows.