Journal
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING
Volume 5, Issue 1, Pages 42-54Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TNSE.2017.2731212
Keywords
Information theory; network; policy diffusion; transfer entropy
Funding
- US National Science Foundation [CMMI 1433670, CBET 1547864]
- US Army Research Office [W911NF-15-1-0267]
- Ministerio de Economia y Competitividad de Espana and FEDER [ECO2015-65637-P]
- Fundacion Seneca, Science and Technology Agency of the region of Murcia project [19884/GERM/15]
- Div Of Chem, Bioeng, Env, & Transp Sys
- Directorate For Engineering [1547864] Funding Source: National Science Foundation
Ask authors/readers for more resources
Networks are pervasive across science and engineering, but seldom do we precisely know their topology. The information-theoretic notion of transfer entropy has been recently proposed as a potent means to unveil connectivity patterns underlying collective dynamics of complex systems. By pairwise comparing time series of units in the network, transfer entropy promises to determine whether the units are connected or not. Despite considerable progress, our understanding of transfer entropy-based network reconstruction largely relies on computer simulations, which hamper the precise and systematic assessment of the accuracy of the approach. In this paper, we present an analytical study of the information flow in a network model of policy diffusion, thereby establishing closed-form expressions for the transfer entropy between any pair of nodes. The model consists of a finite-state ergodic Markov chain, for which we compute the joint probability distribution in the stationary limit. Our analytical results offer a compelling evidence for the potential of transfer entropy to assist in the process of network reconstruction, clarifying the role and extent of tenable confounds associated with spurious connections between nodes.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available