A Spectral Theory of Distortion in LLM Graph Reconstruction: Sharp Bounds and Empirical Characterization

Paper recorded by Signals 4 on 2026-09-29 in cs.LG. Abstract reproduced from arXiv; link to the original below.

Published 2026-09-29 on arXiv · recorded by Signals 4 on 2026-09-30

Category: cs.LG · 机器学习 · first seen 2026-09-30

Abstract

Evaluations of graph reconstruction by language models typically report a single aggregate distance between the original and the reconstructed graph. We prove that for the Wasserstein distance between Laplacian spectra such a summary is bracketed by two edge counts, the net change in edge number from below and the symmetric difference from above, each scaled by $2/n$ where $n$ is the number of ver

Read on arXiv →