Showing 2026Show all
3 papers · 1 filter
cs.DS2026
Instance-optimal estimation of L2-norm
Tomer Adar
The -norm, or collision norm, is a core entity in the analysis of distributions and probabilistic algorithms. Batu and Canonne (FOCS 2017) presented an extensive analysis of a…
cs.DS2026
Almost-Uniform Edge Sampling: Leveraging Independent-Set and Local Graph Queries
Tomer Adar, Amit Levi
A central theme in sublinear graph algorithms is the relationship between counting and sampling: can the ability to approximately count a combinatorial structure be leveraged to sa…
cs.DS2026
When Local and Non-Local Meet: Quadratic Improvement for Edge Estimation with Independent Set Queries
Tomer Adar, Yahel Hotam, Amit Levi
We study the problem of estimating the number of edges in an unknown graph. We consider a hybrid model in which an algorithm may issue independent set, degree, and neighbor queries…