无标度网络的两种互补表示
Two complementary representations of a scale-free network
摘要:
在生物学、经济学或社会学等不同领域,对真实复杂网络的一些研究表明,节点的度(连接到每个节点的边的数量)遵循无标度幂律分布,如$P(k)\approx k^{-γ}$,其中$P(k)$表示连接到$k$其他节点的节点的频率。在这里,我们对无标度网络进行了研究,其中线图变换(即,将初始网络中的边变换为节点)应用于幂律分布。我们的研究结果表明,幂律分布$P(k)\approx k^{-γ+1}$被发现的转换后的网络连同低度节点的峰值。在目前的工作中,我们显示了这种行为的参数化,并讨论其应用到真正的网络代谢网络,蛋白质-蛋白质相互作用网络和万维网。
英文摘要:
Several studies on real complex networks from different fields as biology, economy, or sociology have shown that the degree of nodes (number of edges connected to each node) follows a scale-free power-law distribution like $P(k)\approx k^{-γ}$, where $P(k)$ denotes the frequency of the nodes that are connected to $k$ other nodes. Here we have carried out a study on scale-free networks, where a line graph transformation (i.e., edges in an initial network are transformed into nodes) is applied to a power-law distribution. Our results indicate that a power-law distribution as $P(k)\approx k^{-γ+1}$ is found for the transformed network together with a peak for low-degree nodes. In the present work we show a parametrization of this behaviour and discuss its application to real networks as metabolic networks, protein-protein interaction network and World Wide Web.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。