We first validate the Netsci implementation of the k-nearest neighbors algorithm using a distribution whose MI value can be exactly computed -a twodimensional Gaussian distribution with zero mean and unit variance, and a covariance value r. Netsci predicts the MI with an accuracy typical of previous implementations of the k-nearest-neighbors algorithm (Figure ; compare with Figure of Kraskov et al. ).