Fetching the paper…
Reading the bibliography…
Multivariate information decompositions hold promise to yield insight into complex systems, and stand out for their ability to identify synergistic phenomena.
M. M. Waldrop, Complexity: The Emerging Science at the Edge of Order and Chaos . Simon and Schuster, 1993
1993
Earlier work this paper cites.
D. P. Feldman and J. P. Crutchfield, “Measures of statistical complexity: Why?” Physics Letters A , vol. 238, no. 4-5, pp. 244–252, 1998
1998
Earlier work this paper cites.
S.-I. Amari, “Information geometry on hierarchy of probability distributions,” IEEE Transactions on Information Theory , vol. 47, no. 5, pp. 1701–1711, 2001
2001
Earlier work this paper cites.
G. Chechik, A. Globerson, M. J. Anderson, E. D. Young, I. Nelken, and N. Tishby, “Group redundancy measures reveal redundancy reduction in the auditory pathway,” in Advances in Neural Information Processing Systems , 2002, pp. 173–180
2002
Earlier work this paper cites.
I. Nemenman, F. Shafee, and W. Bialek, “Entropy and inference, revisited,” in Advances in Neural Information Processing Systems , 2002, pp. 471–478
2002
Earlier work this paper cites.
E. Schneidman, S. Still, M. J. Berry, and W. Bialek, “Network information and connected correlations,” Physical Review Letters , vol. 91, no. 23, p. 238701, 2003
2003
Earlier work this paper cites.
V. Varadan, D. M. Miller III, and D. Anastassiou, “Computational inference of the molecular logic for synaptic connectivity in C. elegans,” Bioinformatics , vol. 22, no. 14, pp. e497–e506, 2006
2006
Earlier work this paper cites.
2010
Earlier work this paper cites.
E. Ganmor, R. Segev, and E. Schneidman, “Sparse low-order interaction network underlies a highly correlated and learnable neural population code,” Proceedings of the National Academy of Sciences , vol. 108, no. 23, pp. 9679–9684, 2011
2011
Earlier work this paper cites.
M. Harder, C. Salge, and D. Polani, “Bivariate measure of redundant information,” Physical Review E , vol. 87, no. 1, p. 012130, 2013
2013
Earlier work this paper cites.
E. Archer, I. Park, and J. Pillow, “Bayesian and quasi-Bayesian estimators for mutual information from discrete data,” Entropy , vol. 15, no. 5, pp. 1738–1755, 2013
2013
Earlier work this paper cites.
N. Bertschinger, J. Rauh, E. Olbrich, J. Jost, and N. Ay, “Quantifying unique information,” Entropy , vol. 16, no. 4, pp. 2161–2183, 2014
2014
Cited alongside, same era.
J. Rauh, N. Bertschinger, E. Olbrich, and J. Jost, “Reconsidering unique information: Towards a multivariate information decomposition,” in 2014 IEEE International Symposium on Information Theory . IEEE, 2014, pp. 2232–2236
2014
Cited alongside, same era.
V. Griffith and C. Koch, “Quantifying synergistic mutual information,” in Guided Self-Organization: Inception . Springer, 2014, pp. 159–190
2014
Cited alongside, same era.
V. Griffith, E. Chong, R. James, C. Ellison, and J. Crutchfield, “Intersection information based on common randomness,” Entropy , vol. 16, no. 4, pp. 1985–2000, 2014
2014
Cited alongside, same era.
A. B. Barrett, “Exploration of synergistic and redundant information sharing in static and dynamical gaussian systems,” Physical Review E , vol. 91, p. 052802, May 2015
S. Thurner, R. Hanel, and P. Klimek, Introduction to the Theory of Complex Systems . Oxford University Press, 2018
2018
Later among the works it cites.
P. K. Banerjee, J. Rauh, and G. Montúfar, “Computing the unique information,” in 2018 IEEE International Symposium on Information Theory (ISIT) . IEEE, 2018, pp. 141–145
2018
Later among the works it cites.
B. Rassouli, F. Rosas, and D. Gündüz, “Latent feature disclosure under perfect sample privacy,” in 2018 IEEE International Workshop on Information Forensics and Security (WIFS) . IEEE, 2018, pp. 1–7
2018
Later among the works it cites.
R. James, J. Emenheiser, and J. Crutchfield, “Unique information via dependency constraints,” Journal of Physics A: Mathematical and Theoretical , 2018
2018
Later among the works it cites.
C. A. Charalambides, Enumerative Combinatorics . Chapman and Hall/CRC, 2018
2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
M. Wibral, C. Finn, P. Wollstadt, J. T. Lizier, and V. Priesemann, “Quantifying information modification in developing neural networks via partial information decomposition,” Entropy , vol. 19, no. 9, 2017
2017
Cited alongside, same era.
T. M. Tax, P. A. M. Mediano, and M. Shanahan, “The partial information decomposition of generative neural network models,” Entropy , vol. 19, no. 9, 2017
2017
Cited alongside, same era.
R. A. Ince, “Measuring multivariate redundant information with pointwise common change in surprisal,” Entropy , vol. 19, no. 7, p. 318, 2017
2017
Cited alongside, same era.
R. Quax, O. Har-Shemesh, and P. Sloot, “Quantifying synergistic information using intermediate stochastic variables,” Entropy , vol. 19, no. 2, p. 85, 2017
2017
Cited alongside, same era.
F. Rosas, P. A. Mediano, M. Ugarte, and H. J. Jensen, “An information-theoretic approach to self-organisation: Emergence of complex interdependencies in coupled dynamical systems,” Entropy , vol. 20, no. 10, 2018
2018
Cited alongside, same era.
C. Finn and J. T. Lizier, “Pointwise partial information decomposition using the specificity and ambiguity lattices,” Entropy , vol. 20, no. 4, p. 297, 2018
2018
Cited alongside, same era.
In effect, PID merely states formal relationships between its atoms and various Shannon’s mutual information terms
Cited in the paper.
Later among the works it cites.
R. G. James, C. J. Ellison, and J. P. Crutchfield, “dit: a Python package for discrete information theory,” The Journal of Open Source Software , vol. 3, no. 25, p. 738, 2018
2018
Later among the works it cites.
F. E. Rosas, P. A. M. Mediano, M. Gastpar, and H. J. Jensen, “Quantifying high-order interdependencies via multivariate extensions of the mutual information,” Physical Review E , vol. 100, p. 032305, Sep 2019
2019
Later among the works it cites.
R. James, J. Emenheiser, and J. Crutchfield, “Unique information and secret key agreement,” Entropy , vol. 21, no. 1, p. 12, 2019
2019
Later among the works it cites.
2019
Later among the works it cites.
B. Rassouli, F. E. Rosas, and D. Gündüz, “Data disclosure under perfect sample privacy,” IEEE Transactions on Information Forensics and Security , pp. 1–1, 2019
2019
Later among the works it cites.
2019
Later among the works it cites.