##  [Graph Laplacian](/graph-laplacian-0) 

 Definition

A matrix derived from a graph, commonly defined as the degree matrix minus the adjacency matrix, that encodes diffusion-like relations and discrete second-order differences on the node set.

 

 

 

 

 

 





## Principle

Principle

Represent discrete diffusion and quadratic forms on graphs so that flow, smoothness, and cut costs are expressed as bilinear forms of node values.

 

 

 

 

 





## Demonstration

Demonstration

For a graph with degree diagonal D and adjacency A, the combinatorial Laplacian L = D − A yields for a vector x the quadratic form x^T L x = sum over edges (x_i − x_j)^2 / 2, measuring variation across edges.

 

 

 

 

## Misapplication

Misapplication

Using the unnormalized Laplacian without accounting for large degree heterogeneity can bias clustering or diffusion interpretations toward high-degree nodes.

 

 

 

 

 





## Consequence

Consequence

Provides a linear operator whose modal decomposition guides diffusion, partitioning, and smoothing procedures on graphs; many algorithms use its low-frequency modes to reveal community structure.

 

 

 

 

## Reversal

Reversal

A normalized form rescales by node degrees to equalize influence across nodes; conversely, the adjacency matrix emphasizes direct links rather than smoothness.

 

 

 

 

 





## Boundary

Boundary

Formulated primarily for finite undirected graphs; directed graphs, signed edges, and hyperedges require alternative Laplacian definitions or asymmetric generalizations.

 

 

 

 

 





## Semantic Tension

Semantic Tension

Versus adjacency: the Laplacian emphasizes differences and flows between neighboring node values, while adjacency emphasizes direct connection strengths.

 

 

 

 

 





## Synthesis

Synthesis

A degree-aware matrix operator that converts node-value variation into a quadratic cost, serving as the discrete analogue of a second-order differential operator for graph-based diffusion and partitioning.