Ramon Xulvi-Brunet School of Mathematics and Statistics, University of Sydney Construction and properties of assortative networks Wednesday 16th August 14:05-14:55pm, Carslaw Building Room 373. Real networks are degree-degree correlated, and many of them show "assortative" mixing. To analyze the role of assortativity in networks we introduce an algorithm which 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 a Barabási-Albert scale-free network (a quite realistic network model) and show that the degree of assortativity is an important parameter governing the geometrical and transport properties of networks. Thus, the average path length, the clustering coefficient, and the percolation properties of networks change dramatically with the degree of assortativity.