weighted graph (sample)

[[concept]]

weighted graphs

Weighted graphs are a way to sample a graph from a graphon. Each node $u_j$ is sampled uniformly at random from the unit interval.

The edges are then defined in the same way as a template graph $[A_n{]}_{ij}=W(u_i,u_j)$

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