Almost Optimal Bounds for Sublinear-Time Sampling of k-Cliques: Sampling Cliques is Harder Than Counting.

Talya Eden Dana Ron Will Rosenbaum

Published in: CoRR (2020)

Keyphrases

worst case
sample size
random sampling
upper bound
random variables
sampling methods
optimal cost
error bounds
estimation error
optimal solution
data structure
probability distribution