kernel cut norm

[[concept]]

cut norm (kernels)

Let $W$ be a kernel in $[0, 1]^{2}$ . Its cut norm is defined as

| | W | |_{◻} = sup_{S, T \subseteq [0, 1]} | \int \int_{S \times T} W (u, v) d u d v |

^definition

Mentions

File
convergence in L-p implies convergence in cut norm
kernel cut metric
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>
}