arXiv:2507.18803stat.MLcs.LG2025-07被引 1

证明了图拉普拉斯特征值的中心极限定理,揭示其统计效率。

Central limit theorems for the eigenvalues of graph Laplacians on data clouds

  • 基于数据云上的ε-近邻图构造图拉普拉斯算子,研究特征值波动
  • 特征值偏差乘以√n后渐近服从高斯分布,方差可显式计算
  • 从费舍尔-劳几何角度解释方差,关联到估计效率的克拉梅尔-罗下界

给定从低维流形 $M$ 上独立同分布采样的数据点集 $X_n =\{ x_1, \dots, x_n \}$,考虑基于 $\varepsilon$-近邻图的图拉普拉斯算子 $Δ_n$,研究其特征值围绕均值的渐近波动。设 $\hatλ_l^\varepsilon$ 为 $Δ_n$ 的第 $l$ 个特征值,在适当的数据生成模型和 $\varepsilon$ 衰减速率假设下,证明 $\sqrt{n} (\hatλ_l^\varepsilon - \mathbb{E}[\hatλ_l^\varepsilon])$ 渐近服从高斯分布,且其方差可显式刻画。形式论证表明该方差可解释为某能量泛函在费舍尔-劳几何下的梯度流耗散。由此导出特征值估计的统计意义:其渐近方差达到加权拉普拉斯-贝尔特拉米算子特征值估计的克拉梅尔-罗下界,暗示图拉普拉斯特征值具有渐近统计效率。还给出了多个特征值的中心极限定理,并通过数值实验验证了理论在部分假设放松时的稳健性。

原文摘要 · Abstract (English)

Given i.i.d.\ samples $X_n =\{ x_1, \dots, x_n \}$ from a distribution supported on a low dimensional manifold ${M}$ embedded in Eucliden space, we consider the graph Laplacian operator $Δ_n$ associated to an $\varepsilon$-proximity graph over $X_n$ and study the asymptotic fluctuations of its eigenvalues around their means. In particular, letting $\hatλ_l^\varepsilon$ denote the $l$-th eigenvalue of $Δ_n$, and under suitable assumptions on the data generating model and on the rate of decay of $\varepsilon$, we prove that $\sqrt{n } (\hatλ_{l}^\varepsilon - \mathbb{E}[\hatλ_{l}^\varepsilon] )$ is asymptotically Gaussian with a variance that we can explicitly characterize. A formal argument allows us to interpret this asymptotic variance as the dissipation of a gradient flow of a suitable energy with respect to the Fisher-Rao geometry. This geometric interpretation allows us to give, in turn, a statistical interpretation of the asymptotic variance in terms of a Cramer-Rao lower bound for the estimation of the eigenvalues of certain weighted Laplace-Beltrami operator. The latter interpretation suggests a form of asymptotic statistical efficiency for the eigenvalues of the graph Laplacian. We also present CLTs for multiple eigenvalues and through several numerical experiments explore the validity of our results when some of the assumptions that we make in our theoretical analysis are relaxed.

谱分析中心极限定理图拉普拉斯统计效率

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。