Assortifying Networks

作者：Yang Rong^*

来源：New Generation Computing, 2014, 32(3-4): 297-308.

DOI：10.1007/s00354-014-0406-5

• Complex Networks
• Assortativity
• Degree Distribution
• Community Decompositions
• Rewiring

Since its introduction, the concept of assortativity has proved to be a fundamental metric for understanding the structure and function of complex networks. It has been shown to have a significant impact on many processes on networks, including epidemic thresholds, spreading, and longevity, congestion relief, and information cascades. In a number of these results, the degree distribution (usually a power-law distribution) plays a critical role. We describe a simple but effective method for modifying a given network so as to either increase or decrease its assortativity while preserving the degree distribution of the network. The process is easily controlled to yield desired assortativities. A modification is given which not only preserves the degree of every vertex but also respects a given community structure on the network. Both algorithms are supported by detailed empirical results. The constructions should be of particular value to investigators seeking to measure the impact of assortativity in various applications without disturbing the overall degree distribution or community decompositions.

• 出版日期2014-8