Library Header Image
LSE Research Online LSE Library Services

Testing that distributions are close

Batu, Tugkan ORCID: 0000-0003-3914-4645, Fortnow, L., Rubinfeld, R., Smith, W. D. and White, P. (2000) Testing that distributions are close. In: Proceedings 41st Annual Symposium on Foundations of Computer Science. IEEE, New York, USA, pp. 259-269.

Full text not available from this repository.

Identification Number: 10.1109/SFCS.2000.892113


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/323 √n,ε/4√n=)) or large (more than ε) in L 1-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.

Item Type: Book Section
Official URL:
Additional Information: © 2000 IEEE
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Date Deposited: 04 Jan 2011 13:46
Last Modified: 15 Jun 2024 06:15

Actions (login required)

View Item View Item