Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 5 min ago
PreprintCC BY 4.0arXiv

An information-geometric formulation of distributed computation

Abstract

Understanding how complex systems perform computations, i.e. how they store, transmit, and transform information across their components, is a major goal across the natural sciences. However, characterising genuinely collective computations across multiple inputs and outputs that cannot be reduced to contributions from individual components remains an open problem. In this work, we introduce ΦIDIG, a geometric theory of information dynamics that captures irreducible collective phenomena and enables a complete decomposition of multi-input multi-output operations into interpretable computational modes, providing a complete informational profile of a system. We first validate our framework to identify and quantify distinct computational modes in discrete and Gaussian systems with known ground truth. We then apply it to uncover the computational architecture of complex systems across synthetic and real-world scenarios, including chaotic maps, where distinct universality classes are associated with characteristic modes of computation; brain anatomy of over 100 mammalian species, revealing an evolutionary shift towards more distributed computation in the human neocortex; and financial markets, where collective computations recover the modular organisation of market sectors. Overall, our results show how complex systems can be quantitatively investigated through multidimensional computational portraits derived from the geometry of their underlying probability distributions.

Related

  1. Reactive flash for ideal multiphase mixtures: Unified formulation and efficient computation
    Maxime Jonval, Ibtihel Ben Gharbia, Clément Cancès +2
    Journal of Computational PhysicsPeer-reviewedCC BY-NC-ND 4.0Full textGeneral chemistryNumerical analysis & scientific computingHAL
  2. Privacy-Constrained Function Computation in Distributed Databases
    Vamoua Yachongka, Rémi A. Chou
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  3. Deterministic Distributed Linearly Separable Computation via Nested Cyclic Codes
    Anu Mathew, M. Nikhil Krishnan
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  4. Memory-Augmented Phase-Field Modeling: Onsager Formulation, Internal-Variable Lifting, and Structure-Preserving Computation
    Peng Ding, Qingxia Liu, Zhiping Mao +1
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  5. Capacity Meets the Four Subspace Problem: Distributed Linear Computation and the Cross-Ratio
    Hua Sun
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
BibTeX
@misc{liardi2026informationgeometric,
  title = {{An information-geometric formulation of distributed computation}},
  author = {Alberto Liardi and George Blackburne and Pedro A. M. Mediano},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.03545},
  eprint = {2611.03545},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.03545},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - An information-geometric formulation of distributed computation
AU  - Alberto Liardi
AU  - George Blackburne
AU  - Pedro A. M. Mediano
PY  - 2026
DA  - 2026/11/02
PB  - arXiv
DO  - 10.48550/arxiv.2611.03545
UR  - https://arxiv.org/abs/2611.03545
AB  - Understanding how complex systems perform computations, i.e. how they store, transmit, and transform information across their components, is a major goal across the natural sciences. However, characterising genuinely collective computations across multiple inputs and outputs that cannot be reduced to contributions from individual components remains an open problem. In this work, we introduce ΦID^IG, a geometric theory of information dynamics that captures irreducible collective phenomena and enables a complete decomposition of multi-input multi-output operations into interpretable computational modes, providing a complete informational profile of a system. We first validate our framework to identify and quantify distinct computational modes in discrete and Gaussian systems with known ground truth. We then apply it to uncover the computational architecture of complex systems across synthetic and real-world scenarios, including chaotic maps, where distinct universality classes are associated with characteristic modes of computation; brain anatomy of over 100 mammalian species, revealing an evolutionary shift towards more distributed computation in the human neocortex; and financial markets, where collective computations recover the modular organisation of market sectors. Overall, our results show how complex systems can be quantitatively investigated through multidimensional computational portraits derived from the geometry of their underlying probability distributions.
ER  -