Simple Analysis of Priority Sampling

08/11/2023
by   Majid Daliri, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/27/2018

Palindromes in starlike trees

In this note, we obtain an upper bound on the maximum number of distinct...
research
09/05/2018

A completion of the proof of the Edge-statistics Conjecture

For given integers k and ł with 0<ℓ< k 2, Alon, Hefetz, Krivelevich and...
research
09/30/2020

A new upper bound for sampling numbers

We provide a new upper bound for sampling numbers (g_n)_n∈ℕ associated t...
research
12/22/2020

An Information-Theoretic Proof of a Bound on the Number of Independent Sets in Bipartite Graphs

The present paper provides an information-theoretic proof of Kahn's conj...
research
08/24/2022

A Simpler Proof that Pairing Heaps Take O(1) Amortized Time per Insertion

The pairing heap is a simple "self-adjusting" implementation of a heap (...
research
07/22/2022

A simple and sharper proof of the hypergraph Moore bound

The hypergraph Moore bound is an elegant statement that characterizes th...
research
01/22/2020

Axiomatizing Maximal Progress and Discrete Time

Milner's complete proof system for observational congruence is crucially...

Please sign up or login with your details

Forgot password? Click here to reset