Saved in:
Bibliographic Details
Main Authors: Grande, Vincent P., Schaub, Michael T.
Format: Preprint
Published: 2023
Subjects:
Online Access:https://arxiv.org/abs/2311.14427
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910383699132416
author Grande, Vincent P.
Schaub, Michael T.
author_facet Grande, Vincent P.
Schaub, Michael T.
contents The rich spectral information of the graph Laplacian has been instrumental in graph theory, machine learning, and graph signal processing for applications such as graph classification, clustering, or eigenmode analysis. Recently, the Hodge Laplacian has come into focus as a generalisation of the ordinary Laplacian for higher-order graph models such as simplicial and cellular complexes. Akin to the traditional analysis of graph Laplacians, many authors analyse the smallest eigenvalues of the Hodge Laplacian, which are connected to important topological properties such as homology. However, small eigenvalues of the Hodge Laplacian can carry different information depending on whether they are related to curl or gradient eigenmodes, and thus may not be comparable. We therefore introduce the notion of persistent eigenvector similarity and provide a method to track individual harmonic, curl, and gradient eigenvectors/-values through the so-called persistence filtration, leveraging the full information contained in the Hodge-Laplacian spectrum across all possible scales of a point cloud. Finally, we use our insights (a) to introduce a novel form of Hodge spectral clustering and (b) to classify edges and higher-order simplices based on their relationship to the smallest harmonic, curl, and gradient eigenvectors.
format Preprint
id arxiv_https___arxiv_org_abs_2311_14427
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Disentangling the Spectral Properties of the Hodge Laplacian: Not All Small Eigenvalues Are Equal
Grande, Vincent P.
Schaub, Michael T.
Algebraic Topology
Machine Learning
The rich spectral information of the graph Laplacian has been instrumental in graph theory, machine learning, and graph signal processing for applications such as graph classification, clustering, or eigenmode analysis. Recently, the Hodge Laplacian has come into focus as a generalisation of the ordinary Laplacian for higher-order graph models such as simplicial and cellular complexes. Akin to the traditional analysis of graph Laplacians, many authors analyse the smallest eigenvalues of the Hodge Laplacian, which are connected to important topological properties such as homology. However, small eigenvalues of the Hodge Laplacian can carry different information depending on whether they are related to curl or gradient eigenmodes, and thus may not be comparable. We therefore introduce the notion of persistent eigenvector similarity and provide a method to track individual harmonic, curl, and gradient eigenvectors/-values through the so-called persistence filtration, leveraging the full information contained in the Hodge-Laplacian spectrum across all possible scales of a point cloud. Finally, we use our insights (a) to introduce a novel form of Hodge spectral clustering and (b) to classify edges and higher-order simplices based on their relationship to the smallest harmonic, curl, and gradient eigenvectors.
title Disentangling the Spectral Properties of the Hodge Laplacian: Not All Small Eigenvalues Are Equal
topic Algebraic Topology
Machine Learning
url https://arxiv.org/abs/2311.14427