Some Laplacian eigenvalues can be computed by matrix perturbation
Abstract
Based on matrix perturbation theory, closed-form analytic expansions are studied for a Laplacian eigenvalue of an undirected, possibly weighted graph, which is close to a unique degree in that graph. An approximation is presented to provide an analytic estimate of a Laplacian eigenvalue and complements bounds on Laplacian eigenvalues in spectral graph theory. Then, we apply the Euler summation and numerically analyze how the structure of graphs influences the convergence of the corresponding Euler series. Moreover, we obtain the explicit form of the perturbation Taylor series and its Euler series of almost regular graphs in which only one node has a unique degree and all remaining nodes have the same degree. We find that the Euler series possesses a superior convergence range than the perturbation Taylor series for almost regular graphs.
Cite
@article{arxiv.2504.19610,
title = {Some Laplacian eigenvalues can be computed by matrix perturbation},
author = {Piet Van Mieghem and Yingyue Ke},
journal= {arXiv preprint arXiv:2504.19610},
year = {2025}
}