Information parity in complex networks
A growing interest in complex networks theory results in an ongoing demand for new analytical tools. We propose a novel measure based on information theory that provides a new perspective for a better understanding of networked systems: Termed "information parity," it quantifies the consonance of influence among nodes with respect to the whole network architecture. Considering the statistics of geodesic distances, information parity detects how similar a pair of nodes can influence and be influenced by the network. This allows us to quantify the quality of information gathered by the nodes. To demonstrate the method's potential, we evaluate a social network and human brain networks. Our results indicate that emerging phenomena like an ideological orientation of nodes in a social network is severely influenced by their information parities. We also show that anatomical brain networks have a greater information parity in inter-hemispheric correspondent regions placed near the sagittal plane. Finally, functional networks have, on average, greater information parity for inter-hemispheric correspondent regions in comparison to the whole network. We find that a pair of regions with high information parity exhibits higher correlation, suggesting that the functional correlations between cortical regions can be partially explained by the symmetry of their overall influences of the whole brain.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Controllable Guarantees for Fair Outcomes via Contrastive Information Estimation
Controlling bias in training datasets is vital for ensuring equal treatment, or parity, between different groups in downstream applications. A naive solution is to transform the data so that it is statistically independe…
FairnessNovel projection schemes for graph-based Light Field coding
In Light Field compression, graph-based coding is powerful to exploit signal redundancy along irregular shapes and obtains good energy compaction. However, apart from high time complexity to process high dimensional grap…
Decodergraph constructionThe Sample Complexity of Distribution-Free Parity Learning in the Robust Shuffle Model
We provide a lowerbound on the sample complexity of distribution-free parity learning in the realizable case in the shuffle model of differential privacy. Namely, we show that the sample complexity of learning $d$-bit pa…
Toward Real World Stereo Image Super-Resolution via Hybrid Degradation Model and Discriminator for Implied Stereo Image Information
Real-world stereo image super-resolution has a significant influence on enhancing the performance of computer vision systems. Although existing methods for single-image super-resolution can be applied to improve stereo i…
Image Super-ResolutionStereo Image Super-ResolutionSuper-ResolutionSdf-GAN: Semi-supervised Depth Fusion with Multi-scale Adversarial Networks
Refining raw disparity maps from different algorithms to exploit their complementary advantages is still challenging. Uncertainty estimation and complex disparity relationships among pixels limit the accuracy and robustn…
Setting-1/2