4.6 Article

Hodge Laplacians on Graph

Journal

SIAM REVIEW
Volume 62, Issue 3, Pages 685-715

Publisher

SIAM PUBLICATIONS
DOI: 10.1137/18M1223101

Keywords

cohomology; Hodge decomposition; Hodge Laplacians; graphs

Funding

  1. AFOSR [FA9550-13-1-0133]
  2. DARPA [D15AP00109]
  3. NSF [IIS 1546413, DMS 1209136, DMS 1057064]

Ask authors/readers for more resources

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 cohornology and Hodge theory is nothing more than the linear algebra of matrices satisfying AB = 0. For the remaining topological aspect, we cast our discussion entirely in terms of graphs as opposed to less familiar topological objects like simplicial complexes.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available