结构的信息成本:网络动力系统中的表示复杂性
The Informational Cost of Structure: Representational Complexity in Networked Dynamical Systems
AI总结:
用算法信息论探讨表示动力系统所需信息,引入表示复杂性,给出通用下限。分析任意规则下不同形式主义的情况,确定图与超图描述信息等价的条件及不同 regime 出现条件,并用描述长度估计补充形式结果。
摘要:
用交互结构和演化规则表示动力系统需要多少信息?我们用算法信息论解决这个问题。我们引入表示复杂性,即结构加规则模型相对于动力学本身最短可能描述的额外描述长度。这种内在描述定义了一个通用下限:没有精确的结构表示能更简洁。如果允许任意规则,图、超图和其他形式主义都可以通过在结构和动力学之间转移信息达到这个界限,所以仅表现力无法区分它们。只有当科学建模限制可接受的结构和规则时,才有有意义的差异。在此背景下,我们确定了图和超图描述在信息上等价的条件,并展示了当这些条件放宽时,图偏好、超图偏好和混合 regime 如何出现。由于柯尔莫哥洛夫复杂性不可计算,我们用明确的描述长度估计来补充形式结果。我们的框架将网络表示的选择重新构建为一个信息成本和机制透明度的问题,而不是通用表现力的问题。
英文摘要:
How much information is required to represent a dynamical system in terms of an interaction structure and an evolution rule? We address this question using algorithmic information theory. We introduce Representational Complexity, the excess description length of a structure-plus-rule model relative to the shortest possible description of the dynamics itself. This intrinsic description defines a universal lower bound: no exact structural representation can be more concise. If arbitrary rules are allowed, graphs, hypergraphs, and other formalisms can all reach this bound by shifting information between structure and dynamics, so expressiveness alone cannot distinguish them. Meaningful differences arise only when scientific modeling restricts the admissible structures and rules. Within this setting, we identify conditions under which graph and hypergraph descriptions are informationally equivalent, and show how graph-preferred, hypergraph-preferred, and mixed regimes can emerge when those conditions are relaxed. Because Kolmogorov complexity is not computable, we complement the formal results with explicit description-length estimates. Our framework reframes the choice of network representation as a question of informational cost and mechanistic transparency rather than universal expressive power.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。