Related papers: Hodge Laplacians on graphs
Hypergraphs are useful mathematical models for describing complex relationships among members of a structured graph, while hyperdigraphs serve as a generalization that can encode asymmetric relationships in the data. However, obtaining…
As key subjects in spectral geometry and combinatorial graph theory respectively, the (continuous) Hodge Laplacian and the combinatorial Laplacian share similarities in revealing the topological dimension and geometric shape of data and in…
The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…
We introduce a homology theory for k-graphs and explore its fundamental properties. We establish connections with algebraic topology by showing that the homology of a k-graph coincides with the homology of its topological realisation as…
Motivated by discrete Laplacian differential operators with various accuracy orders in numerical analysis, we introduce new matrices attached to a simple graph that can be considered graph Laplacians with higher accuracy. In particular, we…
We develop a geometric framework that characterizes the synchronization problem --- the problem of consistently registering or aligning a collection of objects. The theory we formulate characterizes the cohomological nature of…
\"Uberhomology is a recently defined homology theory for simplicial complexes, which yields subtle information on graphs. We prove that bold homology, a certain specialisation of \"uberhomology, is related to dominating sets in graphs. To…
We prove that the cohomology algebra of elliptic arrangements depends only on the poset of layers. In the particular case of braid elliptic arrangements, we study the cohomology as representation and we compute some Hodge numbers. Finally,…
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…
Recent developments in applied algebraic topology can simplify and extend results in graphic statics - the analysis of equilibrium forces, dual diagrams, and more. The techniques introduced here are inspired by recent developments in…
We develop a new, intrinsic, computationally friendly approach to Lie coalgebras through graph coalgebras, which are new and likely to be of independent interest. Our graph coalgebraic approach has advantages both in finding relations…
The chapter provides an introduction to the basic concepts of Algebraic Topology with an emphasis on motivation from applications in the physical sciences. It finishes with a brief review of computational work in algebraic topology,…
In this paper, we construct a bialgebraic and further a Hopf algebraic structure on top of subgraphs of a given graph. Further, we give the dual structure of this Hopf algebraic structure. We study the algebra morphisms induced by graph…
We introduce and study elementary properties of graph homology of algebras. This new homology theory shares many features of cyclic and Hochschild homology. We also define a graph K-theory together with an analog of Chern character.
The aim of this paper is to study the behavior of Hodge-theoretic (intersection homology) genera and their associated characteristic classes under proper morphisms of complex algebraic varieties. We obtain formulae that relate (parametrized…
We study hypergraph visualization via its topological simplification. We explore both vertex simplification and hyperedge simplification of hypergraphs using tools from topological data analysis. In particular, we transform a hypergraph to…
We give a geometric proof of the Decomposition Theorem of Beilinson, Bernstein, Deligne and Gabber for the direct image of the intersection cohomology complex under a proper map of complex algebraic varieties. The method rests on new…
Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…
The graph algebra is a commutative, cocommutative, graded, connected incidence Hopf algebra, whose basis elements correspond to finite simple graphs and whose Hopf product and coproduct admit simple combinatorial descriptions. We give a new…
Homological algebra is often understood as the translator between the world of topology and algebra. However, this branch of mathematics is worth studying by itself, given that it provides fascinating perspectives about other disciplines,…