Asymptotic Theory of Eigenvectors for Latent Embeddings with Generalized Laplacian Matrices
Jianqing Fan, Yingying Fan, Jinchi Lv, Fan Yang, Diwen Yu
TL;DR
The paper develops an asymptotic theory for eigenvectors and eigenvalues of generalized (regularized) Laplacian matrices ${\bf X}= {\bf L}^{-\alpha}\widetilde{\bf X}{\bf L}^{-\alpha}$ in high dimensions where entries exhibit dependency. Building on a generalized quadratic vector equation (QVE) and refined local laws for resolvents, the authors derive LLNs and CLTs for spiked eigenpairs, providing almost sharp expansions around population limits $t_k$ and revealing a phase-transition in eigenvector projections. A key innovation is a decorrelation technique via an intermediate matrix ${\bf L}_{[i]}$ that mitigates dependence between the diagonal and random parts, enabling precise asymptotics even under sparsity and non-Bernoulli noise. The results enable uncertainty quantification and inference for latent embeddings in graphs and manifolds, with concrete applications to graph neural networks, confidence intervals for node memberships and network parameters, and uncertainty quantification in community detection. The theory is validated through simulations showing accurate finite-sample performance across a range of $\alpha$ and network sparsity. Overall, ATE-GL furnishes a flexible, principled framework for spectral inference in dependent-Laplacian settings, with broad implications for network analysis and latent-space modeling.
Abstract
Laplacian matrices are commonly employed in many real applications, encoding the underlying latent structural information such as graphs and manifolds. The use of the normalization terms naturally gives rise to random matrices with dependency. It is well-known that dependency is a major bottleneck of new random matrix theory (RMT) developments. To this end, in this paper, we formally introduce a class of generalized (and regularized) Laplacian matrices, which contains the Laplacian matrix and the random adjacency matrix as a specific case, and suggest the new framework of the asymptotic theory of eigenvectors for latent embeddings with generalized Laplacian matrices (ATE-GL). Our new theory is empowered by the tool of generalized quadratic vector equation for dealing with RMT under dependency, and delicate high-order asymptotic expansions of the empirical spiked eigenvectors and eigenvalues based on local laws. The asymptotic normalities established for both spiked eigenvectors and eigenvalues will enable us to conduct precise inference and uncertainty quantification for applications involving the generalized Laplacian matrices with flexibility. We discuss some applications of the suggested ATE-GL framework and showcase its validity through some numerical examples.
