Specific and complete local integration of patterns in Bayesian networks
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 ι-entities in small example systems as a first sanity check and find that ι-entities largely fulfil simple expectations.
Item Type | Article |
---|---|
Additional information | © 2017 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/). The Version of Record, Daniel Polani, et al, Entropy, Vol. 19 (5), Article number 230, published 18 May 2017, is available online at doi:10.3390/e19050230. |
Keywords | identity over time, bayesian networks, multi-information, entity, persistence, integration, emergence, naturalising agency |
Date Deposited | 15 May 2025 13:30 |
Last Modified | 31 May 2025 00:11 |