Related papers: Persistent Laplacians: properties, algorithms and …
The Helmholtzian matrix of a graph $G=(V(G),E(G))$ is a graph-theoretic analogue of the vector Laplacian (or Helmholtz operator) [S. Li, L. Lu, J.F. Wang, A graph discretization of vector Laplacian, 379 (2026) 446--460]. Motivated by the…
We introduce and study Laplacians on a finite metric graph endowed with generalized densities, that is, measures of finite mass. One important motivation is that this setting provides a common framework for several interesting classes of…
We study Laplacians on graphs and networks via regular Dirichlet forms. We give a sufficient geometric condition for essential selfadjointness and explicitly determine the generators of the associated semigroups on all $\ell^p$, $1\leq p <…
We demonstrate that the fractional Laplacian (FL) is the principal characteristic operator of harmonic systems with {\it self-similar} interparticle interactions. We show that the FL represents the "{\it fractional continuum limit}" of a…
Graph Laplacian based algorithms for data lying on a manifold have been proven effective for tasks such as dimensionality reduction, clustering, and denoising. In this work, we consider data sets whose data points lie on a manifold that is…
Laplacian operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. An infinite series of trace formulae is obtained which link together two…
In this paper, we propose a new class of operator factorization methods to discretize the integral fractional Laplacian $(-\Delta)^\frac{\alpha}{2}$ for $\alpha \in (0, 2)$. The main advantage of our method is to easily increase numerical…
We consider a nonlinear flow on simplicial complexes related to the simplicial Laplacian, and show that it is a generalization of various consensus and synchronization models commonly studied on networks. In particular, our model allows us…
In this paper we study Lipschitz regularity of elliptic PDEs on geometric graphs, constructed from random data points. The data points are sampled from a distribution supported on a smooth manifold. The family of equations that we study…
The space Loc(m,S) of rank m flat bundles on a closed surface S is K_2-symplectic. A threefold M bounding S gives rise a K_2-Lagrangian in Loc(m,S) given by the flat bundles on S extending to M. We generalize this, replacing the zero…
Recent work in theoretical computer science and scientific computing has focused on nearly-linear-time algorithms for solving systems of linear equations. While introducing several novel theoretical perspectives, this work has yet to lead…
We discuss Laplacians on graphs in a framework of regular Dirichlet forms. We focus on phenomena related to unboundedness of the Laplacians. This includes (failure of) essential selfadjointness, absence of essential spectrum and stochastic…
The aim of the present article is to give an overview of spectral theory on metric graphs guided by spectral geometry on discrete graphs and manifolds. We present the basic concept of metric graphs and natural Laplacians acting on it and…
We develop a new, systematic approach towards studying the integrability of the ordinary Calogero-Moser-Sutherland models as well as the elliptic Calogero models associated with arbitrary (semi-)simple Lie algebras and with symmetric pairs…
Many of today's problems require techniques that involve the solution of arbitrarily large systems $A\mathbf{x}=\mathbf{b}$. A popular numerical approach is the so-called Greedy Rank-One Update Algorithm, based on a particular tensor…
With each resonance of the Laplacian acting on the compactly supported sections of a homogeneous vector bundle over a Riemannian symmetric space of the non-compact type, One can associate a residue representation. The purpose of this paper…
Normalized Laplacian matrices of graphs have recently been studied in the context of quantum mechanics as density matrices of quantum systems. Of particular interest is the relationship between quantum physical properties of the density…
Simplicial complexes are generalizations of graphs that describe higher-order network interactions among nodes in the graph. Network dynamics described by graph Laplacian flows have been widely studied in network science and control theory,…
We establish several new relations between the discrete transition operator, the continuous Laplacian and the averaging operator associated with combinatorial and metric graphs. It is shown that these operators can be expressed through each…
In this paper, we show several rigidity results for harmonic $(p,q)$-forms in complete K\"{a}hler manifolds. We also give several applications to study non-compact K\"{a}hler manifolds with parallel Bochner tensor or quaternion K\"{a}hler…