Related papers: Persistent Laplacians: properties, algorithms and …
In this paper, we study the Lagrangian functions for a class of second-order differential systems arising from physics. For such systems, we present necessary and sufficient conditions for the existence of Lagrangian functions. Based on the…
In this paper we study strongly indefinite systems involving the fractional Laplacian on bounded domains. We obtain existence and non-existence results, $a priori$ estimates of Gidas-Spruck type, and the symmetric property.
Hamiltonian tridiagonal matrices characterized by multi-fractal spectral measures in the family of Iterated Function Systems can be constructed by a recursive technique here described. We prove that these Hamiltonians are almost-periodic.…
We consider Laplacians on periodic equilateral metric graphs. The spectrum of the Laplacian consists of an absolutely continuous part (which is a union of an infinite number of non-degenerated spectral bands) plus an infinite number of flat…
Applying a well-known theorem due to Eidelheit, we give a short proof of the surjectivity of the combinatorial Laplacian on connected locally finite undirected simplicial graph $G$ with countably infinite vertex set $V$, established by…
We study computational aspects of algorithmic replicability, a notion of stability introduced by Impagliazzo, Lei, Pitassi, and Sorrell [2022]. Motivated by a recent line of work that established strong statistical connections between…
We consider Laplacians on periodic both discrete and metric equilateral graphs. Their spectrum consists of an absolutely continuous part (which is a union of non-degenerate spectral bands) and flat bands, i.e., eigenvalues of infinite…
In the recent literature, various authors have studied spectral comparison results for Schr\"odinger operators with discrete spectrum in different settings including Euclidean domains and quantum graphs. In this note we derive such spectral…
In this paper we improve the spectral convergence rates for graph-based approximations of Laplace-Beltrami operators constructed from random data. We utilize regularity of the continuum eigenfunctions and strong pointwise consistency…
Most applications of the hard Lefschetz theorem related to combinatorial properties of simplicial complexes involve their $h$-vectors. In the context of positivity properties involving $h$-vectors of flag spheres, $f$-vectors with a…
To each arbitrary given general geometric structure on $\mathbb{R}^{n}$, we associate a pair of compatible Fourier transforms, that prove to appear naturally in the framework of Poisson's summation formula for full lattices. We study their…
We show that the (normalized) symmetric Laplacian of a simple graph can be obtained from the partial trace over a pure bipartite quantum state that resides in a bipartite Hilbert space (one part corresponding to the vertices, the other…
Following ideas of Caffarelli and Silvestre in~\cite{CS}, and using recent progress in hyperbolic fillings, we define fractional $p$-Laplacians $(-\Delta_p)^\theta$ with $0<\theta<1$ on any compact, doubling metric measure space…
Recently, much of the existing work in manifold learning has been done under the assumption that the data is sampled from a manifold without boundaries and singularities or that the functions of interest are evaluated away from such points.…
In this article, we construct bipartite graphs which are cospectral for both the adjacency and normalized Laplacian matrices using partitioned tensor product. This extends the construction of Ji, Gong, and Wang \cite{ji-gong-wang}. Our…
Laplacian spectral kernels and distances (e.g., biharmonic, heat diffusion, wave kernel distances) are easily defined through a filtering of the Laplacian eigenpairs. They play a central role in several applications, such as dimensionality…
In this paper, we give a new and efficient algebraic criterion for the pure as well as non-pure shellability of simplicial complex $\Delta$ over [n]. We also give an algebraic characterization of a leaf in a simplicial complex (defined in…
The pseudo-inverse of a graph Laplacian matrix, denoted as $L^\dagger$, finds extensive application in various graph analysis tasks. Notable examples include the calculation of electrical closeness centrality, determination of Kemeny's…
We introduce and study a new combinatorial invariant the theta-number $\theta(X)$ of simplicial complexes, and prove that the inequality $\mathcal{C}(X)\leq \theta(X)$ holds for every simplicial complex $X$, where $\mathcal{C}(X)$ denotes…
We derive the spectral properties of adjacency matrix of complex networks and of their Laplacian by the replica method combined with a dynamical population algorithm. By assuming the order parameter to be a product of Gaussian…