arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0905.2452cond-mat.stat-mech
收藏

圆盘填料的接触图作为空间平面网络模型

Contact graphs of disk packings as a model of spatial planar networks

Zhongzhi Zhang, Jihong Guan, Bailu Ding, Lichao Chen, Shuigeng Zhou

摘要:

空间受限的平面网络在现实生活中经常遇到。本文基于空间填充的圆盘堆积,提出了空间极大平面网络的一个极小模型,它与Apollonian网络的模型[J. S.小安德拉德例如,物理修订版信函{ \bf 94},018702(2005)]。我们提出了一个详尽的分析,我们的模型的各种属性,并获得解析解的大部分功能,包括度分布,聚类系数,平均路径长度,度相关性。该模型恢复了在大多数真实网络中观察到的一些显著的一般特征。为了解决相关网络属性的鲁棒性,我们比较了所研究的网络和阿波罗网络之间的结构特征。我们证明了这两个网络的拓扑性质是以圆盘填充的方式编码的。我们认为,节点的空间约束是相关的网络的结构。

英文摘要:

Spatially constrained planar networks are frequently encountered in real-life systems. In this paper, based on a space-filling disk packing we propose a minimal model for spatial maximal planar networks, which is similar to but different from the model for Apollonian networks [J. S. Andrade, Jr. et al., Phys. Rev. Lett. {\bf 94}, 018702 (2005)]. We present an exhaustive analysis of various properties of our model, and obtain the analytic solutions for most of the features, including degree distribution, clustering coefficient, average path length, and degree correlations. The model recovers some striking generic characteristics observed in most real networks. To address the robustness of the relevant network properties, we compare the structural features between the investigated network and the Apollonian networks. We show that topological properties of the two networks are encoded in the way of disk packing. We argue that spatial constrains of nodes are relevant to the structure of the networks.

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

↑