Volume growth and spectrum for general graph Laplacians (Q2636975)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Volume growth and spectrum for general graph Laplacians |
scientific article |
Statements
Volume growth and spectrum for general graph Laplacians (English)
0 references
18 February 2014
0 references
Let \(\Gamma= (G,E)\) be an un-oriented, connected, countably infinite, locally finite graph without loops or multiple edges. Let \(\theta=(\theta_x)_{x\in G}\) an additive set of positive vertex weights whose sum over every infinite connected subset of \(G\) is infinite, \(\pi= (\pi_{xy})_{(x,y)\in G\times G}\) a set of nonnegative, symmetric edge weights such that \(\pi_{xy}> 0\) if and only if \((x,y)\, E\). Consider the Laplacian \({\mathcal L}_\theta\) defined in the real Hilbert space \(L^2_\theta\) by \[ ({\mathcal L}_\theta f)(x):= (1/\theta_x) \sum_{x\sim y}\pi_{xy}(f(y)- f(x)). \] Let \(\rho(x,y)\) be a metric ``adapted to \({\mathcal L}_\theta\) on \((\Gamma,\pi)\)'', i.e., for all \(x\in G\), \((1/\theta_x)\sum_{x\sim y}\pi_{xy}\rho^2(x,y)\leq 1\), and there exists \(c_\rho> 0\) such that \(\rho(x,y)\leq c_\rho\) whenever \(x\sim y\). Define \(B_\rho(x,r):=\{y\in G\rho(x,y)\leq r\}\), \(V_\rho(x,r):= \sum_{y\in B_\rho(x,r)}\theta_x\), and \(\mu_\rho(\Gamma, \pi,\theta):= \limsup_{r\to\infty} \log V_\rho(x,r)\). Note that \(\mu_\rho\) is independent of \(x\). Denote by \(l^{\text{ess}}_0\) the bottom of the essential spectrum of \(-{\mathcal L}_{\theta}\). Then \(l^{\text{ess}}_0\leq \mu^2_\rho/8\), where the exponent 2 cannot be reduced. If, in addition, \(0< m<\rho(x,y)< M<\infty\) whenever \(x\sim y\), with \(m, M\) constants, then \(l^{\text{ess}}_0\leq (1-\exp\{M\mu_\rho/2\})^2/m^2(1+ \exp\{M\mu_\rho\})\). The combination of assumptions on \(\rho\) underlying the second estimate can only be met when \(\mathcal L_\theta\) is bounded. Nonexistence of an essential spectrum is also briefly discussed. For an independent, somewhat different approach, see \textit{S. Haeseler}, \textit{M. Keller} and \textit{R. K. Wojciechowski} [J. Lond. Math. Soc., II. Ser. 88, No. 3, 883--898 (2013; Zbl 1283.47049)].
0 references
random walk on graphs
0 references
volume growth
0 references
graph Laplacian
0 references
bottom of spectrum
0 references
0 references
0 references