two blocks with 1 arc back: where a walk spends its time, against where the arcs are
At its defaults it draws two blocks with 1 arc back: where a walk spends its time, against where the arcs are. Two distributions over the 24 vertices of a two blocks with 1 arc back. The taller bar at each vertex is the stationary distribution of the random walk, computed by 824 power iterations with no subtraction anywhere and checked against Pᵀφ = φ at 9.69·10⁻¹⁵; the narrower one is the out-degree divided by the total, which is what an undirected intuition reaches for. They differ by up to 0.0616, which is 62 per cent of the largest entry. The difference is what makes a directed normalised Laplacian a global object: the degree of a vertex is local and how often a walk visits it is not.
stationary-vs-degree is one function in lib/figures/digraph.js —
arrows — a laplacian that is not symmetric, and the walk that has to be computed before it can be. Everything below came out of it during this build, at
arguments taken from the essays rather than invented for this page. A figure here is the
figure a reader meets in an essay, and if the generator changes, this page changes with it.
At its defaults
Drawn even though every essay passes arguments — which on this site is every essay, at 100% of placements since the standard pass. A default nothing exercises is a trap for the next essay to call this with none, and this is the page where a default that has drifted from the figures around it becomes visible.
Two distributions over the 24 vertices of a two blocks with 1 arc back. The taller bar at each vertex is the stationary distribution of the random walk, computed by 824 power iterations with no subtraction anywhere and checked against Pᵀφ = φ at 9.69·10⁻¹⁵; the narrower one is the out-degree divided by the total, which is what an undirected intuition reaches for. They differ by up to 0.0616, which is 62 per cent of the largest entry. The difference is what makes a directed normalised Laplacian a global object: the degree of a vertex is local and how often a walk visits it is not.
family: "balanced", n: 24
The arguments are the ones A Laplacian that is not symmetric passes. A value nobody placed would be a picture no essay asked for and no claim was ever checked against.
Two distributions over the 24 vertices of a balanced digraph on 24. The taller bar at each vertex is the stationary distribution of the random walk, computed by 434 power iterations with no subtraction anywhere and checked against Pᵀφ = φ at 1.07·10⁻¹⁴; the narrower one is the out-degree divided by the total, which is what an undirected intuition reaches for. On this family they agree to 2.77·10⁻¹⁴, because the digraph is balanced and the closed form says they must. That is the second route the whole construction is checked by.
family: "blocks", n: 24
The arguments are the ones A Laplacian that is not symmetric passes. A value nobody placed would be a picture no essay asked for and no claim was ever checked against.
Two distributions over the 24 vertices of a two blocks with 1 arc back. The taller bar at each vertex is the stationary distribution of the random walk, computed by 824 power iterations with no subtraction anywhere and checked against Pᵀφ = φ at 9.69·10⁻¹⁵; the narrower one is the out-degree divided by the total, which is what an undirected intuition reaches for. They differ by up to 0.0616, which is 62 per cent of the largest entry. The difference is what makes a directed normalised Laplacian a global object: the degree of a vertex is local and how often a walk visits it is not.
What it checked while drawing
Every figure above checked its own claims on the way to being drawn, and a claim that failed
would have stopped the picture rather than shipped a wrong one. Those checks used to leave
no trace at all: a passing one returned true and the only evidence the figure had
checked anything was that nothing crashed. The list below is what they actually said, collected
by running this generator with an observer installed — not a description of
what it is believed to check.
13 distinct claims across 3 sets of arguments, grouped below by shape — because most of them are one sentence with a different number in it, and how many separate times that sentence was put to the test is the informative part.
a balanced digraph's stationary vector IS its degree distribution
a digraph small enough to draw a vertex at a time
a digraph with at least two vertices
a family the library builds
and an unbalanced one's is not
and every entry of it is nonnegative, as a probability must be
and it is stationary, checked against Pᵀφ = φ
arcs inside the vertex set
every entry of a stationary distribution is nonnegative
no repeated arc
no self-loops
positive arc weights
the power iteration reached a stationary vector
Against the rule
The rule does not apply to it. It factorises nothing, so there is no residual it could be withholding. That is worth stating rather than leaving blank: a site that reported the rule as satisfied by every generator would be counting mostly generators the rule never reached.
Across the library: the rule bites on 217
of 397 generators —
199 print a residual and
18 are exempt with a published reason;
180 factorise nothing.
Read from lib/residual-rule.js, which is the same body the gate enforces from,
and the gate's last check fails the build if this page and it disagree about any generator.
Where it is called
Changing this generator changes every figure on this list. That is what makes the list worth publishing rather than keeping in a check script.