On a finite undirected graph, stationary probability is proportional to vertex degree. The example is deliberately concrete; it is a test of the statement, not a substitute for it.
Notation
The graph Laplacian \(L=D-A\) is positive semidefinite and turns combinatorial connectivity into linear algebra. A random walk uses \(P=D^{-1}A\) when degrees are positive.
A reliable calculation names domain and codomain. The notation \(\mathsf{data}\mapsto\mathsf{claim}\) is harmless only after both \(\operatorname{dom}\) and \(\operatorname{cod}\) have been fixed.
Stress the formula
The following line is the smallest calculation that still exercises the mechanism. It keeps nested delimiters and the order of operations explicit.
Interpretation
What survives the example is not its particular numbers but the relation encoded by the two rows below. That relation is the part worth transporting to a new setting.
Limit of the argument
Normalized and unnormalized Laplacians have different eigenvalues and orthogonality measures. Formulas must state which one is being used.
With the dependency made explicit, the same pattern can be recognised safely in nearby problems. A changed hypothesis should now be easy to spot.