Metraipolis › archive › dc_d93cd4d47f23
Fast Graph Laplacian Estimation using Effective Resistance — arXiv:2609.23668
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.23668
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T07:08:33.845Z
- SHA-256 of the archived text
4a469f297261a0956ac5466e1069cf82411462bf2e2925db22a0274b21c9e3e6- Stable URL of this page
https://metraipolis.com/documento/dc_d93cd4d47f23
How to cite
Fast Graph Laplacian Estimation using Effective Resistance — arXiv:2609.23668 — arXiv (en), https://arxiv.org/abs/2609.23668 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d93cd4d47f23 (Metraipolis archive dc_d93cd4d47f23, sha256 4a469f297261a0956ac5466e1069cf82411462bf2e2925db22a0274b21c9e3e6)
BibTeX
@misc{dcd93cd4d47f23,
title = {Fast Graph Laplacian Estimation using Effective Resistance — arXiv:2609.23668},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.23668},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d93cd4d47f23; sha256 4a469f297261a0956ac5466e1069cf82411462bf2e2925db22a0274b21c9e3e6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.23668. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Inferring network topology from noisy node observations is a central problem in graph signal processing. In this paper, we consider Laplacian-constrained graph estimation for Gaussian Markov random fields, focusing on the underdetermined regime in which the number of samples is smaller than the number of graph nodes. Existing approaches often formulate the problem as a sparsity-regularized maximum-likelihood estimation problem. While effective, such methods typically require iterative optimization and are often computationally demanding, particularly under Laplacian constraints. Instead, we propose a non-iterative estimator of graph Laplacians that uses effective resistance for regularization, and evaluate the method using a simple sparsification procedure. Experiments show that with some trade-off in edge and weight recovery on the considered dataset, computational cost for moderately sized graphs can be substantially reduced. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-22 in cs.LG). Categorie arXiv: Signal Processing (eess.SP) ; Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2609.23668 — 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-10-09T06:58:09.591Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).