# Large-scale directed network inference with multivariate transfer entropy and hierarchical statistical testing

arXiv: https://arxiv.org/abs/1902.06828 · HTML: https://mlsanity.com/paper/1902.06828/

## Key facts

- Cited by 7 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 18 Feb 2019.

## Built on by (most cited first, 7 of 7)

- [A Rigorous Information-Theoretic Definition of Redundancy and Relevancy in Feature Selection Based on (Partial) Information Decomposition](https://mlsanity.com/paper/2105.04187/) (2021)
- [THP: Topological Hawkes Processes for Learning Causal Structure on Event Sequences](https://mlsanity.com/paper/2105.10884/) (2021)
- [Leveraging Pre-Images to Discover Nonlinear Relationships in Multivariate Environments](https://mlsanity.com/paper/2106.00842/) (2021)
- [Network inference via process motifs for lagged correlation in linear stochastic processes](https://mlsanity.com/paper/2208.08871/) (2022)
- [A Real-World Energy Management Dataset from a Smart Company Building for Optimization and Machine Learning](https://mlsanity.com/paper/2503.11469/) (2025)
- [Interaction-Aware Sensitivity Analysis for Aerodynamic Optimization Results using Information Theory](https://mlsanity.com/paper/2112.05609/) (2021)
- [Compression, Regularity, Randomness and Emergent Structure: Rethinking Physical Complexity in the Data-Driven Era](https://mlsanity.com/paper/2505.07222/) (2025)

## Abstract (arXiv)

Network inference algorithms are valuable tools for the study of large-scale neuroimaging datasets. Multivariate transfer entropy is well suited for this task, being a model-free measure that captures nonlinear and lagged dependencies between time series to infer a minimal directed network model. Greedy algorithms have been proposed to efficiently deal with high-dimensional datasets while avoiding redundant inferences and capturing synergistic effects. However, multiple statistical comparisons may inflate the false positive rate and are computationally demanding, which limited the size of previous validation studies. The algorithm we present---as implemented in the IDTxl open-source software---addresses these challenges by employing hierarchical statistical tests to control the family-wise error rate and to allow for efficient parallelisation. The method was validated on synthetic datasets involving random networks of increasing size (up to 100 nodes), for both linear and nonlinear dynamics. The performance increased with the length of the time series, reaching consistently high precision, recall, and specificity (>98% on average) for 10000 time samples. Varying the statistical significance threshold showed a more favourable precision-recall trade-off for longer time series. Both the network size and the sample size are one order of magnitude larger than previously demonstrated, showing feasibility for typical EEG and MEG experiments.