kernel cut metric

[[concept]]

Cut Metric

The cut metric for two graphons (kernels) is given by

δ_{◻} (W, W^{'}) = inf_{φ} | | W^{φ} - W^{'} | |_{◻}

Where $| | \cdot | |_{◻}$ is the cut norm and $W^{φ} (u, v) = W (φ (u), φ (v))$ and $φ$ are measure-preserving bijections (on the unit interval)
^definition

Mentions

File
fully random graphs converge to the graphon in probability
graph sequence converges if and only if the induced graphon sequence converges
weighted sampled graphs converge to the graphon in probability
2025-03-24 graphs lecture 14
2025-03-26 lecture 15

const { dateTime } = await cJS()

return function View() {
	const file = dc.useCurrentFile();
	return <p class="dv-modified">Created {dateTime.getCreated(file)}     ֍     Last Modified {dateTime.getLastMod(file)}</p>
}