English
Related papers

Related papers: Hodge Laplacians on Weighted Simplicial Complexes:…

200 papers

We work in the setting of infinite, not necessarily locally finite, weighted graphs. We give a sufficient condition for the essential self-adjointness of (discrete) Schr\"odinger operators $\mathcal{L}_{V}$ that are not necessarily lower…

Spectral Theory · Mathematics 2025-10-02 Ognjen Milatovic

We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…

Combinatorics · Mathematics 2012-02-01 Frank Bauer

We present a new approach to the theory of k-forms on self-similar fractals. We work out the details for two examples, the standard Sierpinski gasket and the 3-dimensional Sierpinski gasket, but the method is expected to be effective for…

Classical Analysis and ODEs · Mathematics 2012-06-07 Skye Aaron , Zach Conn , Robert Strichartz , Hui Yu

We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…

Data Structures and Algorithms · Computer Science 2014-10-10 Alistair Sinclair , Piyush Srivastava , Daniel Štefankovič , Yitong Yin

We study Harper operators and the closely related discrete magnetic Laplacians (DML) on a graph with a free action of a discrete group, as defined by Sunada. A main result in this paper is that the spectral density function of DMLs…

Functional Analysis · Mathematics 2007-05-23 V. Mathai , S. Yates

The term interlacing refers to systematic inequalities between the sequences of eigenvalues of two operators defined on objects related by a specific oper- ation. In particular, knowledge of the spectrum of one of the objects then implies…

Spectral Theory · Mathematics 2011-12-12 Danijela Horak , Jürgen Jost

In this article we prove a generalization of Weyl's criterion for the spectrum of a self-adjoint nonnegative operator on a Hilbert space. We will apply this new criterion in combination with Cheeger-Fukaya-Gromov and Cheeger-Colding theory…

Differential Geometry · Mathematics 2018-01-10 Nelia Charalambous , Zhiqin Lu

It is proven following [18[ that Laplacians with standard vertex continuous on metric trees and with standard and Dirichlet conditions on arbitrary metric graphs possess an infinite sequence of simple eigenvalues with the eigenfunctions not…

Spectral Theory · Mathematics 2022-01-19 Pavel Kurasov

We prove generalized Gaffney inequalities and the discrete compactness for finite element differential forms on $s$-regular domains, including general Lipschitz domains. In computational electromagnetism, special cases of these results have…

Numerical Analysis · Mathematics 2018-07-18 Juncai He , Kaibo Hu , Jinchao Xu

In this article, the Hodge decomposition for any degree of differential forms is investigated on the whole space $\mathbb{R}^n$ and the half-space $\mathbb{R}^n_+$ on different scale of function spaces namely homogeneous and inhomogeneous…

Analysis of PDEs · Mathematics 2023-03-08 Anatole Gaudin

Graph Laplacians computed from weighted adjacency matrices are widely used to identify geometric structure in data, and clusters in particular; their spectral properties play a central role in a number of unsupervised and semi-supervised…

Spectral Theory · Mathematics 2020-07-14 Franca Hoffmann , Bamdad Hosseini , Assad A. Oberai , Andrew M. Stuart

In this paper, we will establish elliptic regularity estimates on families of gravitational instantons whose model metric near infinity collapse to a flat 3 dimensional space. We show that the constants in these estimates can be chosen…

Differential Geometry · Mathematics 2024-06-24 Willem Adriaan Salm

In this article we give a geometrical description of the (in general non-selfadjoint) in/out Laplacian $\mathcal{L}^{+/-} = (d^{+/-})^* d$ and adjacency matrix on digraphs with arbitrary weights, where $(d^{+/-})^*$ is the adjoint of the…

Combinatorics · Mathematics 2024-02-22 Fernando Lledó , Ignacio Sevillano

We study the family of intersection graphs of low density objects in low dimensional Euclidean space. This family is quite general, and includes planar graphs. We prove that such graphs have small separators. Next, we present efficient…

Computational Geometry · Computer Science 2016-06-01 Sariel Har-Peled , Kent Quanrud

This paper investigates the use of methods from partial differential equations and the Calculus of variations to study learning problems that are regularized using graph Laplacians. Graph Laplacians are a powerful, flexible method for…

Machine Learning · Statistics 2020-06-30 Nicolas Garcia Trillos , Ryan Murray

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$…

Combinatorics · Mathematics 2015-08-26 Anna Gundert , Uli Wagner

We consider a non self-adjoint Laplacian on a directed graph with non symmetric weights on edges. We give a criterion for the m-accretiveness and the m-sectoriality of this Laplacian. Our results are based on a comparison of this operator…

Spectral Theory · Mathematics 2019-06-19 Colette Anné , Marwa Balti , Nabila Torki-Hamza

We consider periodic Schr\"{o}dinger operators on the hexagonal lattice with self-adjoint vertex conditions that allow discontinuity and concentrated mass at the vertices. This model generalizes the periodic Schr\"{o}dinger operator on the…

Spectral Theory · Mathematics 2025-09-29 Mahmood Ettehad , Burak Hatinoğlu

In this article, we prove gradient estimates under Bakry-Emery curvature bounds for unbounded graph Laplacians which satisfy an ellipticity assumption. As applications, we study completeness and finiteness of stochastically complete graphs…

Differential Geometry · Mathematics 2020-11-24 Matthias Keller , Florentin Münch

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

Spectral Theory · Mathematics 2013-08-27 Evans M. Harell , Joachim Stubbe