@TECHREPORT{Mogren07dynamicsof, author = {Olof Mogren}, title = {Dynamics of geographical routing in small-world networks}, institution = {}, year = {2007} }
Bookmark
OpenURL
Abstract
Cover: Illustration of a continuous graph generated based on real world data from Statistics Sweden (SCB), 512 nodes. Purple edges showing base Delaunay graph, orange edges showing shortcuts selected through destination sampling. Göteborg, Sweden September 2007 2 A graph exhibits the small-world phenomenon if most nodes can be reached through a short chain of steps along the edges. Current small-world models include those based on a simple base graph structure, which is augmented with shortcuts added according to some random process. We examined the small-world graph models mentioned above with variable population density through computer simulations. Firstly, graphs were examined with a grid structure as base graph but allowing arbitrarily many nodes at each grid spot. Secondly, graphs were examined with continuous location coordinates.