cut norm

[[concept]]

Cut Norm

Let $B$ be a matrix. The cut norm is given as

| | B | |_{◻} = max_{S \subseteq [n], T \subseteq [n]} | \sum_{s \in S, t \in T} B_{t s} |

^definition

File
Convergence in the cut norm implies convergence in L2
Davis-Kahan Theorem
convergence in L-p implies convergence in cut norm
cut distance
graph sequence converges if and only if the induced graphon sequence converges
kernel cut metric
kernel cut norm
2025-03-24 graphs lecture 14
2025-03-26 lecture 15
2025-04-02 lecture 17
2025-04-14 lecture 20

Created 2025-03-24 ֍ Last Modified 2025-09-11