The graph Laplacian - Matthew N. Bernstein
At the heart of of a number of important machine learning algorithms, such as spectral clustering, lies a matrix called the graph Laplacian. In this post, I’ll walk through the intuition behind the graph Laplacian and describe how it represents the discrete analogue to the Laplacian operator on continuous multivariate functions.
At the heart of of a number of important machine learning algorithms, such as spectral clustering, lies a matrix called the graph Laplacian. In this post, I’ll walk through the intuition behind the graph Laplacian and describe how it represents the discrete analogue to the Laplacian operator on continuous multivariate functions. Introduction At the heart of the field of spectral graph theory as well as a number of important machine learning algorithms, such as spectral clustering , lies a matrix called the graph Laplacian . (In fact, the first step in spectral clustering is to compute the Lapl
saved by
related reading
- What’s up with the Graph Laplacian? – with high probabilitysamidavies.wordpress.com
- A Gentle Introduction to Graph Neural Networksdistill.pub
- Functions are Vectorsthenumb.at
- Graph Spectrabactra.org
- Understanding Convolutions on Graphsdistill.pub
- Differentiable Programming from Scratchthenumb.at
- Neural Networks, Manifolds, and Topology -- colah's blogcolah.github.io
- Laplacian Mesh Editingpeople.eecs.berkeley.edu
- Fractional Laplacian - Wikipediaen.wikipedia.org
- 1404.5690.pdfarxiv.org
- [2606.23517] Collapsed Effective Operators for Higher-order Structuresarxiv.org
- https://www.deeplearningbook.org/contents/linear_algebra.htmldeeplearningbook.org