Related papers: Monotonicity of Steklov eigenvalues on graphs and …
We introduce the Steklov flows on finite trees, i.e. the flows (or currents) associated with the Steklov problem. By constructing appropriate Steklov flows, we prove the monotonicity and rigidity of the first nonzero Steklov eigenvalues on…
Let $T$ be a finite tree with leaf set $\dO$ as the boundary and let $\lambda_2$ be the first nontrivial Steklov eigenvalue. Let $D$ and $\ell$ be the maximum vertex degree and the number of leaves, respectively. Motivated by the spectral…
We study the maximal Steklov eigenvalues of trees with given number of boundary vertices and total number of vertices. Trees can be regarded as discrete analogue of Hadamard manifolds, namely simply-connected Riemannian manifolds of…
In this paper, we study the upper bounds for discrete Steklov eigenvalues on trees via geometric quantities. For a finite tree, we prove sharp upper bounds for the first nonzero Steklov eigenvalue by the reciprocal of the size of the…
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…
In this paper, we obtain a Lichnerowicz-type estimate for the first Steklov eigenvalues on graphs and discuss its rigidity.
In this paper, we obtain a comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs and discuss its rigidity. As applications of the comparison of eigenvalues, we obtain Lichnerowicz-type estimates and some combinatorial…
In the first part, we derive monotonicity of the normalized spectra for the second-order Steklov problem and two fourth-order Steklov problems on the $2$-dimensional geodesic disks with respect to the geodesic radius in the sphere and 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…
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 consider the Steklov eigenvalues of the Laplace operator as limiting Neumann eigenvalues in a problem of mass concentration at the boundary of a ball. We discuss the asymptotic behavior of the Neumann eigenvalues and find explicit…
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…
The Steklov eigenvalue problem was introduced over a century ago, and its discrete form attracted interest recently. Let $D$ and $\delta \Omega$ be the maximum vertex degree and the set of vertices of degree one in a graph $\mathcal{G}$…
We study upper bounds for the first non-zero eigenvalue of the Steklov problem defined on finite graphs with boundary. For finite graphs with boundary included in a Cayley graph associated to a group of polynomial growth, we give an upper…
We extend some classical inequalities between the Dirichlet and Neumann eigenvalues of the Laplacian to the context of mixed Steklov--Dirichlet and Steklov--Neumann eigenvalue problems. The latter one is also known as the sloshing problem,…
Trees can be regarded as discrete analogue of Hadamard manifolds, namely simply-connected Riemannian manifolds of non-positive sectional curvature. In this paper, we compare the first (non-trivial) Steklov eigenvalue and algebraic…
This paper is a brief account of the Steklov eigenvalue problem on a 2-dimensional rectangular domain, and then on a 3-dimensional rectangular box. It is divided into four sections. Section 1 relies heavily on real analytic methods to show…
In this paper, we study the higher Steklov eigenvalues of graphs on surfaces. We obtain the upper bound of higher Steklov eigenvalues of a finite graph $G$ with boundary $B$ and genus $g$ by using metrical deformation via probability flows.…
In this paper, we extend a lower bound estimate for Steklov eigenvalues by Perrin \cite{Pe} on unit-weighted graphs to general weighted graphs and characterise its rigidity.
We obtain asymptotic formulae for the Steklov eigenvalues and eigenfunctions of curvilinear polygons in terms of their side lengths and angles. These formulae are quite precise: the errors tend to zero as the spectral parameter tends to…