English
Related papers

Related papers: Sharp eigenvalue bounds on quantum star graphs

200 papers

We analyze various formulations of the $\infty$-Laplacian eigenvalue problem on graphs, comparing their properties and highlighting their respective advantages and limitations. First, we investigate the graph $\infty$-eigenpairs arising as…

Spectral Theory · Mathematics 2025-07-16 Piero Deidda , Martin Burger , Mario Putti , Francesco Tudisco

A classical result of Cheng states that the bottom spectrum of complete manifolds of fixed dimension and Ricci curvature lower bound achieves its maximal value on the corresponding hyperbolic space. The paper establishes an analogous result…

Differential Geometry · Mathematics 2024-06-05 Ovidiu Munteanu , Jiaping Wang

We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize the geometry of the graph. In many interesting cases, the existence of…

Metric Geometry · Mathematics 2011-07-26 Jonathan A. Kelner , James R. Lee , Gregory N. Price , Shang-Hua Teng

We address the question of convergence of Schr\"odinger operators on metric graphs with general self-adjoint vertex conditions as lengths of some of graph's edges shrink to zero. We determine the limiting operator and study convergence in a…

Spectral Theory · Mathematics 2019-10-23 Gregory Berkolaiko , Yuri Latushkin , Selim Sukhtaiev

We obtain a new bound connecting the first non--trivial eigenvalue of the Laplace operator of a graph and the diameter of the graph, which is effective for graphs with small diameter or for graphs, having the number of maximal paths…

Combinatorics · Mathematics 2020-04-22 Ilya D. Shkredov

In this paper, we establish discrete Hardy-Rellich inequalities on $\mathbb{N}$ with $\Delta^\frac{\ell}{2}$ and optimal constants, for any $\ell \geq 1$. As far as we are aware, these sharp inequalities are new for $\ell \geq 3$. Our…

Analysis of PDEs · Mathematics 2023-12-27 Xia Huang , Dong Ye

Let $k \geq 3$. We prove the following three bounds for the matching number, $\alpha'(G)$, of a graph, $G$, of order $n$ size $m$ and maximum degree at most $k$. If $k$ is odd, then $\alpha'(G) \ge \left( \frac{k-1}{k(k^2 - 3)} \right) n \,…

Combinatorics · Mathematics 2016-04-19 Michael A. Henning , Anders Yeo

We prove eigenvalue bounds for Schr\"odinger operator $-\Delta_g+V$ on compact manifolds with complex potentials $V$. The bounds depend only on an $L^q$-norm of the potential, and they are shown to be optimal, in a certain sense, on the…

Spectral Theory · Mathematics 2025-10-28 Jean-Claude Cuenin

Let $\lambda^{*}$ be the maximum spectral radius of connected irregular graphs on $n$ vertices with maximum degree $\Delta$. Liu, Shen and Wang (2007) conjectured that $\lim_{n\rightarrow…

Combinatorics · Mathematics 2022-09-27 Jie Xue , Ruifang Liu

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…

Spectral Theory · Mathematics 2025-12-24 Kiyan Naderi , Noema Nicolussi

Sharp $L^p$ extensions of Pitt's inequality expressed as a weighted Sobolev inequality are obtained using convolution estimates and Stein-Weiss potentials. More generally, optimal constants are obtained for the full Stein-Weiss potential as…

Analysis of PDEs · Mathematics 2007-05-23 William Beckner

Signed graphs have their edges labeled either as positive or negative. $\rho(M)$ denote the $M$-spectral radius of $\Sigma$, where $M=M(\Sigma)$ is a real symmetric graph matrix of $\Sigma$. Obviously,…

Combinatorics · Mathematics 2022-01-19 Dan Li , Huiqiu Lin , Jixiang Meng

In this paper we establish the best constant $\widetilde A_{opt}(\bar{M})$ for the Trace Nash inequality on a $n-$dimensional compact Riemannian manifold in the presence of symmetries, which is an improvement over the classical case due to…

Functional Analysis · Mathematics 2012-02-07 Athanase Cotsiolis , Nikos Labropoulos

We prove that, for any $t\ge 3$, there exists a constant $c=c(t)>0$ such that any $d$-regular $n$-vertex graph with the second largest eigenvalue in absolute value~$\lambda$ satisfying $\lambda\le c d^{t-1}/n^{t-2}$ contains vertex-disjoint…

Combinatorics · Mathematics 2018-06-05 Jie Han , Yoshiharu Kohayakawa , Yury Person

We prove the Eigenstate Thermalisation Hypothesis for Wigner matrices uniformly in the entire spectrum, in particular near the spectral edges, with a bound on the fluctuation that is optimal for any observable. This complements earlier…

Probability · Mathematics 2024-12-18 Giorgio Cipolloni , László Erdős , Joscha Henheik

For a Riemannian closed spin manifold and under some topological assumption (non-zero $\hat{A}$-genus or enlargeability in the sense of Gromov-Lawson), we give an optimal upper bound for the infimum of the scalar curvature in terms of the…

Differential Geometry · Mathematics 2007-05-23 Hélène Davaux

Let $K_n=(V,E)$ be the complete graph with $n\geq 3$ vertices (here $V$ and $E$ denote the set of vertices and edges of $K_n$ respectively). We find the optimal value ${\bf{C}}_{n,p}$ such that the inequality $$\|f-m_f\|_p\le {\bf…

Classical Analysis and ODEs · Mathematics 2024-11-20 Cristian González-Riquelme , José Madrid

In this paper we show the tightness of the weight-distribution bound for the positive non-principle eigenvalue of strongly regular (affine) polar graphs and characterise the optimal eigenfunctions. Additionally, we show the tightness of the…

Combinatorics · Mathematics 2024-07-04 Rhys J. Evans , Sergey Goryainov , Leonid Shalaginov

For random $d$-regular graphs on $N$ vertices with $1 \ll d \ll N^{2/3}$, we develop a $d^{-1/2}$ expansion of the local eigenvalue distribution about the Kesten-McKay law up to order $d^{-3}$. This result is valid up to the edge of the…

Probability · Mathematics 2021-07-06 Roland Bauerschmidt , Jiaoyang Huang , Antti Knowles , Horng-Tzer Yau

The article considers an inhomogeneous Erd\H{o}s-R\"enyi random graph on $\{1,\ldots, N\}$, where an edge is placed between vertices $i$ and $j$ with probability $\varepsilon_N f(i/N,j/N)$, for $i\le j$, the choice being made independent…

Probability · Mathematics 2024-02-28 Arijit Chakrabarty , Sukrit Chakraborty , Rajat Subhra Hazra