Local weak convergence of random graphs and networks
These are slides and related papers for my lectures in the
"Probability at Warwick" Young Researchers Workshop, July 2009.
- Lecture 1: Definitions and examples.
Lecture 2: (i) An "elementary" use in a
combinatorial optimization problem
(table of RDEs);
(ii) mean-field model of distance and Frieze's MST theorem.
- Lecture 3: (i) TSP and transportation problem in the
a network flow model (graph);
(ii) a tractable "complex networks" model.
- Lecture 4: Brief accounts of other uses of LWC;
infinite planar graphs; counting quantities associated with a graph; uniform random
(figure 1 and figure 2).
slides from talks by Antar