KSG mutual information estimator, which is based on the distances of each sample to its k-th
nearest neighbor, is widely used to estimate mutual information between two continuous …

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 …

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 …

Abstract Information theoretic quantities play an important role in various settings in machine
learning, including causality testing, structure inference in graphical models, time-series …

The activities of science, technology, and innovation are related to the execution of actions
involving research, experimental development, support for education and training, provision …

Shared information is a measure of mutual dependence among m≥ 2 jointly distributed
discrete random variables. A new undirected probabilistic graphical model, a cliqueylon …

This paper considers the communication for omniscience problem: a set of users observe a
discrete memoryless multiple source and want to recover the entire multiple source via noise …

Shared information is a measure of mutual dependence among multiple jointly distributed
random variables with finite alphabets. For a Markov chain on a tree with a given joint …

We consider the problem of universal joint clustering and registration of images. Image
clustering focuses on grouping similar images, while image registration refers to the task of …

This paper investigates the secret key generation in the multiterminal source model, where
users observing correlated sources discuss interactively under limited rates to agree on a …