Related papers: Hodge Laplacians on graphs
When the theory of Leavitt path algebras was already quite advanced, it was discovered that some of the more difficult questions were susceptible to a new approach using topological groupoids. The main result that makes this possible is…
Hodge theory is a beautiful synthesis of geometry, topology, and analysis, which has been developed in the setting of Riemannian manifolds. On the other hand, spaces of images, which are important in the mathematical foundations of vision…
In this paper we introduce a path complex that can be regarded as a generalization of the notion of a simplicial complex. The main motivation for considering path complexes comes from directed graphs(digraphs). We obtain a new notion of the…
Any graph can be represented pictorially as a figure. Moreover, it can be represented as two or more figures that can be have different properties to each other. For the purpose of HCP, we represent a graph by two such figures. In each of…
We demonstrate that the two (1 + 1)-dimensional (2D) free 1-form Abelian gauge theory provides an interesting field theoretical model for the Hodge theory. The physical symmetries of the theory correspond to all the basic mathematical…
Hypergraphs provide a natural framework for modeling higher-order interactions, yet their theoretical underpinnings in semi-supervised learning remain limited. We provide an asymptotic consistency analysis of variational learning on random…
These are lecture notes for the Current Developments in Mathematics conference at Harvard, November, 2011. We discuss topological, probabilistic and combinatorial aspects of the Laplacian on a graph embedded on a surface. The three main…
Lattice structures play a central role in spectral graph theory, offering analytical insight into diffusion, synchronization, and transport processes on regular discrete spaces. While their spectral properties are completely characterized…
We study symplectic Laplacians on compact symplectic manifolds with boundary. These Laplacians are associated with symplectic cohomologies of differential forms and can be of fourth-order. We introduce several natural boundary conditions on…
In this paper, we develop a diamond graph theory and apply the theory to the (co)homology of the Lie algebra generated by positive systems of the classical semi-simple Lie algebras over the field of complex numbers. As an application, we…
We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and…
Simplicial complexes are generalizations of graphs that describe higher-order network interactions among nodes in the graph. Network dynamics described by graph Laplacian flows have been widely studied in network science and control theory,…
We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph $H$ as a minor to graphs excluding $H$ as a topological subgraph. We prove that for a fixed $H$, every graph excluding $H$ as a topological…
In this text we expose basic cases of some fundamental ideas and methods of topology. Namely, of homotopy, degree, fundamental group, covering, Whitehead invariant, etc. This is done by considering the elementary example: closed polygonal…
Developing methods to process irregularly structured data is crucial in applications like gene-regulatory, brain, power, and socioeconomic networks. Graphs have been the go-to algebraic tool for modeling the structure via nodes and edges…
Let $A$ be a unital commutative associative algebra over a field of characteristic zero, $\k$ be a Lie algebra, and $\z$ a vector space, considered as a trivial module of the Lie algebra $\g := A \otimes \k$. In this paper we give a…
This is a graduate-level introduction to graph theory, corresponding to a quarter-long course. It covers simple graphs, multigraphs as well as their directed analogues, and more restrictive classes such as tournaments, trees and…
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…
We study the Laplacian on family preserving metric graphs. These are graphs that have a certain symmetry that, as we show, allows for a decomposition into a direct sum of one-dimensional operators whose properties are explicitly related to…
Graph theory provides fundamental concepts for many fields of science like statistical physics, network analysis and theoretical computer science. Here we give a pedagogical introduction to graph theory, divided into three sections. In the…