Graph Laplacian Matrix
A core operator in graph signal processing, defined as the degree matrix minus the adjacency matrix (L = D - A). Its quadratic form measures the smoothness of a signal on a graph, and its eigendecomposition yields the graph Fourier basis.
Timeline (last 90 days)
The purely frequency part of the fast tree transform can approximately diagonalize the graph Laplacian matrix.
The graph Laplacian matrix is defined as L = D - A, where D is the degree matrix and A is the adjacency matrix, and its quadratic form x^T L x = Σ_{(i,j)∈E} (x_i - x_j)^2 measures the smoothness of a signal on the graph.
All Facts (2)
The purely frequency part of the fast tree transform can approximately diagonalize the graph Laplacian matrix.
50%UnverifiedThe graph Laplacian matrix is defined as L = D - A, where D is the degree matrix and A is the adjacency matrix, and its quadratic form x^T L x = Σ_{(i,j)∈E} (x_i - x_j)^2 measures the smoothness of a signal on the graph.
50%