Hodge Laplacians on graphs

Abstract

This is an elementary introduction to the Hodge Laplacian on a graph, a higher-order generalization of the graph Laplacian. We will discuss basic properties including cohomology and Hodge theory. The main feature of our approach is simplicity, requiring only knowledge of linear algebra and graph theory. We have also isolated the algebra from the topology to show that a large part of cohomology and Hodge theory is nothing more than the linear algebra of matrices satisfying $AB=0$. For the remaining topological aspect, we cast our discussions entirely in terms of graphs as opposed to less-familiar topological objects like simplicial complexes.

30 pages, 8 figures, to appear in SIAM Review

References in corpus (2)

• Geometric deep learning: going beyond Euclidean data
• Graph Isomorphism in Quasipolynomial Time

Cited by in corpus (13)

• Geometric deep learning: going beyond Euclidean data
• Topological Signal Processing over Simplicial Complexes
• Flow Smoothing and Denoising: Graph Signal Processing in the Edge-Space
• Differentiable Physics-informed Graph Networks
• Quantum algorithm for persistent Betti numbers and topological data analysis
• Balanced Hodge Laplacians Optimize Consensus Dynamics over Simplicial Complexes
• Quantum Topological Data Analysis with Linear Depth and Exponential Speedup
• The Geometry of Synchronization Problems and Learning Group Actions
• Harmonic holes as the submodules of brain network and network dissimilarity
• Winding number and Cutting number of Harmonic cycle
• Multiscale Projective Coordinates via Persistent Cohomology of Sparse Filtrations
• Adaptive directional Haar tight framelets on bounded domains for digraph signal representations
• Representation of functions on big data associated with directed graphs