Weighted cut sparsification in turnstile streams
A graph arrives as a stream of updates that can raise or lower edge weights. Can one pass produce a sparse reweighted subgraph that approximates the weight of every cut?
Why it matters and what counts as progress
Why it matters: A sparsifier lets graph algorithms work with a smaller input. A stream algorithm must build it while retaining much less information than the full list of updates.
What counts as progress: Compare space, time per update and recovery time for the same weighted stream model. The stated probability must cover every cut simultaneously.
How the problem developed
- 2022 · Weighted turnstile sketch [5]
Yu Chen, Sanjeev Khanna and Huan Li Gave a sketch for producing a cut sparsifier under general weight updates.
Lin, Mirrokni and Woodruff with Gemini 4 Improved the space bound and obtained near-linear recovery at fixed accuracy.
AI contribution
Near-Optimal Space and Time Cut Sparsification in Turnstile Streams
Lin, Mirrokni and Woodruff give a one-pass linear sketch for weighted turnstile graph streams. For and , the algorithm uses bits, polylogarithmic worst-case update time and worst-case recovery time. With probability at least , the output preserves every cut within a factor of .
Sources
Publication history
Near-Optimal Space and Time Cut Sparsification in Turnstile Streams
Near-Optimal Space and Time Cut Sparsification in Turnstile Streams
Daily emails by default, only when there’s an update.