Directed graph — where it appears
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
A Laplacian that is not symmetric
Point the edges and the matrix stops being symmetric. Its row sums are still exactly zero, so the null vector survives; everything built on the quadratic form does not, and the eigenvalues need a plane rather than a line. Asymmetry permits that and does not force it, which the smallest case here demonstrates by being asymmetric and real.
A conductance the arcs do not measure
Symmetrising a directed Laplacian with respect to its walk recovers everything the arrows took — a real spectrum, a sweep cut, a Cheeger inequality. What it does not recover is the quantity: the inequality bounds the probability that a step of the walk crosses the cut, which on one graph here is three times the weight of the arcs that do.
Named alongside it
The objects these essays reach for when they reach for this one.
Graph laplacianQuadratic formStationary distributionCheeger inequalityComplex eigenvaluesConductanceNull spaceSpectral partitioningSymmetry