Prove linear convergence of the signless graph p-Laplacian power algorithm for non-even p

Prove that the algorithm in Algorithm 1 for computing the largest eigenpair of the signless graph p-Laplacian converges linearly when p is not an even integer.

Background

The paper proves convergence of the proposed iterative algorithm for computing the largest eigenpair of the signless graph p-Laplacian. Numerical experiments suggest a linear convergence rate for both integer and rational p, and existing tensor-eigenvalue analyses address the even-p cases. A proof of linear convergence for general non-even p is not provided and is explicitly identified as an unresolved problem.