Independence Testing for Bounded Degree Bayesian Network

by   Arnab Bhattacharyya, et al.

We study the following independence testing problem: given access to samples from a distribution P over {0,1}^n, decide whether P is a product distribution or whether it is ε-far in total variation distance from any product distribution. For arbitrary distributions, this problem requires exp(n) samples. We show in this work that if P has a sparse structure, then in fact only linearly many samples are required. Specifically, if P is Markov with respect to a Bayesian network whose underlying DAG has in-degree bounded by d, then Θ̃(2^d/2· n/ε^2) samples are necessary and sufficient for independence testing.


page 1

page 2

page 3

page 4


Testing Properties of Multiple Distributions with Few Samples

We propose a new setting for testing properties of distributions while r...

On Approximating Total Variation Distance

Total variation distance (TV distance) is a fundamental notion of distan...

Model-Powered Conditional Independence Test

We consider the problem of non-parametric Conditional Independence testi...

Testing Product Distributions: A Closer Look

We study the problems of identity and closeness testing of n-dimensional...

Two Party Distribution Testing: Communication and Security

We study the problem of discrete distribution testing in the two-party s...

On Testing Whether an Embedded Bayesian Network Represents a Probability Model

Testing the validity of probabilistic models containing unmeasured (hidd...

Efficient Parameter Estimation of Truncated Boolean Product Distributions

We study the problem of estimating the parameters of a Boolean product d...