Metraipolis › archive › dc_e68a70708e2f
Graph Spectral Sparsification is in Catalytic Logspace — arXiv:2608.21594
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.21594
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T09:17:44.342Z
- SHA-256 of the archived text
e1ea8ae74e0f9badba9a20c44ee29b9c894a74173859c0d556d2a6da43281c10- Stable URL of this page
https://metraipolis.com/documento/dc_e68a70708e2f
How to cite
Graph Spectral Sparsification is in Catalytic Logspace — arXiv:2608.21594 — arXiv (en), https://arxiv.org/abs/2608.21594 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e68a70708e2f (Metraipolis archive dc_e68a70708e2f, sha256 e1ea8ae74e0f9badba9a20c44ee29b9c894a74173859c0d556d2a6da43281c10)
BibTeX
@misc{dce68a70708e2f,
title = {Graph Spectral Sparsification is in Catalytic Logspace — arXiv:2608.21594},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.21594},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e68a70708e2f; sha256 e1ea8ae74e0f9badba9a20c44ee29b9c894a74173859c0d556d2a6da43281c10},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.21594. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We give a catalytic logspace algorithm for the problem of graph spectral sparsification. Given an undirected graph $G$ on $n$ vertices and $\varepsilon>0$, our algorithm outputs an $\varepsilon$-spectral sparsifier of $G$ with $O(n\varepsilon^{-2}\log n)$ edges, matching the effective resistance sampling of Spielman and Srivastava (STOC 2008). This gives a new, natural problem in catalytic logspace that is not known to be in deterministic $\mathbf{NC}$ or $\mathbf{SC}$. Our main contribution is an entirely new technique in the compress--or--random paradigm for catalytic logspace that we believe will have further applications. We first analyze effective-resistance sparsification using a pessimistic estimator that can itself be computed in catalytic logspace. The estimator is motivated by the viewpoint of graph quasirandomness and immediately gives a simple, deterministic greedy algorithm for graph sparsification. Subsequently, we show that such a pessimistic estimator can be transformed into an algorithm that performs an in-place compression of a string with bad potential. Our algorithm is based on using the potential function to define a measure over strings, and implementing arithmetic coding using this measure in-place. This compression technique is substantially distinct from all prior tools in the field of catalytic computation.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in cs.CC).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Computational Complexity (cs.CC).
Pagina del lavoro: https://arxiv.org/abs/2608.21594 — 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-18T09:17:26.761Z dalla pagina https://arxiv.org/catchup/cs.CC/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).