A Lichnerowicz-type estimate for Steklov eigenvalues on graphs and its rigidity (Q2119721)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A Lichnerowicz-type estimate for Steklov eigenvalues on graphs and its rigidity
scientific article

    Statements

    A Lichnerowicz-type estimate for Steklov eigenvalues on graphs and its rigidity (English)
    0 references
    0 references
    0 references
    30 March 2022
    0 references
    In differential geometry, the Lichnerowicz estimate gives a lower bound in terms of \(K\) and \(n\) for the smallest positive eigenvalue of the Laplace-Beltrami operator \(\Delta\) on a connected compact \(n\)-dimensional Riemannian manifold with Ricci curvature bounded from below by a positive real number \(K\). This result admits a relatively recently established discrete analogue for connected graphs [\textit{F. Bauer} et al., Proc. Am. Math. Soc. 145, No. 5, 2033--2042 (2017; Zbl 1361.31013)], in which the smallest positive eigenvalue of a graph Laplacian is bounded from below. Here, the assumption on the Ricci curvature of a manifold is replaced by the so-called Bakry-Émery curvature-dimension condition \(\mathrm{CD}(K,n)\) with \(K > 0\) and \(n > 1\). The smallest positive Laplacian eigenvalue of a graph satisfying \(\mathrm{CD}(K,n)\) is then estimated from below in terms of \(K\) and \(n\). The authors prove an estimate of a similar type for the smallest positive Steklov eigenvalue of a graph with boundary. Steklov eigenvalues have their origin in differential geometry as well, where they are defined as eigenvalues of the so-called Dirichlet-to-Neumann operators. Both notions admit natural analogues for graphs, the study of which was initiated by \textit{B. Hua} et al. [Calc. Var. Partial Differ. Equ. 56, No. 6, Paper No. 178, 21 p. (2017; Zbl 1377.05109)]. These authors also prove lower bounds for the first positive Steklov eigenvalue of a graph, and other such estimates were proved later by \textit{H. Perrin} [Calc. Var. Partial Differ. Equ. 58, No. 2, Paper No. 67, 12 p. (2019; Zbl 1407.05153)]. The main result of the article under review estimates this eigenvalue from below for graphs satisfying the condition \(\mathrm{CD}(K,n)\) with \(K > 0\) and \(n > 1\), the lower bound taking precisely the form of the Lichnerowicz estimate for the graph Laplacian.
    0 references
    curvature-dimension condition
    0 references
    Steklov eigenvalue
    0 references
    Lichnerowicz estimate
    0 references
    0 references
    0 references
    0 references

    Identifiers