The possible correlation profiles of networks with a given scale-free degree distribution are restricted and bounded by maximally correlated configurations. Dissortative networks consist of nested bilayers, in which low-degree vertices are connected to high-degree vertices. The number of these bilayers attains a constant value for large network size N. Assortative networks exhibit monolayers of low-degree vertices, the number of which grows monotonously with N. Analytical relations for the Pearson correlation coefficient r of these extremal configurations are derived and shown to provide lower and upper bounds on the possible r values. Both bounds are found to vanish for large networks.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据