Related papers: Sharp bounds for the largest eigenvalue

We prove a sharp upper bound for the first Dirichlet eigenvalue of a class of nonlinear elliptic operators which includes the p-Laplace and the pseudo-p-Laplace operators. Moreover, we prove a stability result by means of a suitable…

We establish a sharp lower bound on the first non-trivial eigenvalue of the Laplacian on a metric graph equipped with natural (i.e., continuity and Kirchhoff) vertex conditions in terms of the diameter and the total length of the graph.…

Chemical hypergraphs and their associated normalized Laplace operators are generalized and studied in the case where each vertex--hyperedge incidence has a real coefficient. We systematically study the effect of symmetries of a hypergraph…

The Laplacian spread of a graph is the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. We find that the class of strongly regular graphs attains the maximum of largest…

We prove an upper bound for the volume-normalized second nonzero eigenvalue of the Laplace operator on closed Riemannian manifold, in terms of the conformal volume. This bound provides effective upper bound for a large class of manifolds,…

We consider transfer operators acting on spaces of holomorphic functions, and provide explicit bounds for their eigenvalues. More precisely, if D is any open set in C^d, and L is a suitable transfer operator acting on Bergman space A^2(D),…

We derive sharp bounds for three types of eigenvalue problems. First, we derive an upper bound for the first $p$-Dirichlet eigenvalue on conformally compact (CC) spaces. As a consequence, we show that for a class of CC submanifolds of…

Given an elliptic diffusion operator $L$ defined on a compact and connected manifold (possibly with a convex boundary in a suitable sense) with an $L$-invariant measure $m$, we introduce the non-linear $p-$operator $L_p$, generalizing the…

In this paper, we find the greatest values $\alpha_{1}$, $\alpha_{2}$, $\alpha_{3}$, $\alpha_{4}$, $\alpha_{5}$, $\alpha_{6}$, $\alpha_{7}$, $\alpha_{8}$ and the least values $\beta_{1}$, $\beta_{2}$, $\beta_{3}$, $\beta_{4}$, $\beta_{5}$,…

We show that for a graph $G$ with the vertex set $V$ and the largest eigenvalue $\lambda_{\max}(G)$, letting $$ M(G) := \max_{X,Y \subset V} \frac{e(X,Y)}{\sqrt{|X||Y|}} $$ (where $e(X,Y)$ denotes the number of edges between $X$ and $Y$),…

The spectrum of the normalized complex Laplacian for electrical networks is analyzed. We show that eigenvalues lie in a larger region compared to the case of the real Laplacian. We show the existence of eigenvalues with negative real part…

Sharp bounds on the least eigenvalue of an arbitrary graph are presented. Necessary and sufficient (just sufficient) conditions for the lower (upper) bound to be attained are deduced using edge clique partitions. As an application, we prove…

In this paper, we give tight bounds for the normalized Laplacian eigenvalues of hypergraphs that are not necessarily uniform, and provide an edge version interlacing theorem, a Cheeger inequality, and a discrepancy inequality that are…

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…

Let $(M,g)$ be a compact Riemannian manifold with a boundary of class $\mathscr{C}^{1}$. We are interested in the spectrum of the weighted Laplacian on $M$ with Neumann boundary conditions. More precisely, given $\rho$ and $\sigma$ two…

Let $Y$ be a hyperbolic surface and let $\phi$ be a Laplacian eigenfunction having eigenvalue $-1/4-\tau^2$ with $\tau>0$. Let $N(\phi)$ be the set of nodal lines of $\phi$. For a fixed analytic curve $\gamma$ of finite length, we study the…

We prove that for all values of the edge probability p(n) the largest eigenvalue of a random graph G(n,p) satisfies almost surely: \lambda_1(G)=(1+o(1))max{\sqrt{\Delta},np}, where \Delta is a maximal degree of G, and the o(1) term tends to…

We prove a general upper bound on the $k$-th adjacency eigenvalue of a graph. For $k\ge 2$, we show that \[ \lambda_k(G)\le \frac{(k-2)\sqrt{k+1}+2}{2k(k-1)}\,n-1 \] for every graph $G$ on $n$ vertices. We build on a recent approach that…

We consider several semidefinite programming relaxations for the max-$k$-cut problem, with increasing complexity. The optimal solution of the weakest presented semidefinite programming relaxation has a closed form expression that includes…

We investigate the question of sharp upper bounds for the Steklov eigenvalues of a hypersurface of revolution of the Euclidean space with two boundary components isometric to two copies of $\mathbb{S}^{n-1}$. For the case of the first non…