Measurement and modeling of the web and related data sets
1 Perfect Simulation and Stationarity of a Class of Mobility Models Jean-Yves Le Boudec (EPFL) & Milan Vojnovic (Microsoft Research Cambridge) IEEE Infocom.
Jennifer Tour Chayes Joint work with N. Berger, C. Borgs, A. Ganesh, A. Saberi, D. B. Wilson Controlling the Spread of Viruses on Power-Law Networks.
1 Graphs over Time Densification Laws, Shrinking Diameters and Possible Explanations Jurij Leskovec, CMU Jon Kleinberg, Cornell Christos Faloutsos, CMU.
The Network Data Structure in Computing
Lecture 21 Network evolution Slides are modified from Jurij Leskovec, Jon Kleinberg and Christos Faloutsos.
1 A System for Outlier Detection and Cluster Repair Ying Liu Dr. Sprague Oct 21, 2005.
Approximation Algorithms for Unique Games Luca Trevisan Slides by Avi Eyal.
CS728 Lecture 5 Generative Graph Models and the Web.
On the randomized simplex algorithm in abstract cubes Jiři Matoušek Charles University Prague Tibor Szabó ETH Zürich.
RandomEdge can be mildly exponential on abstract cubes Jiri Matousek Charles University Prague Tibor Szabó ETH Zürich.
1 The Random Trip Mobility Model Milan Vojnovic (Microsoft Research) Computer Lab Seminar, University of Cambridge, UK, Nov 2004 with Jean-Yves Le Boudec.
