Deriving pairwise transfer entropy from network structure and motifs

DOI10.1098/rspa.2019.0779zbMath1472.94039arXiv1911.02931OpenAlexW3099071749WikidataQ94601132 ScholiaQ94601132MaRDI QIDQ5160910

Joseph T. Lizier, Fatihcan M. Atay, Leonardo Novelli, Juergen Jost

Publication date: 29 October 2021

Published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.02931

zbMATH Keywords

complexitygraph theoryinformation theorytransfer entropynetwork inferencemotifscomputer modelling and simulationconnectome

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Applications of graph theory to circuits and networks (94C15)

Related Items

Motifs for Processes on Networks, The role of gene regulation in redundant and synergistic information transfers in coherent feed-forward loop

Uses Software

• MuTE
• IDTxl

Cites Work

• Unnamed Item
• A Mathematical Theory of Communication
• Transfer entropy for coupled autoregressive processes
• Topological features determining the error in the inference of networks using transfer entropy
• An Introduction to Transfer Entropy
• Emergence of Scaling in Random Networks
• The Local Information Dynamics of Distributed Computation in Complex Systems
• Dynamical Processes on Complex Networks
• Information modification and particle collisions in distributed computation
• Causal Network Inference by Optimal Causation Entropy
• Collective dynamics of ‘small-world’ networks