论不可压缩多维网络中的序列结构
On sequential structures in incompressible multidimensional networks
AI总结:
本文研究不可压缩多维网络中序列结构与信息增长的关系,证明不可压缩性可消除序列信息动力学与序列拓扑之间的不协调,从而为多维网络拓扑提供超越统计概率方法的必要底层约束。
摘要:
为了处理现实世界网络的多维结构表示及其最坏情况下不可约信息内容的分析,对新图抽象的需求日益增加。本文研究由广义图表示定义的不可压缩多维网络。特别地,我们从数学上研究快照动态网络和多路复用网络的无损不可压缩性,并与更一般形式的动态网络和多层网络的无损不可压缩性进行比较,其中快照动态网络或多路复用网络是特例。我们的理论研究首先探索将信息的序列增长与序列性跨维结构(例如动态网络中的时间)联系起来的基本条件,其次提出需要未来研究的开放问题。尽管在一般情况下序列信息动力学与序列拓扑之间可能存在不协调,我们证明不可压缩性消除了这种不协调,防止多维网络的算法动力学和跨维结构表现出类似快照的行为(如任意数学理论所刻画的那样)。因此,超越传统随机图和复杂网络模型中基于统计或概率的方法,表示不可压缩性意味着多维网络拓扑中存在一种必要的底层约束。我们认为,研究同构变换及其各自的算法信息失真如何刻画(多维)网络中的序列性跨维结构,有助于分析网络拓扑性质,同时对所选择的理论、算法、计算模型和编程语言保持无关性。
英文摘要:
In order to deal with multidimensional structure representations of real-world networks, as well as with their worst-case irreducible information content analysis, the demand for new graph abstractions increases. This article investigates incompressible multidimensional networks defined by generalized graph representations. In particular, we mathematically study the lossless incompressibility of snapshot-dynamic networks and multiplex networks in comparison to the lossless incompressibility of more general forms of dynamic networks and multilayer networks, from which snapshot-dynamic networks or multiplex networks are particular cases. Our theoretical investigation first explores fundamental and basic conditions for connecting the sequential growth of information with sequential interdimensional structures such as time in dynamic networks, and secondly it presents open problems demanding future investigation. Although there may be a dissonance between sequential information dynamics and sequential topology in the general case, we demonstrate that incompressibility dissolves it, preventing both the algorithmic dynamics and the interdimensional structure of multidimensional networks from displaying a snapshot-like behavior (as characterized by any arbitrary mathematical theory). Thus, beyond methods based on statistics or probability as traditionally seen in random graphs and complex networks models, representational incompressibility implies a necessary underlying constraint in the multidimensional network topology. We argue that the study of how isomorphic transformations and their respective algorithmic information distortions can characterize sequential interdimensional structures in (multidimensional) networks helps the analysis of network topological properties while being agnostic to the chosen theory, algorithm, computation model, and programming language.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。