Related papers: Hodge Laplacians on Weighted Simplicial Complexes:…
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…
We consider a non self-adjoint Laplacian on a directed graph with non symmetric edge weights. We analyse spectral properties of this Laplacian under a Kirchhoff assumption. Moreover we establish isoperimet-ric inequalities in terms of the…
We prove uniform resolvent estimates in weighted $L^2$-spaces for the sublaplacian $\mathcal{L}$ on the Heisenberg group $\mathbb{H}^d$. The proof are based on multiplier methods, and strongly rely on the use of horizontal multipliers and…
The rich spectral information of the graph Laplacian has been instrumental in graph theory, machine learning, and graph signal processing for applications such as graph classification, clustering, or eigenmode analysis. Recently, the Hodge…
As a discretization of the Hodge Laplacian, the combinatorial Laplacian of simplicial complexes has garnered significant attention. In this paper, we study combinatorial Laplacians for complex pairs $(X, A)$, where $A$ is a subcomplex of a…
For graphs there exists a strong connection between spectral and combinatorial expansion properties. This is expressed, e.g., by the discrete Cheeger inequality, the lower bound of which states that $\lambda(G) \leq h(G)$, where…
In this work we introduce a concept of complexity for undirected graphs in terms of the spectral analysis of the Laplacian operator defined by the incidence matrix of the graph. Precisely, we compute the norm of the vector of eigenvalues of…
We introduce a categorical framework for diffusion on network-structured data valued in weighted lattices, extending the Laplacian paradigm beyond the category of Hilbert spaces. Central to our approach is the Lawvere Laplacian, an…
We first develop a general framework for Laplace operators defined in terms of the combinatorial structure of a simplicial complex. This includes, among others, the graph Laplacian, the combinatorial Laplacian on simplicial complexes, the…
The problem of approximating the discrete spectra of families of self-adjoint operators that are merely strongly continuous is addressed. It is well-known that the spectrum need not vary continuously (as a set) under strong perturbations.…
We present a new efficient analytical approximation scheme to two-point boundary value problems of ordinary differential equations (ODEs) adapted to the study of the derivative expansion of the exact renormalization group equations. It is…
In the context of a weighted graph with vertex set $V$ and bounded vertex degree, we give a sufficient condition for the essential self-adjointness of the operator $\Delta_{\sigma}+W$, where $\Delta_{\sigma}$ is the magnetic Laplacian and…
Given a finite, simple, connected graph $G=(V,E)$ with $|V|=n$, we consider the associated graph Laplacian matrix $L = D - A$ with eigenvalues $0 = \lambda_1 < \lambda_2 \leq \dots \leq \lambda_n$. One can also consider the same graph…
In this paper, we introduce the notion of oriented faces especially triangles in a connected oriented locally finite graph. This framework then permits to define the Laplace operator on this structure of the 2-simplicial complex. We develop…
We consider an arbitrary selfadjoint operator on a separable Hilbert space. To this operator we construct an expansion in generalized eigenfunctions in which the original Hilbert space is decomposed as a direct integral of Hilbert spaces…
This thesis generalizes the differential operators on standard oriented graphs and oriented hypergraphs introduced in 10.1137/15M1022793 and arXiv:2007.00325. The extended concepts of gradients, adjoints and $p$-Laplacians for vertices and…
In this note, we study Laplacians on graphs for which connectivity within certain subgraphs tends to infinity. Our main focus are graphs sharing a common node set on which edge weights within certain clusters grow to infinity. As…
We prove a generalization of the Expander Mixing Lemma for arbitrary (finite) simplicial complexes. The original lemma states that concentration of the Laplace spectrum of a graph implies combinatorial expansion (which is also referred to…
We prove a Hardy inequality for uniformly elliptic operators subject to Dirichlet or mixed boundary conditions on domains $\Omega$ with piecewiese smooth boundary in arbitrary Riemannian Manifolds (M, g). Employing an approach of E.B.…
In this paper, we develop a novel weighted Laplacian method, which is partially inspired by the theory of graph Laplacian, to study recent popular graph problems, such as multilevel graph partitioning and balanced minimum cut problem, in a…