24 citations · 47 across the 6 of their papers we have counts for
6 papers
Adaptive Dynamics of Realistic Small-World Networks
Olof Mogren, Oskar Sandberg, Vilhelm Verendel +1
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 th…
Decentralized Search with Random Costs
Oskar Sandberg
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph models…
Phase Transitions in Partially Structured Random Graphs
Oskar Sandberg
We study a one parameter family of random graph models that spans a continuum between traditional random graphs of the Erdős-Rényi type, where there is no underlying structure, and…
Double Clustering and Graph Navigability
Oskar Sandberg
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to meet…
Neighbor selection and hitting probability in small-world graphs
Oskar Sandberg
Small-world graphs, which combine randomized and structured elements, are seen as prevalent in nature. Jon Kleinberg showed that in some graphs of this type it is possible to route…
The evolution of navigable small-world networks
Oskar Sandberg, Ian Clarke
Small-world networks, which combine randomized and structured elements, are seen as prevalent in nature. Several random graph models have been given for small-world networks, with…