Construction and properties of assortative random networks

Details Construction and properties of assortative random networks Construction and properties of assortative random networks

2004-05-05

arxiv.org/abs/cond-mat/0405095v1

Phys. Rev. E 70, 066102 (2004)

Physics

Condensed Matter

Statistical Mechanics

5 pages, 5 figures

Scientific paper

10.1103/PhysRevE.70.066102

Many social networks exhibit assortative mixing 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 a Barabasi-Albert scale-free network 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 dramatically with the degree of assortativity. Moreover, the concentration dependences of the size of the giant component in the node percolation problem for uncorrelated and assortative networks are strongly different.

Affiliated with

Also associated with

No associations

Rating

Construction and properties of assortative random networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Construction and properties of assortative random networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Construction and properties of assortative random networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-467054