← Series by topic

From graphs to signal processing and GCNs

Follow adjacency matrices and Laplacians through graph Fourier transforms to graph neural networks.

Prerequisites Matrices, eigenvalues, eigenvectors, and basic NumPy.

  1. [Graph Theory] Comparison Between Vector Fields and Graph Operators

    Organizes the theoretical correspondence between the vector field operator div·grad = Δ and the Laplacian matrix in graph theory, as a personal reference note.

  2. [Graph Theory] Graph Laplacian, Eigenvalues, and GFT

    Explains the theory of the graph Laplacian and its eigenvalues, introduces the Graph Fourier Transform (GFT), and its Python implementation.

  3. [Graph Theory] Low-Pass Filters in Graph Signal Processing

    Explains the theory of low-pass filters in graph signal processing based on eigenvalue decomposition and eigenvectors, with a Python implementation.