English
Related papers

Related papers: Comparison of Steklov eigenvalues and Laplacian ei…

200 papers

The first non-zero Laplacian eigenvalue $\lambda_1$ of a finite graph is bounded below by its minimum Lin--Lu--Yau curvature $\kappa$. This is a discrete analogue of the classical Lichnerowicz Theorem. A graph with $\lambda_1=\kappa$ is…

Combinatorics · Mathematics 2026-02-12 Kaizhe Chen , Shiping Liu , Heng Zhang

Discrete versions of the Laplace and Dirac operators haven been studied in the context of combinatorial models of statistical mechanics and quantum field theory. In this paper we introduce several variations of the Laplace and Dirac…

Mathematical Physics · Physics 2022-03-08 Beata Casiday , Ivan Contreras , Thomas Meyer , Sabrina Mi , Ethan Spingarn

We give a survey on graphs with fixed smallest eigenvalue, especially on graphs with large minimal valency and also on graphs with good structures. Our survey mainly consists of the following two parts: (i) Hoffman graphs, the basic theory…

Combinatorics · Mathematics 2020-11-25 Jack H. Koolen , Meng-Yue Cao , Qianqian Yang

Given a graph G of order n and size m, let s(G)= sum|d(u)-2m/n|, where the sum is taken over all vertices u of G. We investigate upper and lower bounds on eigenvalues of G in terms of s(G).

Combinatorics · Mathematics 2007-05-23 Vladimir Nikiforov

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…

Spectral Theory · Mathematics 2017-04-18 Michael Jarret , Stephen P. Jordan

For a self--adjoint Laplace operator on a finite, not necessarily compact, metric graph lower and upper bounds on each of the negative eigenvalues are derived. For compact finite metric graphs Poincar\'{e} type inequalities are given.

Spectral Theory · Mathematics 2021-03-29 Amru Hussein

We give a construction of a class of magnetic Laplacian operators on finite directed graphs. We study some general combinatorial and algebraic properties of operators in this class before applying the Harrell-Stubbe Averaged Variational…

Spectral Theory · Mathematics 2018-06-05 John Dever

Spectral hypergraph theory has recently attracted considerable interest as it provides a natural framework for modeling higher-order relationships beyond classical graphs. In this setting, eigenvalues of adjacency, Laplacian, and…

Combinatorics · Mathematics 2026-04-28 Shashwath S Shetty , K Arathi Bhat

We establish a Harnack inequality for finite connected graphs with non-negative Ricci curvature. As a consequence, we derive an eigenvalue lower bound, extending previous results for Ricci flat graphs.

Combinatorics · Mathematics 2012-07-30 Fan Chung , Yong Lin , Shing-Tung Yau

This paper studies the Laplacian spectrum and the average effective resistance of (large) graphs that are sampled from graphons. Broadly speaking, our main finding is that the Laplacian eigenvalues of a large dense graph can be effectively…

Probability · Mathematics 2020-12-03 Renato Vizuete , Federica Garin , Paolo Frasca

Let $G$ be a connected graph on $n$ vertices with diameter $d$. It is known that if $2\le d\le n-2$, there are at most $n-d$ Laplacian eigenvalues in the interval $[n-d+2, n]$. In this paper, we show that if $1\le d\le n-3$, there are at…

Combinatorics · Mathematics 2023-06-27 Leyou Xu , Bo Zhou

We prove Poincar\'e and Plancherel-Polya inequalities for weighted {\ell}p -spaces on weighted graphs in which the constants are explicitly expressed in terms of some geometric characteristics of a graph. We use Poincar\'e type inequality…

Functional Analysis · Mathematics 2014-03-07 Hartmut F"uhr , Isaac Z. Pesenson

Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…

Combinatorics · Mathematics 2021-12-01 Raffaella Mulas

The purpose of this paper is to develop a "calculus" on graphs that allows graph theory to have new connections to analysis. For example, our framework gives rise to many new partial differential equations on graphs, most notably a new…

Discrete Mathematics · Computer Science 2007-05-23 Joel Friedman , Jean-Pierre Tillich

We study the Steklov eigenvalue problem for the $\infty-$orthotropic Laplace operator defined on convex sets of $\mathbb{R}^N$, with $N\geq2$, considering the limit for $p\to+\infty$ of the Steklov problem for the $p-$orthotropic Laplacian.…

Analysis of PDEs · Mathematics 2021-03-25 Giacomo Ascione , Gloria Paoli

We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound is a refinement of a well-known Hoffman-type bound.

Combinatorics · Mathematics 2023-11-17 Bogdan Nica

We give some new bounds for the clique and independence numbers of a graph in terms of its eigenvalues.

Combinatorics · Mathematics 2017-01-31 Vladimir Nikiforov

Let $\mathcal{G}(n,k)$ be the set of connected graphs of order $n$ with one of the Laplacian eigenvalue having multiplicity $k$. It is well known that $\mathcal{G}(n,n-1)=\{K_n\}$. The graphs of $\mathcal{G}(n,n-2)$ are determined by Das,…

Combinatorics · Mathematics 2017-12-04 Daijun Yin , Qiongxiang Huang

We give upper bounds on the eigenvalues of the differential form Laplacian on a compact Riemannian manifold. The proof uses Alexandrov spaces with curvature bounded below. We also construct differential form Laplacians on Alexandrov spaces.…

Differential Geometry · Mathematics 2018-01-11 John Lott

First we establish a weighted Reilly formula for differential forms on a smooth compact oriented Riemannian manifold with boundary. Then we give two applications of this formula when the manifold satisfies certain geometric conditions. One…

Differential Geometry · Mathematics 2024-05-07 Changwei Xiong