Related papers: Persistent Laplacians: properties, algorithms and …
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…
Classical simplicial cohomology on a simplicial complex G deals with functions on simplices x in G. Quadratic cohomology deals with functions on pairs of simplices (x,y) in G x G that intersect. If K,U is a closed-open pair in G, we prove…
This paper considers the problem of estimating high dimensional Laplacian constrained precision matrices by minimizing Stein's loss. We obtain a necessary and sufficient condition for existence of this estimator, that consists on checking…
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…
The Laplacian spectral recursion, satisfied by matroid complexes and shifted complexes, expresses the eigenvalues of the combinatorial Laplacian of a simplicial complex in terms of its deletion and contraction with respect to vertex e, and…
We establish a symmetrization procedure in a context of general orthogonal expansions associated with a second order differential operator $L$, a `Laplacian'. Combined with a unified conjugacy scheme furnished in our earlier article it…
We adapt modulus of continuity estimates to the study of spectra of combinatorial graph Laplacians, as well as the Dirichlet spectra of certain weighted Laplacians. The latter case is equivalent to stoquastic Hamiltonians and is of current…
Graph Laplacians as well as related spectral inequalities and (co-)homology provide a foray into discrete analogues of Riemannian manifolds, providing a rich interplay between combinatorics, geometry and theoretical physics. We apply some…
There are two main notions of a Laplacian operator associated with graphs: discrete graph Laplacians and continuous Laplacians on metric graphs (widely known as quantum graphs). Both objects have a venerable history as they are related to…
We consider higher-dimensional generalizations of the normalized Laplacian and the adjacency matrix of graphs and study their eigenvalues for the Linial-Meshulam model $X^k(n,p)$ of random $k$-dimensional simplicial complexes on $n$…
Determining whether an abstract simplicial complex, a discrete object often approximating a manifold, contains multi-dimensional holes is a task deeply connected to quantum mechanics and proven to be QMA1-hard by Crichigno and Kohler. This…
Hamiltonian systems of ordinary and partial differential equations are fundamental mathematical models spanning virtually all physical scales. A critical property for the robustness and stability of computational methods in such systems is…
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…
N-site-lattice Hamiltonians H are introduced and perceived as a set of systematic discrete approximants of a certain PT-symmetric square-well-potential model with the real spectrum and with a non-Hermiticity which is localized near the…
In this article we study the strong unique continuation property for solutions of higher order (variable coefficient) fractional Schr\"odinger operators. We deduce the strong unique continuation property in the presence of subcritical and…
Persistence diagrams serve as a core tool in topological data analysis, playing a crucial role in pathological monitoring, drug discovery, and materials design. However, existing quantum topological algorithms, such as the LGZ algorithm,…
We describe a simple algorithm for estimating the $k$-th normalized Betti number of a simplicial complex over $n$ elements using the path integral Monte Carlo method. For a general simplicial complex, the running time of our algorithm is…
We develop a potential-theoretic and functional framework for the fractional--logarithmic Laplacian $(-\Delta)^{s+\ln}$ and its inhomogeneous counterpart $(\lambda I-\Delta)^{s+\ln}$ with $\lambda>1$. Their inverses yield logarithmic…
We introduce the signless 1-Laplacians and the dual Cheeger constants on simplicial complexes. The connection of its spectrum to the combinatorial properties like independence number, chromatic number and dual Cheeger constant is…
Linear system solving is one of the main workhorses in applied mathematics. Recently, theoretical computer scientists have contributed sophisticated algorithms for solving linear systems with symmetric diagonally dominant matrices (a class…