Grounding — where it appears
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
Also named here as pseudoinverse — the same set of essays touches all of them, so they are one junction rather than several.
The vertex nobody solves for
A Laplacian is singular, so every solve with one has to remove its kernel first. There are three ways, they agree to fourteen digits, and the one everybody uses carries a free parameter that no account of the method mentions and that moves the condition number by nine hundred.
A distance computed by a solve
Effective resistance is the one quantity in this field with no combinatorial route to it — it is defined by a linear system. On a small unweighted graph the answer is a ratio of two integers, so for once the error is known rather than estimated, and every resistance in a graph has to add up to a number fixed in advance.
Named alongside it
The objects these essays reach for when they reach for this one.
Graph laplacianPseudoinverseConditioningConnected componentsDeflationEffective resistanceExact ground truthFoster theoremImportance samplingMatrix tree theoremMetricNormalised laplacian