Dirichlet \(p\)-Laplacian eigenvalues and Cheeger constants on symmetric graphs (Q2302231)

The \(p\)-Laplace operator on a given graph with vertices \(V\) is defined as \[ \Delta_{p,\Omega}u(x)=\frac{1}{\nu_x}\sum_{y\in V}\mu_{xy}|u(y)-u(x)|^{p-2}(u(y)-u(x)), \] where the weight function \(\mu_{xy}=0\) if \([x,y]\) is not an edge of the graph, and \(\nu_x\) is the weight of the vertex \(x\). Here \(1<p<\infty\) (but not 1). The problem as \(p\to 1+\) for the equation \[ \Delta_{p,\Omega}u+\lambda|u|^{p-2}u=0\text{ in }\Omega \] is addressed. (This is the Dirichlet eigenvalue problem.) The investigation is based on the fact that a positive eigenfunction \(u\) always corresponds to the smallest eigenvalue \(\lambda\). Furthermore, a normalized positive eigenfunction is unique. Fortunately, for these issues proofs are directly available from the continuous case (in \(W^{1,p}_0(\Omega))\). An interesting result is the identification of the Cheeger constant in this discrete setting; this extends a result of B. Kawohl. The paper [\textit{L. Brasco} et al., Interfaces Free Bound. 16, No. 3, 419--458 (2014; Zbl 1301.49115)] contains some analogous results for the fractional 1-Laplace problem. Some features have a resemblance to the fractional \(p\)-Laplace eigenvalue problem. For example, the expedient function \(Q_p\) in Lemma 4.3 also appears in [\textit{E. Lindgren} and \textit{P. Lindqvist}, Calc. Var. Partial Differ. Equ. 49, No. 1--2, 795--826 (2014; Zbl 1292.35193)]. For finite connected bi-partite subgraphs also the ``maximum eigenfunction'' is given a convenient criterion. This interesting work ends with explicit examples, one of them being about Wojciechowski's anti-trees.