Papers › Network Representation of Higher-Order Interactions Based on Information Dynamics
Network Representation of Higher-Order Interactions Based on Information Dynamics
Gorana Mijatovic, Yuri Antonacci, Michal Javorka, Daniele Marinazzo, Sebastiano Stramaglia, Luca Faes
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Many complex systems in science and engineering are modeled as networks whose nodes and links depict the temporal evolution of each system unit and the dynamic interaction between pairs of units, which are assessed respectively using measures of auto- and cross-correlation or variants thereof. However, a growing body of work is documenting that this standard network representation can neglect potentially crucial information shared by three or more dynamic processes in the form of higher-order interactions (HOIs). While several measures, mostly derived from information theory, are available to assess HOIs in network systems mapped by multivariate time series, none of them is able to provide a compact and detailed representation of higher-order interdependencies. In this work, we fill this gap by introducing a framework for the assessment of HOIs in dynamic network systems at different levels of resolution. The framework is grounded on the dynamic implementation of the O-information, a new measure assessing HOIs in dynamic networks, which is here used together with its local counterpart and its gradient to quantify HOIs respectively for the network as a whole, for each link, and for each node. The integration of these measures into the conventional network representation results in a tool for the representation of HOIs as networks, which is defined formally using measures of information dynamics, implemented in its linear version by using vector regression models and statistical validation techniques, illustrated in simulated network systems, and finally applied to an illustrative example in the field of network physiology.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections