Entropic causal inference

M Kocaoglu, A Dimakis, S Vishwanath… - Proceedings of the AAAI …, 2017 - ojs.aaai.org
We consider the problem of identifying the causal direction between two discrete random
variables using observational data. Unlike previous work, we keep the most general …

On quantification and maximization of information transfer in network dynamical systems

MS Singh, R Pasumarthy, U Vaidya, S Leonhardt - Scientific Reports, 2023 - nature.com
Abstract Information flow among nodes in a complex network describes the overall cause-
effect relationships among the nodes and provides a better understanding of the …

Optimal network compression

H Amini, Z Feinstein - European Journal of Operational Research, 2023 - Elsevier
This paper introduces a formulation of the optimal network compression problem for
financial systems. This general formulation is presented for different levels of network …

Noncoherent massive random access for inhomogeneous networks: From message passing to deep learning

J Huang, H Zhang, C Huang, L Yang… - IEEE Journal on …, 2022 - ieeexplore.ieee.org
Massive machine-type communications (mMTC) are expected to support a large amount of
randomly deployed users for short package transmissions. Noncoherent random access …

Generalized independent component analysis over finite alphabets

A Painsky, S Rosset, M Feder - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
Independent component analysis (ICA) is a statistical method for transforming an observable
multi-dimensional random vector into components that are as statistically independent as …

[HTML][HTML] On the entropy of couplings

M Kovačević, I Stanojević, V Šenk - Information and Computation, 2015 - Elsevier
In this paper, some general properties of Shannon information measures are investigated
over sets of probability distributions with restricted marginals. Certain optimization problems …

Entropic causality and greedy minimum entropy coupling

M Kocaoglu, AG Dimakis… - … on Information Theory …, 2017 - ieeexplore.ieee.org
We study the problem of identifying the causal relationship between two discrete random
variables from observational data. We recently proposed a novel framework called entropie …

Profiling the strength of physical-layer security: A study in orthogonal blinding

Y Zheng, M Schulz, W Lou, YT Hou… - Proceedings of the 9th …, 2016 - dl.acm.org
Physical layer security for wireless communication is broadly considered as a promising
approach to protect data confidentiality against eavesdroppers. However, despite its ample …

Memoryless representation of Markov processes

A Painsky, S Rosset, M Feder - 2013 IEEE International …, 2013 - ieeexplore.ieee.org
Memoryless processes hold many theoretical and practical advantages. They are easy to
describe, analyze, store and encrypt. They can also be seen as the essence of a family of …

Playing games with bounded entropy

M Valizadeh, A Gohari - Games and Economic Behavior, 2019 - Elsevier
We study zero-sum repeated games in which the maximizer (player or team) is restricted to
strategies with limited randomness. Particularly, we analyze the maxmin payoff of the …