Related papers: Isoperimetric upper bound for the first eigenvalue…
We express the discrete Ricci curvature of a graph as the minimal eigenvalue of a family of matrices, one for each vertex of a graph whose entries depend on the local adjaciency structure of the graph. Using this method we compute or bound…
We define, for any graph $G=(V,E)$, a boundary $\partial G \subseteq V$. The definition coincides with what one would expected for the discretization of (sufficiently nice) Euclidean domains and contains all vertices from the…
We consider the spectral structure of indefinite second order boundary-value problems on graphs. A variational formulation for such boundary-value problems on graphs is given and we obtain both full and half-range completeness results. This…
In this paper we obtain several results concerning the optimization of higher Steklov eigenvalues both in two and higher dimensional cases. We first show that the normalized (by boundary length) $k$-th Steklov eigenvalue on the disk is not…
For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular…
In this article we study the homogenization rates of eigenvalues of a Steklov problem with rapidly oscillating periodic weight functions. The results are obtained via a careful study of oscillating functions on the boundary and a precise…
We consider an eigenvalue problem for the biharmonic operator with Steklov-type boundary conditions. We obtain it as a limiting Neumann problem for the biharmonic operator in a process of mass concentration at the boundary. We study the…
We study the first eigenvalue of the $p-$Laplacian (with $1<p<\infty$) on a quantum graph with Dirichlet or Kirchoff boundary conditions on the nodes. We find lower and upper bounds for this eigenvalue when we prescribe the total sum of the…
We demonstrate lower bounds for the eigenvalues of compact Bakry-Emery manifolds with and without boundary. The lower bounds for the first eigenvalue rely on a generalised maximum principle which allows gradient estimates in the Riemannian…
We show several results comparing sharp eigenvalue bounds for the first Steklov eigenvalue on surfaces under change of the topology. Among others, we obtain strict monotonicity in the genus. Combined with results of the second named author…
Let $(\Omega^{n+1}, g)$ be an $(n+1)$-dimensional smooth compact connected Riemannian manifold with smooth boundary $\Sigma$, satisfying that ${\text{Ric}_{\Omega}}\ge 0$ and $\Sigma$ is strictly convex, more precisely, its second…
A one-by-one exhaustion is a combinatorial/geometric condition which excludes eigenvalues from the spectra of Laplace and Schr\"odinger operators on graphs. Isoperimetric inequalities in graphs with a cocompact automorphism group provide an…
Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…
In this paper we study the relationship of hyperbolicity and (Cheeger) isoperimetric inequality in the context of Riemannian manifolds and graphs. We characterize the hyperbolic manifolds and graphs (with bounded local geometry) verifying…
In recent years, eigenvalue optimization problems have received a lot of attention, in particular, due to their connection with the theory of minimal surfaces. In the present paper we prove that on any orientable surface there exists a…
The Grundy number of a graph is the minimum number of colors needed to properly color the graph using the first-fit greedy algorithm regardless of the initial vertex ordering. Computing the Grundy number of a graph is an NP-Hard problem.…
In this paper, we investigate the monotonicity of the first Steklov--Dirichlet eigenvalue on eccentric annuli with respect to the distance, namely $t$, between the centers of the inner and outer boundaries of an annulus. We first show the…
We study the first nontrivial Steklov eigenvalue of perimeter-normalized regular \(N\)-gons and show that it is strictly increasing in \(N\). The proof mainly relies on an analytic framework that establishes a refined asymptotic expansion…
The edge isoperimetric problem for a graph $G$ is to determine, for each $n$, the minimum number of edges leaving any set of $n$ vertices. In general this problem is NP-hard, but exact solutions are known in some special cases, for example…
We are interested in evolution phenomena on star-like networks composed of several branches which vary considerably in physical properties. The initial boundary value problem for singularly perturbed hyperbolic differential equation on a…