To validate pollution data, subject-matter experts in Airpl (an organization that maintains a network of air pollution monitoring stations in western France) daily perform visual examinations of the data and check their consistency. In this paper, we describe these visual examinations and propose a formalization for this problem. The examinations consist in comparisons of so-called shorth intervals so we build a statistical test that compares such intervals in a nonparametric regression model. This...

To validate pollution data, subject-matter experts in Airpl (an organization that maintains a network of air pollution monitoring stations in western France) daily perform visual examinations of the data and check their consistency. In this paper, we describe these visual examinations and propose a formalization for this problem. The examinations consist in comparisons of so-called shorth intervals so we build a statistical test that compares such intervals in a nonparametric regression model. This...

Given a fixed dependency graph $G$ that describes a Bayesian network of binary variables $X_1,\cdots ,X_n$, our main result is a tight bound on the mutual information $I_c(Y_1,\cdots ,Y_k)={\sum }_{j=1}^{k}H\left(Y_j\right)/c-H(Y_1,\cdots ,Y_k)$ of an observed subset $Y_1,\cdots ,Y_k$ of the variables $X_1,\cdots ,X_n$. Our bound depends on certain quantities that can be computed from the connective structure of the nodes in $G$. Thus it allows to discriminate between different dependency graphs for a probability distribution, as we show from numerical experiments.