arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.17829cond-mat.stat-mechcond-mat.dis-nn
收藏

真实世界数据的树状网络:效率与时空尺度分析

Tree networks of real-world data: analysis of efficiency and spatiotemporal scales

Davide Cipollini, Lambert Schomaker

AI总结:

本研究利用统计物理与网络理论方法分析真实世界数据中的树状网络,发现幂律Laplacian谱密度的尺度不变性是实现快速信息流与高效功能的关键,并提出了一种基于谱维度指数来衡量高维数据集复杂性的新度量标准。

摘要:

层次树结构在许多真实世界系统中很常见,从树根和树枝到神经元树突,以及受生物学启发的人工神经网络,再到用于组织和搜索高维模式复杂数据集的技术网络。在层次化自组织系统类别中,我们研究了结构与功能之间的相互作用,这与无序环境中复杂树结构的涌现有关。使用一种创建和搜索真实世界模式树的算法,我们的工作处于统计物理、机器学习和网络理论的交叉点。我们利用von Neumann熵、其广义磁化率,以及最近定义的类热力学量(如功、热和效率),解析了多个相变和连续尺度上的网络特性。我们表明,尺度不变性(即幂律Laplacian谱密度)是构建能够结合快速信息流和足够丰富的信息内部表示的树的关键特征,使系统能够高效地实现其功能任务。此外,系统所适应的环境条件的复杂性被编码在幂律谱密度的指数值中,该指数本质上与网络谱维度相关,并直接影响那些功能高效网络的特性。因此,我们提供了一种新的度量标准来估计高维数据集的复杂性。

英文摘要:

Hierarchical tree structures are common in many real-world systems, from tree roots and branches to neuronal dendrites and biologically inspired artificial neural networks, as well as in technological networks for organizing and searching complex datasets of high-dimensional patterns. Within the class of hierarchical self-organized systems, we investigate the interplay of structure and function, associated with the emergence of complex tree structures in disordered environments. Using an algorithm that creates and searches trees of real-world patterns, our work stands at the intersection of statistical physics, machine learning, and network theory. We resolve the network properties over multiple phase transitions and across a continuity of scales, using the von Neumann entropy, its generalized susceptibility, and the recent definition of thermodynamic-like quantities, such as work, heat, and efficiency. We show that scale-invariance, i.e. power-law Laplacian spectral density, is a key feature to construct trees capable of combining fast information flow and sufficiently rich internal representation of information, enabling the system to achieve its functional task efficiently. Moreover, the complexity of the environmental conditions the system has adapted to is encoded in the value of the exponent of the power-law spectral density, inherently related to the network spectral dimension, and directly influencing the traits of those functionally efficient networks. Thereby, we provide a novel metric to estimate the complexity of high-dimensional datasets.

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

↑