A graphon is a symmetric, bounded, measurable function
W:[0,1]2→[0,1]
ie, it is a bounded kernel (weighting function).
We can think of a graphon as a graph with an uncountable number of nodes u∈[0,1] and edges (u,v) with weights W(u,v). Alternatively, we can think of a graphon as a model that we can use to sample graphs.
NOTE
A more general definition is
W:Ω×Ω→[0,1]
where Ω is a sample space with some probability measure f. We can always map Ω onto [0,1] using a measure-preserving map (as long as the CDF of f is strictly monotone), so we can use [0,1]2 WLOG.
Exercise
Show that if the CDF of f is strictly monotone, we can map Ω to the interval [0,1] with a measure-preserving map.
Note
The codomain of W may be (0,B] where B∈R<+∞. However, we usually have B=1 since W(u,v) often represents a probability.
Example
From left to right:
block model with same community sizes
different community sizes, and
w(u,v)=exp(σ2(u−v)2)
finish note 2 once lecture 14 notes are released ➕ 2025-03-24 📅 2025-03-27 ✅ 2025-03-24
finish examples once lecture 14 notes are released 📅 2025-03-27 ✅ 2025-03-24
Example
Graphon as a limiting object for some sequence of graphs
Graphon as generating object for finite graphs