搜索

x
中国物理学会期刊

多种形式的加权广义Farey组织网络金字塔的复杂性

CSTR: 32037.14.aps.59.3704

Complexity of multi-architecture type of deterministic weighted generalized Farey organized network pyramid

CSTR: 32037.14.aps.59.3704
PDF
导出引用
  • 构建了三类确定性加权广义Farey组织的网络金字塔.理论推导并数值计算了网络金字塔的拓扑性质(度分布、平均最短路径、平均聚类系数和相称性系数等), 进而将Farey序列作为网络节点的确定、随机和混合的三种权重值,以此为基础计算并拟合了三类网络金字塔的点的强度分布和边的权重分布.计算结果初步揭示了加权广义Farey组织的网络金字塔的复杂性特征,有助于了解一些实际网络的复杂性和多样性.

     

    Three types of deterministic weighted generalized Farey organized network pyramids(so-called WGFONP-1,WGFONP-2, WGFONP-3) are constructed, and the topological characteristics (degree distribution, average path length, clustering coefficient, assortative coefficient and so on) of network pyramids are studied by theoretical and numerical analyses. Using Farey sequence as determinacy, randomicity and hybrid weights of network nodes, we calculate and fit the strength distribution and the weight distribution of the network pyramids, as well as tentatively reveal the complexities and the diversities of the WGFONP-1,WGFONP-2 and WGFONP-3. These results can conduce to the understanding of complexities and diversities of a number of practical networks.

     

    目录

    /

    返回文章
    返回