Pith. sign in

REVIEW 1 cited by

Analysis of Kelner and Levin graph sparsification algorithm for a streaming setting

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1609.03769 v1 pith:GYIJ2AVS submitted 2016-09-13 stat.ML cs.DScs.LG

Analysis of Kelner and Levin graph sparsification algorithm for a streaming setting

Daniele Calandriello , Alessandro Lazaric , Michal Valko This is my paper
classification stat.ML cs.DScs.LG
keywords algorithmanalysiskelnerlevinaccountacrossdependenciesderive
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We derive a new proof to show that the incremental resparsification algorithm proposed by Kelner and Levin (2013) produces a spectral sparsifier in high probability. We rigorously take into account the dependencies across subsequent resparsifications using martingale inequalities, fixing a flaw in the original analysis.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Improved large-scale graph learning through ridge spectral sparsification

    cs.LG 2026-04 unverdicted novelty 5.0

    GSQUEAK produces spectrally accurate sparsifiers for graph Laplacians in a single-pass distributed streaming setting.