Related papers: Hodge Decompositions for Weighted Hypergraphs
We introduce a notion of harmonic chain for chain complexes over fields of positive characteristic. A list of conditions for when a Hodge decomposition theorem holds in this setting is given and we apply this theory to finite CW complexes.…
In this paper we introduce and study the topology of clique complexes of multigraphs without loops. These clique complexes generalize tournaplexes, which were recently introduced by Govc, Levi, and Smith for the topological study of brain…
The magnitude homology, introduced by R. Hepworth and S. Willerton, offers a topological invariant that enables the study of graph properties. Hypergraphs, being a generalization of graphs, serve as popular mathematical models for data with…
A simplicial complex is a generalization of a graph: a collection of n-ary relationships (instead of binary as the edges of a graph), named simplices. In this paper, we develop a new tool to study the structure of simplicial complexes: we…
This paper uses the technology of weighted and regular triangulations to study discrete versions of the Laplacian on piecewise Euclidean manifolds. Regular triangulations are studied in some detail, including flip algorithms. The Laplacian…
We propose principled Gaussian processes (GPs) for modeling functions defined over the edge set of a simplicial 2-complex, a structure similar to a graph in which edges may form triangular faces. This approach is intended for learning…
We describe recent achievements in the theory of weight systems, which are functions on chord diagrams satisfying so-called $4$-term relations. Our main attention is devoted to constructions of weight systems. The two main sources of these…
Recently, neural network architectures have been developed to accommodate when the data has the structure of a graph or, more generally, a hypergraph. While useful, graph structures can be potentially limiting. Hypergraph structures in…
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…
In this article we study the Hamiltonian non-displaceability of Gauss images of isoparametric hypersurfaces in the spheres as Lagrangian submanifolds embedded in complex hyperquadrics.
Modular graph forms (MGFs) are a class of non-holomorphic modular forms which naturally appear in the low-energy expansion of closed-string genus-one amplitudes and have generated considerable interest from pure mathematicians. MGFs satisfy…
We study the mixed formulation of the abstract Hodge Laplacian on axisymmetric domains with general data through Fourer-finite-element-methods in weighted functions spaces. Closed Hilbert complexes and commuting projectors are used through…
We compute numerically the homology of several graph complexes in low loop orders, extending previous results.
We construct Hodge filtered cohomology groups for complex manifolds that combine the topological information of generalized cohomology theories with geometric data of Hodge filtered holomorphic forms. This theory provides a natural…
In this paper, we generalize the embedded homology groups of hypergraphs initially given in [S. Bressan, J. Li, S. Ren, and J. Wu, The embedded homology of hypergraphs and applications, Asian J. Math. 23(3)(2019) 479-500] and study the…
We propose a weighted common subgraph (WCS) matching algorithm to find the most similar subgraphs in two labeled weighted graphs. WCS matching, as a natural generalization of the equal-sized graph matching or subgraph matching, finds wide…
To cope with the intractability of answering Conjunctive Queries (CQs) and solving Constraint Satisfaction Problems (CSPs), several notions of hypergraph decompositions have been proposed -- giving rise to different notions of width,…
In real-world systems, the relationships and connections between components are highly complex. Real systems are often described as networks, where nodes represent objects in the system and edges represent relationships or connections…
Consider the following iterated process on a hypergraph $H$. Each vertex $v$ has an initial vertex weight. At each step, we uniformly at random select an edge $F$ in $H$, and for each vertex $v$ in $F$ we replace the weight of $v$ by the…
We construct a functorial decomposition of de Rham cohomology sheaves, called weight decomposition, for smooth analytic spaces over non-Archimedean fields embeddable into $\mathbf{C}_p$, which generalizes a construction of Berkovich and…