Presentations Remco van der Hofstad


  1. Small-worlds, complex networks and random graphs.
    ALEA in Europe School, CIRM, Luminy, October 21-25, 2013, (3 times 60 minutes).
  2. Optimal flows in random networks.
    Summer School on `Network Science', Interdisciplinary Mathematics Institute, University of South Carolina, May 19-31, 2013 (5 times 60 minutes).
  3. Optimal flows in random networks.
    Oberwolfach Seminar `Random Networks', Oberwolfach, May 20-24 2013 (3 times 90 and 2 times 60 minutes).
  4. Random Graphs and Complex Networks: small worlds and percolation
    Cornell Summer School in Probability, July 16-30, 2012, (6 times 75 minutes).
  5. Recent developments in high-dimensional percolation.
    Combinatorics and Analysis in Spatial Probability, December 13-17, 2010, EURANDOM.
  6. Shortest-weight routing on random graphs.
    Robustness of Complex Networks, November 14-November 16, 2010, Delft University of Technology.
    Video of presentation.
  7. Processes on random graphs: routing and attack vulnerability.
    Transparencies of tutorial (3 times 45 minutes) Stochastic Processes in Communication Networks for Young Researchers June 7-11, 2010
  8. Mean-field behavior of percolation above the upper critical dimension.
    Transparencies of mini-course Institut Henri Poicare, Paris, October 21-29, 2009 (10 hours).
  9. Critical percolation in high dimensions: critical exponents, finite size scaling and random walks.
    Transparencies of Hypathie Lectures, Marseille, October 16, 2009 (jointly with Asaf Nachmias).
  10. Critical behavior in inhomogeneous random graphs.
    Transparencies of Mathematics Colloquium, University of Amsterdam, September 30, 2009.
  11. Critical behavior in inhomogeneous random graphs.
    Transparencies of lecture in EMS meeting, Toulouse, July 20-24, 2009.
  12. First passage percolation on random graphs.
    Transparencies of lecture in `Order, disorder and double disorder' workshop, EURANDOM, August 22-26, 2009.
  13. Random graph asymptotics on high-d tori: structure of large critical clusters.
    ETH Probability Seminar, ETH Zurich, May 20, 2009.
  14. Random graphs and complex networks.
    Transparencies of lectures Honours Class, spring 2008.
  15. Random Graphs and Complex Networks.
    Kaleidoscoopdag, Leiden, May 16, 2007.
  16. An expansion for self-interacting random walks.
    Delft Probability and Statistics Seminar, May 9, 2007.
  17. Random graph asymptotics on high-dimensional tori.
    Vilnius Conference on Probability, June 26-30, 2006.
  18. Random subgraphs of finite graphs.
    Meeting on Stochastic-Geometric and Combinatorial Ideas in Statistical Mechanics, Gothenburg, June 21-25, 2004.
  19. Self-avoiding walks and percolation above the upper critical dimension.
    PhD-spring School, Hilversum, May 10-12, 2004.