Related papers: Sharp bounds and monotonicity results for Neumann …
We obtain sharp upper bounds for the first two nonzero Steklov eigenvalues among bounded domains in Euclidean spaces of dimension $d \geq 7$ under a natural normalization involving volume and boundary measure. These bounds are derived from…
We prove the existence of a principal eigenvalue associated to the $\infty$-Laplacian plus lower order terms and the Neumann boundary condition in a bounded smooth domain. As an application we get uniqueness and existence results for the…
We prove that the second nontrivial Neumann eigenvalue of the Laplace-Beltrami operator on the unit sphere $\mathbb{S}^n \subseteq \mathbb{R}^{n+1}$ is maximized by the union of two disjoint, equal, geodesic balls among all subsets of…
We present asymptotically sharp inequalities for the eigenvalues $\mu_k$ of the Laplacian on a domain with Neumann boundary conditions, using the averaged variational principle introduced in \cite{HaSt14}. For the Riesz mean $R_1(z)$ of the…
We analyze the behavior of the eigenvalues and eigenfunctions of the Laplace operator with homogeneous Neumann boundary conditions when the domain is perturbed. We focus on exterior perturbations of the domain, that is, the limit domain is…
We introduce higher-order Poincar'e constants for compact weighted manifolds and estimate them from above in terms of subsets. These estimates imply upper bounds for eigenvalues of the weighted Laplacian and the first nontrivial eigenvalue…
We show that any second eigenfunction of the Laplacian with standard vertex conditions on a metric tree graph attains its extremal values only at degree one vertices, and give an example where these vertices do not realise the diameter of…
We use the averaged variational principle introduced in a recent article on graph spectra [7] to obtain upper bounds for sums of eigenvalues of several partial differential operators of interest in geometric analysis, which are analogues of…
We offer a new method for proving that the maximal eigenvalue of the normalized graph Laplacian of a graph with $n$ vertices is at least $\frac{n+1}{n-1}$ provided the graph is not complete and that equality is attained if and only if the…
In this work, we study the problem of stability of Graph Convolutional Neural Networks (GCNs) under random small perturbations in the underlying graph topology, i.e. under a limited number of insertions or deletions of edges. We derive a…
We prove two upper bounds for the Steklov eigenvalues of a compact Riemannian manifold with boundary. The first involves the volume of the manifold and of its boundary, as well as packing and volume growth constants of the boundary and its…
For a finite simple undirected graph $G$, let $\gamma(G)$ denote the size of a smallest dominating set of $G$ and $\mu(G)$ denote the number of eigenvalues of the Laplacian matrix of $G$ in the interval $[0,1)$, counting multiplicities.…
We prove general theorems for isoperimetric problems on lattices of the form ${\mathbb{Z}}^{k} \times {\mathbb{N}}^{d}$ which state that the perimeter of the optimal set is a monotonically increasing function of the volume under certain…
This paper deals with the Neumann eigenvalue problem for the Hermite operator defined in a convex, possibly unbounded, planar domain $\Omega$, having one axis of symmetry passing through the origin. We prove a sharp lower bound for the…
We discuss optimal lower bounds for eigenvalues of Laplacians on weighted graphs. These bounds are formulated in terms of the geometry and, more specifically, the inradius of subsets of the graph. In particular, we study the first non-zero…
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 present monotone sequences of lower and upper bounds on the Perron value of a nonngeative matrix, and we study their strict monotonicity. Using those sequences, we provide two combinatorial applications. One is to improve…
We obtain sharp lower bounds for the first eigenvalue of four types of eigenvalue problem defined by the bi-Laplace operator on compact manifolds with boundary and determine all the eigenvalues and the corresponding eigenfunctions of a…
The aim of the present paper is to investigate the behavior of the spectrum of the Neumann Laplacian in domains with little holes excised from the interior. More precisely, we consider the eigenvalues of the Laplacian with homogeneous…
The largest eigenvalue of a matrix is always larger or equal than its largest diagonal entry. We show that for a large class of random Laplacian matrices, this bound is essentially tight: the largest eigenvalue is, up to lower order terms,…