Demystifying Fixed -Nearest Neighbor Information Estimators
Estimating mutual information from independent identically distributed samples drawn from
an unknown joint density function is a basic statistical problem of broad interest with …
an unknown joint density function is a basic statistical problem of broad interest with …
Multivariate mutual information inspired by secret-key agreement
C Chan, A Al-Bashabsheh, JB Ebrahimi… - Proceedings of the …, 2015 - ieeexplore.ieee.org
The capacity for multiterminal secret-key agreement inspires a natural generalization of
Shannon's mutual information from two random variables to multiple random variables …
Shannon's mutual information from two random variables to multiple random variables …
Info-clustering: A mathematical theory for data clustering
C Chan, A Al-Bashabsheh, Q Zhou… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
We formulate an info-clustering paradigm based on a multivariate information measure,
called multivariate mutual information, that naturally extends Shannon's mutual information …
called multivariate mutual information, that naturally extends Shannon's mutual information …
Successive omniscience
C Chan, A Al-Bashabsheh, Q Zhou… - IEEE Transactions …, 2016 - ieeexplore.ieee.org
Because the exchange of information among all the users in a large network can take a long
time, a successive omniscience protocol is proposed. Namely, subgroups of users first …
time, a successive omniscience protocol is proposed. Namely, subgroups of users first …
On the optimality of secret key agreement via omniscience
For the multiterminal secret key agreement problem under a private source model, it is
known that the maximum key rate, ie, the secrecy capacity, can be achieved through …
known that the maximum key rate, ie, the secrecy capacity, can be achieved through …
Algorithms for inferring multiple microbial networks
S Tavakoli, S Yooseph - 2019 IEEE International Conference …, 2019 - ieeexplore.ieee.org
In this paper we consider the computational problem of inferring K microbial networks from a
given sample-taxa matrix. We recently proposed a mixture model framework to address this …
given sample-taxa matrix. We recently proposed a mixture model framework to address this …
Polynomial-time derivation of optimal k-tree topology from Markov networks
FR Dastjerdi, L Cai - arXiv preprint arXiv:2404.05991, 2024 - arxiv.org
Characterization of joint probability distribution for large networks of random variables
remains a challenging task in data science. Probabilistic graph approximation with simple …
remains a challenging task in data science. Probabilistic graph approximation with simple …
When is omniscience a rate-optimal strategy for achieving secret key capacity?
For the multiterminal secret key agreement problem under a private source model, it is
known that the communication complexity required to achieve the capacity can be strictly …
known that the communication complexity required to achieve the capacity can be strictly …
Incremental and decremental secret key agreement
C Chan, A Al-Bashabsheh… - 2016 IEEE International …, 2016 - ieeexplore.ieee.org
We study the rate of change of the multivariate mutual information among a set of random
variables when some common randomness is added to or removed from a subset. This is …
variables when some common randomness is added to or removed from a subset. This is …
Change of multivariate mutual information: From local to global
C Chan, A Al-Bashabsheh… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
We study the change of multivariate mutual information among a set of random variables
when some common randomness is added to or removed from a subset of the random …
when some common randomness is added to or removed from a subset of the random …