Uncovering hidden dependency in weighted networks via information entropy
Mi Jin Lee, Eun Lee, Byunghwee Lee, Hawoong Jeong, Deok-Sun Lee, Sang, Hoon Lee

TL;DR
This paper introduces a novel framework using information entropy to uncover hidden dependency relations in weighted networks by identifying the most essential interactions for each node.
Contribution
It proposes a systematic criterion based on information entropy to extract the most significant directed interactions, revealing hidden dependencies in weighted networks.
Findings
Revealed distinct mutual dependency properties in international trade and historical social networks.
Demonstrated the effectiveness of the entropy-based method on real-world empirical data.
Identified key interactions that define the underlying dependency structure in complex networks.
Abstract
Interactions between elements, which are usually represented by networks, have to delineate potentially unequal relationships in terms of their relative importance or direction. The intrinsic unequal relationships of such kind, however, are opaque or hidden in numerous real systems. For instance, when a node in a network with limited interaction capacity spends its capacity to its neighboring nodes, the allocation of the total amount of interactions to them can be vastly diverse. Even if such potentially heterogeneous interactions epitomized by weighted networks are observable, as a result of the aforementioned ego-centric allocation of interactions, the relative importance or dependency between two interacting nodes can only be implicitly accessible. In this work, we precisely pinpoint such relative dependency by proposing the framework to discover hidden dependent relations extracted…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
