Graph Limits and Processes on Networks: From Epidemics to Misinformation Boot Camp
as the organisers put it
This program will bring together experts from various fields to study networks, from graph limits, to modeling and estimation, to processes on networks. Application areas include epidemics, spread of information and other economic and social processes.
who it's for
network scientists, random graph researchers, epidemiologists, economists specializing in networks, applied probabilists, statisticians, public-health modelers
topics
graphons and cut metric; Aldous-Hoover representation; sparse random graph phase transition; local weak convergence; multi-type branching processes; stochastic SIR branching coupling; cascade models and logit dynamics; economic connectedness measures; configuration model degree limits; stochastic block model approximation; finite-sample graphon estimation
| title | author | length |
|---|---|---|
| Graphons and Graph Limits 1 | Christian Borgs | 01h 34m |
Dense graph sequences have a single concrete limit object: graphon = W:[0,1]^2→[0,1], a symmetric feature-kernel that generates inhomogeneous random graphs by… | ||
| Networks and Economics 1 | Matthew Jackson | 01h 30m |
Presents concrete results and tools: threshold coordination games produce multiple equilibria that form a complete lattice; best‑shot public goods equilibria… | ||
| Sparse Random Graphs 1 | Souvik Dhara | 01h 30m |
Erdos–Rényi G(n,p) with p=λ/n exhibits a sharp phase transition at λ=1: λ<1 gives only microscopic components (expected size ≤1/(1−λ), max ~log n), while λ>1… | ||
| Epidemics 2 | Tom Britton | 01h 27m |
Standard stochastic SIR on N individuals is shown to couple to a branching process by constructing IID Poisson contact processes, IID infectious periods and… | ||
| Networks and Economics 2 | Matthew Jackson | 01h 04m |
Uses Facebook data on 72 million users (25–44, 21 billion friendships, ~84% U.S. coverage) to impute incomes and define economic connectedness as share of… | ||
| Influencing Cascades: An Algorithmic View | Amin Saberi | 01h 01m |
Models adoption as asynchronous logit (Glauber) dynamics with inverse-noise beta and a potential function; the main quantitative claim ties the worst-case… | ||
| Sparse Random Graphs 2 | Souvik Dhara | 01h 28m |
Survey of sparse random graphs ties models to concrete thresholds and methods: stochastic block graphs reduce locally to multi-type branching with a giant iff… | ||
| Graphons and Graph Limits 2 | Christian Borgs | 01h 31m |
Defines dense graph limits as graphons and shows that cut metric convergence is equivalent to matching subgraph frequencies, sampled-k distributions… | ||
| Networks and Economics 3 | Matthew Jackson | 01h 32m |
Explains that a simple DeGroot averaging rule yields consensus weights equal to eigenvector centrality, and shows field evidence: targeted seed sets with… | ||
| Locally Convergent Graphs | Christian Borgs | 01h 33m |
Sequence convergence uses the rooted-ball metric: pick a vertex uniformly, record the radius-R ball, and set distance = 1/(R+1) where balls are isomorphic… | ||
| Marrying Graph Convergence and Cascade Models | Yeganeh Ali Mohammadi | 01h 07m |
Shows that for bounded‑degree or large‑set expander graph sequences the critical probability converges and any giant component is unique and has a relative… | ||
| Epidemics 3 | Tom Britton | 01h 41m |
A branching‑process approximation gives the minor‑outbreak probability and the final‑size equation 1−τ = e^{−R0 τ}, and 10,000 simulations at R0=1.5… | ||
| Networks and Economics 4 | Ben Golub | 01h 32m |
Covers three concrete results and methods: network coordination games reduce to matrix R via diagonalization so equilibrium and welfare are quadratic forms… | ||
| Graphons and Graph Limits 3 | Jennifer Chayes | 01h 37m |
Focuses on sparse, unbounded-degree networks and gives concrete convergence definitions and estimators: shows two non-equivalent limits — a rescaled metric… | ||
| nothing matches | ||