arXiv (All)
open access
Solving Hypergraph Laplacian Systems in Almost-Linear Time
For a connected weighted hypergraph, we give a randomized almost-linear-time solver for the Poisson problem for the cut-based hypergraph Laplacian in the natural input size $P=\sum_{e\in E}|e|$, the sum of hyperedge sizes. For every fixed constant $C>0$, our randomized algorithm runs in $P^{1+o(1)}$
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Surrogate-Based Autotuning for Randomized Sketching Algorithms in Regression Problems#983431
- Extended Walk-on-Spheres Algorithm for Linear and Nonlinear Elliptic Problems of Divergence-type#625543
- Extended Walk-on-Spheres Algorithm for Linear and Nonlinear Elliptic Problems of Divergence-type#623270
- Degree-Free Spectral Independence for Log-Concave Holant Measures#1012994
- Weighted Laplacian Flow: A Deterministic Particle Flow with Exponential Convergence#1084330
Record · ID 1156341
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive