Simple Analysis of Priority Sampling
Not on the map. Why?
Abstract (arXiv)
We prove a tight upper bound on the variance of the priority sampling method (aka sequential Poisson sampling). Our proof is significantly shorter and simpler than the original proof given by Mario Szegedy at STOC 2006, which resolved a conjecture by Duffield, Lund, and Thorup.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 11 Aug 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1.
1 paper.