Mechanism for linear preferential attachment in growing networks

Details Mechanism for linear preferential attachment in growing networks Mechanism for linear preferential attachment in growing networks

2007-08-20

arxiv.org/abs/0708.2598v1

Physica A 356(2005)662

Physics

Data Analysis, Statistics and Probability

10 pages, 1 figure

Scientific paper

10.1016/j.physa.2005.04.005

The network properties of a graph ensemble subject to the constraints imposed by the expected degree sequence are studied. It is found that the linear preferential attachment is a fundamental rule, as it keeps the maximal entropy in sparse growing networks. This provides theoretical evidence in support of the linear preferential attachment widely exists in real networks and adopted as a crucial assumption in growing network models. Besides, in the sparse limit, we develop a method to calculate the degree correlation and clustering coefficient in our ensemble model, which is suitable for all kinds of sparse networks including the BA model, proposed by Barabasi and Albert.

Affiliated with

Also associated with

No associations

Rating

Mechanism for linear preferential attachment in growing 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 Mechanism for linear preferential attachment in growing networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Mechanism for linear preferential attachment in growing networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-532884