Related papers: Hodge Laplacians on graphs
Weighted hypergraphs are generalizations of weighted simplicial complexes. In recent years, weighted Laplacians of weighted simplicial complexes have been studied. In 2016, as a generalization of the homology of simplicial complexes, the…
For any type of fundamental groupoid scheme, we construct an algebraic cohomology theory for varieties with coefficients in the base field. This is a minor variant of \'etale cohomology, involving neither de Rham complexes nor…
We propose an algebraic study of the simple graph isomorphism problem. We define a Hopf algebra from an explicit realization of its elements as formal power series. We show that these series can be evaluated on graphs and count occurrences…
This paper is mainly a semi-tutorial introduction to elementary algebraic topology and its applications to Ising-type models of statistical physics, using graphical models of linear and group codes. It contains new material on systematic…
We define an algebraic setup of homology for hypergraphs, which defaults to simplicial homology in the case of graphs, and study its basic properties. As part of our study we define algebraic spanning trees of hypergraphs, along with…
This is an introduction to graph theory, from a geometric and analytic viewpoint. A finite graph $X$ is described by its adjacency matrix $d\in M_N(0,1)$, which can be thought of as being a kind of discrete Laplacian, and we first discuss…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
Hodge Laplacians have been previously proposed as a natural tool for understanding higher-order interactions in networks and directed graphs. Here we introduce a Hodge-theoretic approach to spectral theory and dimensionality reduction for…
While topological data analysis has emerged as a powerful paradigm for structural inference, its foundational tools, notably persistent homology and the persistent Laplacian, are frequently insensitive to localized structural fluctuations…
Focusing on coupling between edges, we generalize the relationship between the normalized graph Laplacian and random walks on graphs by devising an appropriate normalization for the Hodge Laplacian -- the generalization of the graph…
We develop a framework that systematically casts the solvability and uniqueness conditions of linearized geometric boundary-value problems into cohomological terms. The theory is designed to be applicable without assumptions on the…
Network topology matrices are algebraic representations of graphs that are widely used in modeling and analysis of various applications including electrical circuits, communication networks and transportation systems. In this paper, we…
In recent years, attempts to generalize lattice gauge theories to model topological order have been carried out through the so called $2$-gauge theories. These have opened the door to interesting new models and new topological phases which…
Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological drawing of the planar part of a graph allows representing…
We study abelian lattice gauge theory defined on a simplicial complex with arbitrary topology. The use of dual objects allows one to reformulate the theory in terms of new dynamical variables; however, we avoid the use of the dual lattice…
Recent work in Topological Deep Learning (TDL) seeks to generalize graph learning's preeminent $message \ passing$ paradigm to more complex relational structures: simplicial complexes, cell complexes, hypergraphs, and combinations thereof.…
This paper introduces a novel topology, referred to as the star topology, on finite graphs. By treating vertices and edges as points in a unified space, we explore continuous maps between Bare representations of a graph and their…
Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations between vertices at different resolutions, all at once. This concept is central towards detection of higher…
In this paper we study the homology and cohomology of confguration spaces of two distinct particles on a graph. Our main tool is intersection theory for cycles in graphs. We obtain an explicit description of the cohomology algebra of the…
The Hodge theory of complex algebraic varieties is at heart a transcendental comparison of two algebraic structures. We survey the recent advances bounding this transcendence, mainly due to the introduction of o- minimal geometry as a…