A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Small Worlds and Rapid Mixing with a Little More Randomness on Random Geometric Graphs
[chapter]

2011
*
Lecture Notes in Computer Science
*

We theoretically and experimentally analyze the process of adding sparse random links to a random wireless networks modeled as a random geometric graph. While this process has been previously proposed, we are the first to (i) theoretically consider sparse new-wiring (with asymptotically less than constant fraction of nodes allowed very small constant new wired edges), (ii) prove bounds for any new-wiring process upon random geometric graphs, and (iii) consider the effect of such sparse

doi:10.1007/978-3-642-20757-0_22
fatcat:n6ahax7lnjdr7n64njs3bsuczi