Related papers: Hodgelets: Localized Spectral Representations of F…
In many data-driven applications, higher-order relationships among multiple objects are essential in capturing complex interactions. Hypergraphs, which generalize graphs by allowing edges to connect any number of nodes, provide a flexible…
Analyzing embedded simplicial complexes, such as triangular meshes and graphs, is an important problem in many fields. We propose a new approach for analyzing embedded simplicial complexes in a subdivision-invariant and isometry-invariant…
In this paper we propose a spectral flow for graph Laplacians, and prove that it counts the number of nodal domains for a given Laplace eigenvector. This extends work done for Laplacians on $\mathbb{R}^n$ to the graph setting. We mention…
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 propose a novel method for constructing Hilbert transform (HT) pairs of wavelet bases based on a fundamental approximation-theoretic characterization of scaling functions--the B-spline factorization theorem. In particular, starting from…
In the interdisciplinary field of network science, a complex-valued network, with edges assigned complex weights, provides a more nuanced representation of relationships by capturing both the magnitude and phase of interactions.…
Recently, J. Streets and G. Tian introduced a natural way to evolve an almost-K\"ahler manifold called the symplectic curvature flow, in which the metric, the symplectic structure and the almost-complex structure are all evolving. We study…
We present a novel theoretical framework connecting k-component edge connectivity with spectral graph theory and homology theory to pro vide new insights into the resilience of real-world networks. By extending classical edge connectivity…
Given i.i.d. observations uniformly distributed on a closed submanifold of the Euclidean space, we study higher-order generalizations of graph Laplacians, so-called Hodge Laplacians on graphs, as approximations of the Laplace-Beltrami…
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…
Bipartite graphs are a fundamental concept in graph theory with diverse applications. A graph is bipartite iff it contains no odd cycles, a characteristic that has many implications in diverse fields ranging from matching problems to the…
I humbly introduce a concept I call "Fregean flows," a graph theoretic representation of classical logic, to show how higher-dimensional graph characteristics might be useful to prove or perhaps at best show the provability of simple…
Convolutional layers within graph neural networks operate by aggregating information about local neighbourhood structures; one common way to encode such substructures is through random walks. The distribution of these random walks evolves…
Graph embeddings, wherein the nodes of the graph are represented by points in a continuous space, are used in a broad range of Graph ML applications. The quality of such embeddings crucially depends on whether the geometry of the space…
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…
A traditional wavelet is a special case of a vector in a separable Hilbert space that generates a basis under the action of a system of unitary operators defined in terms of translation and dilation operations. A Coxeter/fractal-surface…
We introduce and develop the theory of spectral networks in real contact and symplectic topology. First, we establish the existence and pseudoholomorphic characterization of spectral networks for Lagrangian fillings in the cotangent bundle…
A new method is presented for the construction of a natural continuous wavelet transform on the sphere. It incorporates the analysis and synthesis with the same wavelet and the definition of translations and dilations on the sphere through…
We introduce a novel harmonic analysis for functions defined on the vertices of a strongly connected directed graph of which the random walk operator is the cornerstone. As a first step, we consider the set of eigenvectors of the random…
Many fundamental structures of Riemannian geometry have found discrete counterparts for graphs or combinatorial ones for simplicial complexes. These include those discussed in this survey, Hodge theory, Morse theory, the spectral theory of…