Metraipolis › archive › dc_40dbac5c787b
Bethe Hessian Recovery through the Kesten-Stigum Regime — arXiv:2610.41802
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41802
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T04:55:23.766Z
- SHA-256 of the archived text
29863b72cc3850ab1dc77e0fc786ec8231ce67088ad98286a2cc9b7ba4ef9d83- Stable URL of this page
https://metraipolis.com/documento/dc_40dbac5c787b
How to cite
Bethe Hessian Recovery through the Kesten-Stigum Regime — arXiv:2610.41802 — arXiv (en), https://arxiv.org/abs/2610.41802 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_40dbac5c787b (Metraipolis archive dc_40dbac5c787b, sha256 29863b72cc3850ab1dc77e0fc786ec8231ce67088ad98286a2cc9b7ba4ef9d83)
BibTeX
@misc{dc40dbac5c787b,
title = {Bethe Hessian Recovery through the Kesten-Stigum Regime — arXiv:2610.41802},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41802},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_40dbac5c787b; sha256 29863b72cc3850ab1dc77e0fc786ec8231ce67088ad98286a2cc9b7ba4ef9d83},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41802. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We show that outlier eigenvectors of the Bethe Hessian achieve weak recovery in the stochastic block model down to the Kesten-Stigum threshold, for every fixed common expected degree $d>1$. This extends previous recovery guarantees, which required $d$ to be sufficiently large. This threshold is information-theoretically optimal for the symmetric two-community model and is conjectured to mark the limit of efficient recovery in broader symmetric models. Our result matches the recovery guarantees of non-backtracking spectral methods while using Hermitian $n\times n$ matrices. To do this, we identify recursive formulas for the negative outlier eigenvalues and show that their eigenspaces have nonvanishing overlap with the corresponding planted eigenspaces. The proof constructs approximate eigenvectors from the planted labels on the limiting Poisson tree, with weights given by its Green's function, and transfers these approximations to the finite graph. Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.ML, nuovi lavori del giorno). Categorie arXiv: Statistics Theory (math.ST) ; Combinatorics (math.CO); Probability (math.PR); Machine Learning (stat.ML). Pagina del lavoro: https://arxiv.org/abs/2610.41802 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-02T04:45:57.653Z dalla pagina https://arxiv.org/list/stat.ML/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).