Hodge Laplacians on graphs
Information Theory
2019-08-20 v4 math.IT
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 . For the remaining topological aspect, we cast our discussions entirely in terms of graphs as opposed to less-familiar topological objects like simplicial complexes.
Keywords
Cite
@article{arxiv.1507.05379,
title = {Hodge Laplacians on graphs},
author = {Lek-Heng Lim},
journal= {arXiv preprint arXiv:1507.05379},
year = {2019}
}
Comments
30 pages, 8 figures, to appear in SIAM Review