template graphs converge to the graphon

[[concept]]

Theorem

Let $\{G_n\}$ be a sequence of template graphs sampled from graphon $W$. Then $G_n\to W$ as $n\to \infty$.

Proof

Trivial

• The definition of template graphs is fully deterministic, so there is no randomness here. Since this is the reverse idea of thinking of graphons as graphs with uncountable number of nodes, it is easy to see that the induced graphons $W_n$ converge to $W$ in an $L_2$ way and convergence in L-p implies convergence in cut norm

Mentions

Mentions

TABLE
FROM [[]]
 
FLATTEN choice(contains(artist, this.file.link), 1, "") + choice(contains(author, this.file.link), 1, "") + choice(contains(director, this.file.link), 1, "") + choice(contains(source, this.file.link), 1, "") as direct_source
 
WHERE !direct_source

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>
}