Analysis of the parallel peeling algorithm: a short proof
classification
🧮 math.CO
keywords
algorithmparallelpeelingproofshortanalysisappliedbelow
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.