The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Bivariate measure of redundant information
Open accessAbstract
We define a measure of redundant information based on projections in the space of probability distributions. Redundant information between random variables is information that is shared between those variables. But, in contrast to mutual information, redundant information denotes information that is shared about the outcome of a third variable. Formalizing this concept, and being able to measure it, is required for the non-negative decomposition of mutual information into redundant and synergistic information. Previous attempts to formalize redundant or synergistic information struggle to capture some desired properties. We introduce a new formalism for redundant information and prove that it satisfies all the properties necessary outlined in earlier work, as well as an additional criterion that we propose to be necessary to capture redundancy. We also demonstrate the behavior of this new measure for several examples, compare it to previous measures, and apply it to the decomposition of transfer entropy.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
An introduction to cybernetics
Ashby, W. R. (1956) · doi:10.5962/bhl.title.5851 · Cited by 7,578
The information bottleneck method
Tishby, N., Pereira, F. C., & Bialek, W. (2000) · arXiv · doi:10.48550/arxiv.physics/0004057 · Cited by 2,626 · cited 1×
“These problems have been noted by Griffith [15], who recently proposed [16] a synergy/redundancy measure based on intrinsic conditional information [23], which shares similarities with an information bottleneck [26].”
BackgroundIntegrated information in discrete dynamical systems: motivation and theoretical framework
Balduzzi, D., & Tononi, G. (2008) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000091 · Cited by 419
Information Flows in Causal Networks
AY, N., & POLANI, D. (2008) · Advances in Complex Systems · doi:10.1142/s0219525908001465 · Cited by 287 · cited 1×
“Moreover, measures of information flow [5, 17] which are able to measure the overall amount of causal information flow, still struggle with over-determination (i.”
BackgroundSelf-citation
Cited by
JIDT: An Information-Theoretic Toolkit for Studying the Dynamics of Complex Systems
Lizier, J. T. (2014) · Frontiers in Robotics and AI · doi:10.3389/frobt.2014.00011 · Cited by 390
Ince, R. A. A., Giordano, B. L., Kayser, C., Rousselet, G. A., Gross, J., & Schyns, P. G. (2017) · Human Brain Mapping · doi:10.1002/hbm.23471 · Cited by 366
Quantifying unique information
Bertschinger, N., Rauh, J., Olbrich, E., Jost, J., & Ay, N. (2014) · Entropy · doi:10.3390/e16042161 · Cited by 253
Phillips, W. A., Bachmann, T., & Storm, J. F. (2018) · Frontiers in Neural Circuits · doi:10.3389/fncir.2018.00050 · Cited by 62
The partial information decomposition of generative neural network models
Tax, T., Mediano, P., & Shanahan, M. (2017) · Entropy · doi:10.3390/e19090474 · Cited by 55
Metadata
- Authors
- Harder, M., Salge, C., & Polani, D.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2013-01-23
- Volume
- 87
- Issue
- 1
- Pages
- 012130-012130
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2037667080
- Cited by
- 209
- References
- 5
- FWCI
- 9.81
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Bivariate measure of redundant information. https://app.cochat.ai/papers/10.1103/physreve.87.012130
- The paper
- Harder, M., Salge, C., & Polani, D. (2013). Bivariate measure of redundant information. Physical Review E. https://doi.org/10.1103/physreve.87.012130
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.