Graph Laplacian

لابلاسيان الرسم البياني

مصفوفة L = D − A حيث D مصفوفة الدرجات وA مصفوفة التجاور. تحليلها الذاتي يكشف الترددات الطبيعية للرسم البياني ويُستخدم لتعريف تحويل فورييه عليه.

The matrix L = D − A where D is the degree matrix and A the adjacency matrix. Its eigendecomposition reveals the graph's natural frequencies and defines a Fourier transform on the graph.

Also translated asمصفوفة لابلاس للرسم البياني، مشغّل لابلاس الرسومي

First appears in this corpus in: On Spectral Clustering: Analysis and an Algorithm (2001)

Appears in these papers

Semi-Supervised Classification with Graph Convolutional Networks2017 in the sky ✦
Semi-Supervised Classification with Graph Convolutional Networks2017 in the sky ✦
The Graph Neural Network Model2009 in the sky ✦
Neural Message Passing for Quantum Chemistry2017 in the sky ✦
On Spectral Clustering: Analysis and an Algorithm2001 in the sky ✦
On Spectral Clustering: Analysis and an Algorithm2001 in the sky ✦
Spectral Networks and Deep Locally Connected Networks on Graphs2014 in the sky ✦
Spectral Networks and Deep Locally Connected Networks on Graphs2014 in the sky ✦