Testing that distributions are close

Tuğkan Batu, Lance Fortnow, Ronitt Rubinfeld, Warren D. Smith, Patrick White

Research output: Contribution to journalArticlepeer-review

Abstract

Given two distributions over an n element set, we wish to check whether these distributions are statistically close by only sampling. We give a sublinear algorithm which uses O(n2/3 ε-4 log n) independent samples from each distribution, runs in time linear in the sample size, makes no assumptions about the structure of the distributions, and distinguishes the cases when the distance between the distributions is small (less than max(ε2/32 qq√n, ε/4√n)) or large (more than ε) in L1-distance. We also give an Ω(n2/3ε-2/3) lower bound. Our algorithm has applications to the problem of checking whether a given Markov process is rapidly mixing. We develop sublinear algorithms for this problem as well).

Original languageEnglish
Pages (from-to)259-269
Number of pages11
JournalAnnual Symposium on Foundations of Computer Science - Proceedings
DOIs
StatePublished - 2000
Externally publishedYes

Fingerprint

Dive into the research topics of 'Testing that distributions are close'. Together they form a unique fingerprint.

Cite this