Graph Laplacian

The graph Laplacian (or Kirchhoff matrix) is a matrix representation of a graph that encodes its connectivity structure and governs diffusion, consensus, and spectral clustering on the network. For a graph with adjacency matrix A and degree matrix D, the Laplacian is L = D − A. Its eigenvalues reveal the graph's connected components, expansion properties, and the rate at which random walks mix. The smallest non-zero eigenvalue — the algebraic connectivity or Fiedler value — determines how well-connected the graph is and how robustly distributed consensus protocols converge. The Laplacian is not merely a linear algebraic tool; it is the bridge between network topology and continuous dynamics, translating discrete connection patterns into differential equations that describe heat flow, opinion formation, and synchronization on networks. Its spectral properties are the reason that topology is a causal variable rather than a passive container.