A Random Geometric Graph (RGG) in two dimensions is constructed by distributing n nodes independently and uniformly at random in [0, n ]2 and creating edges between every pair of...
Milan Bradonji, Robert Elsässer, Tobias Friedrich...
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared wit...
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...