arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1605.06607physics.soc-phcs.SIphysics.data-an
收藏

复杂网络度异质性度量及其在递归网络分析中的应用

Measure for degree heterogeneity in complex networks and its application to recurrence network analysis

Rinku Jacob, K. P. Harikrishnan, R. Misra, G. Ambika

摘要:

我们提出了一种新的度量度的异质性,无权和无向的复杂网络,它只需要网络的度分布的计算。我们表明,所提出的措施可以适用于所有类型的网络拓扑结构,轻松,并增加了网络中的节点度的多样性。该测度用于计算合成网络(随机和无标度)和真实世界网络的异质性,其值在区间[0,1]内归一化。为了定义测度,我们引入了一个极限网络,其异质性可以用解析表示,当网络的大小N趋于无穷大时,其值趋于1。我们数值研究随机图(作为p和N的函数)和无标度网络的异质性的变化与N作为变量。最后,作为一个具体的应用,我们表明,所提出的措施可以用来比较的递归网络的异质性构造的时间序列的几个低维混沌吸引子9从而提供了一个单一的指标来比较混沌吸引子的结构复杂性。

英文摘要:

We propose a novel measure of degree heterogeneity, for unweighted and undirected complex networks, which requires only the degree distribution of the network for its computation. We show that the proposed measure can be applied to all types of network topology with ease and increases with the diversity of node degrees in the network. The measure is applied to compute the heterogeneity of synthetic (both random and scale free) and real world networks with its value normalized in the interval [0, 1]. To define the measure, we introduce a limiting network whose heterogeneity can be expressed analytically with the value tending to 1 as the size of the network N tends to infinity. We numerically study the variation of heterogeneity for random graphs (as a function of p and N) and for scale free networks with and N as variables. Finally, as a specific application, we show that the proposed measure can be used to compare the heterogeneity of recurrence networks constructed from the time series of several low dimensional chaotic attractors9thereby providing a single index to compare the structural complexity of chaotic attractors.

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

↑