arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.05879cs.ITcs.DMcs.SImath.IT
收藏

多维网络中的数学信息失真

An Algorithmic Information Distortion in Multidimensional Networks

Felipe S. Abrahão, Klaus Wehmuth, Hector Zenil, Artur Ziviani

摘要:

网络复杂性、网络信息量分析以及图表示的无损压缩性在网络分析和网络建模中起着重要的作用。随着多维网络(如时变、多层或动态多层网络)在网络科学中获得更多的相关性,研究在哪些情况下基于应用于图的算法信息论的通用算法方法不能直接导入多维情况变得至关重要。在这个方向上,作为无损压缩性失真的最坏情况,随着不同维度的数量线性增加,本文提出了一个反直觉的现象,当处理非均匀和足够大的多维空间内的网络时。特别是,我们证明了,在一般情况下,对同构于可压缩单重网络的多维网络进行编码所需的算法信息可能会显示出指数级更大的失真。

英文摘要:

Network complexity, network information content analysis, and lossless compressibility of graph representations have been played an important role in network analysis and network modeling. As multidimensional networks, such as time-varying, multilayer, or dynamic multilayer networks, gain more relevancy in network science, it becomes crucial to investigate in which situations universal algorithmic methods based on algorithmic information theory applied to graphs cannot be straightforwardly imported into the multidimensional case. In this direction, as a worst-case scenario of lossless compressibility distortion that increases linearly with the number of distinct dimensions, this article presents a counter-intuitive phenomenon that occurs when dealing with networks within non-uniform and sufficiently large multidimensional spaces. In particular, we demonstrate that the algorithmic information necessary to encode multidimensional networks that are isomorphic to logarithmically compressible monoplex networks may display exponentially larger distortions in the general case.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑