A transfer principle for Steklov eigenvalue estimates of graphs

Abstract

In this paper, we establish a new variant of the Burger-Brooks transfer principle, which allows us to apply spectral estimates for measured Riemannian surfaces to obtain the following result: There exists a universal constant $C>0$ such that, for every connected graph $G=(V,E)$ with boundary $B$, maximum degree $d_{\max }$ and genus $g$, \[σ_k(G, B)\leq C d_{\max}\frac{g+k}{|B|},\] where $1\le k\le |B|$ and ${\sigma }_k(G,B)$ denotes the $k$-th Steklov eigenvalue of $G$ with boundary $B$. This bound is sharp up to a universal constant, thereby resolving a problem raised by Lin and Zhao [J. Lond. Math. Soc. (2) 112 (2025), Paper No. e70238]. Furthermore, when $B=V$, the above result yields an upper bound for the Laplacian eigenvalues of graphs, improving the previously known bounds of Kelner, Lee, Price and Teng [Geom. Funct. Anal. 21 (2011), 1117--1143] and Amini and Cohen-Steiner [Comment. Math. Helv. 93 (2018), 203--223].

19 pages, 3 figures