Continuing in the steps of Jon Kleinberg's and others celebrated work on decentralized search in small-world networks, we conduct an experimental analysis of a dynamic algorithm that produces small-world networks. We find that the algorithm adapts robustly to a wide variety of situations in realistic geographic networks with synthetic test data and with real world data, even when vertices are uneven and non-homogeneously distributed.
Olof Mogren, Oskar Sandberg, Vilhelm Verendel, Devdatt Dubhashi
European Conference on Complex Systems
PDF Fulltext
arxiv:
bibtex.