Intersection Information Based on Common Randomness
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
The introduction of the partial information decomposition generated a flurry of proposals for defining an intersection information that quantifies how much of “the same information” two or more random variables specify about a target random variable. As of yet, none is wholly satisfactory. A palatable measure of intersection information would provide a principled way to quantify slippery concepts, such as synergy. Here, we introduce an intersection information measure based on the Gács-Körner common random variable that is the first to satisfy the coveted target monotonicity property. Our measure is imperfect, too, and we suggest directions for improvement.
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
Negative Entropy and Information in Quantum Mechanics
Cerf, N. J., & Adami, C. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.5194 · Cited by 461
Cited by
A Tutorial for Information Theory in Neuroscience
Timme, N. M., & Lapish, C. (2018) · eneuro · doi:10.1523/eneuro.0052-18.2018 · Cited by 242
“While the minimum information possesses distinct advantages over other methods, it has been shown that it measures the redundant amount of information as opposed to the redundant content, which several authors find counterintuitive (Harder et al., 2013; Bertschinger et al., 2014; Griffith et al., 2014; Ince, 2017).”
BackgroundMethodInfluentialInformation decomposition and the informational architecture of the brain
Luppi, A. I., Rosas, F. E., Mediano, P. A. M., Menon, D. K., & Stamatakis, E. A. (2024) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2023.11.005 · Cited by 140
Causal composition: Structural differences among dynamically equivalent systems
Albantakis, L., & Tononi, G. (2019) · Entropy · doi:10.3390/e21100989 · Cited by 30
Continuity and additivity properties of information decompositions
Rauh, J., Banerjee, P. K., Olbrich, E., Montúfar, G., & Jost, J. (2023) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2023.108979 · Cited by 7
Metadata
- Authors
- Griffith, V., Chong, E., James, R., Ellison, C., & Crutchfield, J.
- Venue
- Entropy
- Publisher
- MDPI AG
- Published
- 2014-04-04
- Volume
- 16
- Issue
- 4
- Pages
- 1985-2000
- ISSN
- 1099-4300 (ISSN-L)
- OpenAlex
- W2165559465
- Cited by
- 84
- References
- 1
- FWCI
- 5.93
- Type
- journal article
- Language
- en
- Open access
- gold
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: Intersection Information Based on Common Randomness. https://app.cochat.ai/papers/10.3390/e16041985
- The paper
- Griffith, V., Chong, E., James, R., Ellison, C., & Crutchfield, J. (2014). Intersection Information Based on Common Randomness. Entropy. https://doi.org/10.3390/e16041985
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.