Article
Version 1
Preserved in Portico This version is not peer-reviewed
Specific and Complete Local Integration of Patterns in Bayesian Networks
Version 1
: Received: 21 March 2017 / Approved: 21 March 2017 / Online: 21 March 2017 (16:23:00 CET)
A peer-reviewed article of this Preprint also exists.
Biehl, M.; Ikegami, T.; Polani, D. Specific and Complete Local Integration of Patterns in Bayesian Networks. Entropy 2017, 19, 230. Biehl, M.; Ikegami, T.; Polani, D. Specific and Complete Local Integration of Patterns in Bayesian Networks. Entropy 2017, 19, 230.
Abstract
We present a first formal analysis of specific and complete local integration. Complete local integration was previously proposed as a criterion for detecting entities or wholes in distributed dynamical systems. Such entities in turn were conceived to form the basis of a theory of emergence of agents within dynamical systems. Here, we give a more thorough account of the underlying formal measures. The main contribution is the disintegration theorem which reveals a special role of completely locally integrated patterns (what we call ι-entities) within the trajectories they occur in. Apart from proving this theorem we introduce the disintegration hierarchy and its refinement-free version as a way to structure the patterns in a trajectory. Furthermore we construct the least upper bound and provide a candidate for the greatest lower bound of specific local integration. Finally, we calculate the i-entities in small example systems as a first sanity check and find that ι-entities largely fulfil simple expectations.
Keywords
identity over time; Bayesian networks; multi-information; entity; persistence; integration; emergence; naturalising agency
Subject
Computer Science and Mathematics, Mathematics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
