Reshuffling scale-free networks: From random to assortative

Abstract:

An algorithm, which produces assortative mixing to a desired degree was introduced to analyze the role of assortativity in networks. The algorithm was applied to a Barabasi-Albert scale-free network and shown that the degree or assortativity is an important parameter governing the geometrical and transport properties of networks. It was observed that the concentration dependences of the size of giant component in the node percolation problem for uncorrelated and assortative networks are strongly different. It was observed that the assortative correlations have a drastic influence on the statistical properties of networks, changing strikingly their average path length and percolation properties, as well as leading to an increase in their clustering.

Año de publicación:

2004

Keywords:

Fuente:

scopus