Graph Laplacian
Tags: #machine learning #graph #GNNEquation
$$L=I_{N}D^{\frac{1}{2}}AD^{\frac{1}{2}} \\ L=U\Lambda U^{T}$$Latex Code
L=I_{N}D^{\frac{1}{2}}AD^{\frac{1}{2}} \\ L=U\Lambda U^{T}
Have Fun
Let's Vote for the Most Difficult Equation!
Introduction
Equation
Latex Code
L=I_{N}D^{\frac{1}{2}}AD^{\frac{1}{2}} \\ L=U\Lambda U^{T}
Explanation
Graph Laplacian matrix equals to the identity matrix I minus the matrix multiplication of three parts, the (1/2) power of the degree matrix D, the adjacency matrix A, and (1/2) power of degree matrix D. U is the eigenvectors of the normalized graph Laplacian L. The graph laplacian come from the graph Fourier transform F. The original signal x is first transformed to domain F(X) and inverse resulted signal is transformed back using the inverse graph Fourier transform F^{1}.
Related Documents
Related Videos
Discussion
Comment to Make Wishes Come True
Leave your wishes (e.g. Passing Exams) in the comments and earn as many upvotes as possible to make your wishes come true

Gerald MorganA pass on this exam would mean the world to me.Paul Martin reply to Gerald MorganBest Wishes.20230515 00:00:00.0 
Evelyn NelsonIf only I could pass this exam with flying colors.Sarah Rodriguez reply to Evelyn NelsonNice~20230615 00:00:00.0 
Sara DuncanI hope I've studied enough to pass this test.Kathryn Olson reply to Sara DuncanNice~20230225 00:00:00.0
Reply