Regensburg 2004 – wissenschaftliches Programm

Bereiche | Tage | Auswahl | Suche | Downloads | Hilfe

DY: Dynamik und Statistische Physik

DY 46: Poster

DY 46.61: Poster

Donnerstag, 11. März 2004, 16:00–18:00, Poster D

Assortative random networks: Construction and properties — •Ramon Xulvi-Brunet and Igor M. Sokolov — Newtonstr 15, D-12489 Berlin

Since recently it got clear that many social networks exhibit assortative mixing [M. E. J. Newman, Phys. Rev. Lett. 89, 208701 (2002)] so that the predictions of uncorrelated models might be inadequate. To analyze the role of assortativity we introduce an algorithm which changes correlations in a network and produces assortative mixing to a desired degree. This degree is governed by one parameter p; changing this parameter one can construct networks ranging from fully random (p=0) to totally assortative (p=1). We apply the algorithm to the Barabási-Albert scale-free construction and show that the degree of assortativity is an important parameter governing geometrical and transport properties of networks. Thus the diameter of the network and the clustering coefficient increase remarkably with the degree of assortativity. Moreover, the concentration dependences of the size of giant cluster in the node percolation problem for uncorrelated and assortative networks are strongly different [R. Xulvi-Brunet, W. Pietsch, and I. M. Sokolov, Phys. Rev. E 68, 036119 (2003)].