What’s up with the Graph Laplacian? – with high probability
This is a guest post written by my friend, Jeremy Kun! He’s the author of the popular blog Math ∩ Programming, your go-to site for learning about algorithms, machine learning, cryptography, a…
This is a guest post written by my friend, Jeremy Kun! He’s the author of the popular blog Math ∩ Programming , your go-to site for learning about algorithms, machine learning, cryptography, and so much more. There’s a deep connection in mathematics between a graph (a set of vertices and edges), and the algebraic properties of special matrices associated with that graph. Here’s the simplest example of this phenomenon. Say you take an undirected graph and you let be its adjacency matrix, where if is an edge, and otherwise. The matrix is an square matrix with . The remarkable f
saved by
related reading
- The graph Laplacian - Matthew N. Bernsteinmbernste.github.io
- Graph Spectrabactra.org
- A Gentle Introduction to Graph Neural Networksdistill.pub
- Understanding Convolutions on Graphsdistill.pub
- Six (and a half) intuitions for KL divergence — LessWronglesswrong.com
- The $25 000 000 000 Eigenvectorrose-hulman.edu
- Functions are Vectorsthenumb.at
- GraphTheoreticProperties.pdfcs.rice.edu
- Pen and Paper Exercises in Machine Learningarxiv.org
- 1404.5690.pdfarxiv.org
- Differentiable Programming from Scratchthenumb.at
- [2606.23517] Collapsed Effective Operators for Higher-order Structuresarxiv.org