The graph $\infty$-Laplacian eigenvalue problem
SIAM Journal on Mathematical Analysis, 2026
We analyze various formulations of the $\infty$-Laplacian eigenvalue problem on graphs, comparing their properties and highlighting their respective advantages and limitations. First, we investigate the graph $\infty$-eigenpairs arising as limits of $p$-Laplacian eigenpairs, extending key results from the continuous …
A nodal domain theorem and a higher-order Cheeger inequality for the graph p-Laplacian
EMS Journal of Spectral Theory, vol. 8, pp. 883–908, 2018
We consider the nonlinear graph $p$-Laplacian and its set of eigenvalues and associated eigenfunctions of this operator defined by a variational principle. We prove a nodal domain theorem for the graph $p$-Laplacian for any $p\geq 1$. While for $p>1$ the bounds on the number of weak and strong nodal domains are the …
A note on certain ergodicity coefficients
Special Matrices, vol. 3, pp. 175–185, 2015
We investigate two ergodicity coefficients $\phi_{|| \cdot ||}$ and $\tau_{n-1}$, originally introduced to bound the subdominant eigenvalues of nonnegative matrices. The former has been generalized to complex matrices in recent years and several properties for such generalized version have been shown so far. We provide …
A preconditioning approach to the PageRank computation problem
Linear Algebra and its Applications, vol. 435, pp. 2222–2246, 2011
Some spectral properties of the transition matrix of an oriented graph indicate the preconditioning of Euler-Richardson (ER) iterative scheme as a good way to compute efficiently the vertexrank vector associated with such graph. We choose the preconditioner from an algebra $\mathcal U$ of matrices, thereby obtaining an …