oskar sandberg - writings

Papers

Oskar Sandberg "Decentralized Search with Random Costs", Preprint (2008).

Olof Mogren, Oskar Sandberg, Vilhelm Verendel, and Devdatt Dubhashi "Adaptive Dynamics of Realistic Small-World Networks", in Proceedings of the European Conference on Complex Systems 2009.

Oskar Sandberg "Phase Transitions in Partially Structured Random Graphs". Preprint (2007).

Oskar Sandberg "Double Clustering and Graph Navigation". Preprint (2007).

Oskar Sandberg "Neighbor Selection and Hitting Probability in Small-World Graphs". The Annals of Applied Probability, Vol. 18, No. 5, 1771-1793. (A shorter summary of the ideas behind this paper are in the below Technical Report.)

Oskar Sandberg and Ian Clarke, "The Evolution of Navigable Small-World Networks". Department of Computer Science and Engineering Technical Report 2007:14, Chalmers University of Technology.

Oskar Sandberg, "Distributed Routing in Small-World Networks", ALENEX (2006). (The "Darknet" paper. More data and code to do with this is here.)

Ian Clarke, Theodore W. Hong, Scott G. Miller, Oskar Sandberg, and Brandon Wiley, "Protecting Free Expression Online with Freenet," IEEE Internet Computing 6(1), 40-49 (2002).
(The main author is actually Theo.)

Ian Clarke, Oskar Sandberg, Brandon Wiley, and Theodore W. Hong, "Freenet: A Distributed Anonymous Information Storage and Retrieval System," in Designing Privacy Enhancing Technologies: International Workshop on Design Issues in Anonymity and Unobservability, LNCS 2009, edited by Hannes Federrath. Springer: Berlin (2001).
(A slightly older paper that covers mostly the same things as the one above. According to this page this is currently the most cited paper in CS from 2000. w000!)

Theses

Oskar Sandberg, "The Structure and Dynamics of Navigable Networks", Gothenburg University and Chalmers University of Technology (2007). (My PhD thesis.)

Oskar Sandberg, "Constructions of the Harmonic Measure with Probabilistic and Discrete Time Methods," University of Stockholm (2003) [tex source]
(My masters thesis)

Talks

Small World Networks: I have given quite a few talks on this topic, all slightly different, but recycling many of the same slides.

Background: A summary about the subject and previous results.
Evolution: Discusses balanced networks and our algorithm for the evolution of small worlds.
Darknets: How we use small-world theory to route in distributed, oblivious, environments.
Double Clustering: Discusses the double clustering graph, a natural way of generating navigable. This video of the double clustering process goes with the talk.

See also a video of Ian Clarke and myself speaking in Berlin (22C3, December 2005).

Scott G. Miller and Oskar Sandberg, "Attacking Peer to Peer Networks," The O'Reilly Peer-to-Peer and Web Services Conference, November 5-8, 2001. Washington DC.
(A set of slides from a presentation that Scott and I gave. I meant to make a paper out of this.)
§