Analysis of the parallel peeling algorithm: a short proof
Combinatorics
2014-03-03 v1
Abstract
A recent paper by Jiang, Mitzenmacher and Thaler upper bounded the number of rounds needed in a parallel peeling algorithm applied to a random hypergraph whose edge density is below the k-core emergence threshold. I gave a very short proof of their result in this note.
Keywords
Cite
@article{arxiv.1402.7326,
title = {Analysis of the parallel peeling algorithm: a short proof},
author = {Pu Gao},
journal= {arXiv preprint arXiv:1402.7326},
year = {2014}
}