Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Optimal Closeness Testing of Discrete Distributions Made (Complex) Simple (2204.12640v1)

Published 27 Apr 2022 in cs.DS, cs.DM, math.PR, math.ST, and stat.TH

Abstract: In this note, we revisit the recent work of Diakonikolas, Gouleakis, Kane, Peebles, and Price (2021), and provide an alternative proof of their main result. Our argument does not rely on any specific property of Poisson random variables (such as stability and divisibility) nor on any "clever trick," but instead on an identity relating the expectation of the absolute value of any random variable to the integral of its characteristic function: [ \mathbb{E}[|X|] = \frac{2}{\pi}\int_0\infty \frac{1-\Re(\mathbb{E}[e{i tX}])}{t2}\, dt ] Our argument, while not devoid of technical aspects, is arguably conceptually simpler and more general; and we hope this technique can find additional applications in distribution testing.

Citations (4)

Summary

We haven't generated a summary for this paper yet.