arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2205.07151cond-mat.mtrl-sciphysics.comp-ph
收藏

具有分形形态的空间系统的网络效率:一种几何图方法

Network efficiency of spatial systems with fractal morphology: a geometric graphs approach

A. C. Flores-Ortega, J. R. Nicolás-Carlock, J. L. Carrillo-Estrada

AI总结:

本文用几何图方法研究具有分形形态的空间网络效率,发现复杂树状形态在结构成本上具有优势,且通过极短欧几里得连通性可使分形树的效率接近稳健六角晶格。

摘要:

空间网络的功能特征取决于拓扑结构与物理结构之间非平凡的关系。在此,我们探索具有径向对称性和无序分形形态的空间网络中的这种关系。在几何图方法下,我们量化了系统中从中心到周边以及整个网络结构上的信息交换有效性。我们主要考虑两种无序分形形成的范式模型,即弹道聚集(Ballistic Aggregation)模型和扩散限制聚集(Diffusion-Limited Aggregation)模型,并补充考虑 Viscek 分形和 Hexaflake 分形,以及 Kagome 晶格和六角晶格。首先,我们表明复杂的树状形态相比规则构型提供了重要优势,例如在不同分形维数下具有不变的结构成本。此外,尽管这些系统已知在空间上是无标度的,但它们在不同的欧几里得连通性参数值下具有有界的度分布,因此并不代表普通的无标度网络。最后,与规则结构相比,分形树如预期那样脆弱且整体效率较低;然而,我们表明,只需考虑超出最近邻的极短欧几里得连通性,这种效率就能在相似成本下变得与稳健的六角晶格相当。

英文摘要:

The functional features of spatial networks depend upon a non-trivial relationship between the topological and physical structure. Here, we explore that relationship for spatial networks with radial symmetry and disordered fractal morphology. Under a geometric graphs approach, we quantify the effectiveness of the exchange of information in the system from center to perimeter and over the entire network structure. We mainly consider two paradigmatic models of disordered fractal formation, the Ballistic Aggregation and Diffusion-Limited Aggregation models, and complementary, the Viscek and Hexaflake fractals, and Kagome and Hexagonal lattices. First, we show that complex tree morphologies provide important advantages over regular configurations, such as an invariant structural cost for different fractal dimensions. Furthermore, although these systems are known to be scale-free in space, they have bounded degree distributions for different values of an euclidean connectivity parameter and, therefore, do not represent ordinary scale-free networks. Finally, compared to regular structures, fractal trees are fragile and overall inefficient as expected, however, we show that this efficiency can become similar to that of a robust hexagonal lattice, at a similar cost, by just considering a very short euclidean connectivity beyond first neighbors.

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

↑