Related papers: Combinatorial and Hodge Laplacians: Similarity and…
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…
Graph disaggregation is a technique used to address the high cost of computation for power law graphs on parallel processors. The few high-degree vertices are broken into multiple small-degree vertices, in order to allow for more efficient…
This paper establishes new eigenvalue bounds for combinatorial Laplacians of simplicial complexes, extending previous results for flag complexes by Lew (2024) and general complexes by Shukla and Yogeshwaran (2020). Using elementary…
A $k$-uniform hypergraph $G=(V,E)$ is called odd-bipartite ([5]), if $k$ is even and there exists some proper subset $V_1$ of $V$ such that each edge of $G$ contains odd number of vertices in $V_1$. Odd-bipartite hypergraphs are…
Graphs with diverse structural characteristics play a central role in modelling and optimization tasks. The ability to generate different types of graphs that exhibit shared properties is likewise essential for algorithm selection and…
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 graph theory there are intimate connections between the expansion properties of a graph and the spectrum of its Laplacian. In this paper we define a notion of combinatorial expansion for simplicial complexes of general dimension, and…
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 introduce a homothetic extension of classical Weyl integrable geometry by generalizing the usual linear gauge transformations to affine homothetic transformations centered at a distinguished harmonic, scale-invariant form $\alpha_d$.…
Laplace operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. Assuming rational independence of edge lengths, necessary and sufficient…
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…
The main goals of this paper are: i) To develop an abstract differential calculus on metric measure spaces by investigating the duality relations between differentials and gradients of Sobolev functions. This will be achieved without…
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…
We develop eigenvalue estimates for the Laplacians on discrete and metric graphs using different types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph…
Recent years have witnessed a fast growth in mathematical artificial intelligence (AI). One of the most successful mathematical AI approaches is topological data analysis (TDA) via persistent homology (PH) that provides explainable AI (xAI)…
We study higher form Proca equations on Einstein manifolds with boundary data along conformal infinity. We solve these Laplace-type boundary problems formally, and to all orders, by constructing an operator which projects arbitrary forms to…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
In this paper, structural properties of chordal graphs are analysed, in order to establish a relationship between these structures and integer Laplacian eigenvalues. We present the characterization of chordal graphs with equal vertex and…
In this contribution, we extend the hybridization framework for the Hodge Laplacian [Awanou et al., Hybridization and postprocessing in finite element exterior calculus, 2023] to port-Hamiltonian systems describing linear wave propagation…
The Hodge decomposition is a fundamental result in differential geometry and algebraic topology, particularly in the study of differential forms on a Riemannian manifold. Despite extensive research in the past few decades,…