Analysis of Kelner and Levin graph sparsification algorithm for a streaming setting
Machine Learning
2016-09-14 v1 Data Structures and Algorithms
Machine Learning
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.
Cite
@article{arxiv.1609.03769,
title = {Analysis of Kelner and Levin graph sparsification algorithm for a streaming setting},
author = {Daniele Calandriello and Alessandro Lazaric and Michal Valko},
journal= {arXiv preprint arXiv:1609.03769},
year = {2016}
}