查看文章

Nodes distribution by degrees is the most important characteristic of complex networks. For SF-networks it follows a power law. While degree distribution is a first order graph metric, the assortativity is a second order one. The concept of assortativity is extensively using in network analysis. In general degree distribution forms an essential restriction both on the network structure and on assortativity coefficient boundaries. The problem of determining the structure of BA-networks having an extreme assortativity coefficient is considered. Greedy algorithms for generating BA-networks with extreme assortativity have been proposed. As it was found, an extremely disassortative BA-network is asymptotically bipartite, while an extremely assortative one is close to be a set of complete and disconnected clusters. The estimates of boundaries for assortativity coefficient have been found. These boundaries are narrowing with …