GLEE: geometric Laplacian eigenmap embedding

DOI10.1093/COMNET/CNAA007zbMATH Open1435.05149arXiv1905.09763OpenAlexW3105557748WikidataQ126300419 ScholiaQ126300419MaRDI QIDQ5221370FDOQ5221370

Authors: Leo Torres, Kevin S. Chan, Tina Eliassi-Rad 

Publication date: 25 March 2020

Published in: Journal of Complex Networks (Search for Journal in Brave)

Abstract: Graph embedding seeks to build a low-dimensional representation of a graph G. This low-dimensional representation is then used for various downstream tasks. One popular approach is Laplacian Eigenmaps, which constructs a graph embedding based on the spectral properties of the Laplacian matrix of G. The intuition behind it, and many other embedding techniques, is that the embedding of a graph must respect node similarity: similar nodes must have embeddings that are close to one another. Here, we dispose of this distance-minimization assumption. Instead, we use the Laplacian matrix to find an embedding with geometric properties instead of spectral ones, by leveraging the so-called simplex geometry of G. We introduce a new approach, Geometric Laplacian Eigenmap Embedding (or GLEE for short), and demonstrate that it outperforms various other techniques (including Laplacian Eigenmaps) in the tasks of graph reconstruction and link prediction.

Full work available at URL: https://arxiv.org/abs/1905.09763

Recommendations

• Spectral embedding of graphs.
• Graph Embeddings and Laplacian Eigenvalues
• On Whole-Graph Embedding Techniques
• An unsupervised framework for comparing graph embeddings
• Heat kernel embeddings, differential geometry and graph structure

zbMATH Keywords

graph embeddinggraph Laplaciansimplex geometry

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph representations (geometric and intersection representations, etc.) (05C62)

Cited In (2)

• Ranking edges by their impact on the spectral complexity of information diffusion over networks
• A flexible PageRank-based graph embedding framework closely related to spectral eigenvector embeddings

This page was built for publication: GLEE: geometric Laplacian eigenmap embedding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5221370)