Analysis of Resparsification
Data Structures and Algorithms
2016-05-27 v1
Abstract
We show that schemes for sparsifying matrices based on iteratively resampling rows yield guarantees matching classic 'offline' sparsifiers (see e.g. Spielman and Srivastava [STOC 2008]). In particular, this gives a formal analysis of a scheme very similar to the one proposed by Kelner and Levin [TCS 2013].
Cite
@article{arxiv.1605.08194,
title = {Analysis of Resparsification},
author = {Jakub Pachocki},
journal= {arXiv preprint arXiv:1605.08194},
year = {2016}
}
Comments
preliminary draft