Clustering in random line graphs

Details Clustering in random line graphs Clustering in random line graphs

2009-04-05

arxiv.org/abs/0904.0659v2

Computer Physics Communication 181 (2010) 118

Physics

Computational Physics

9 pages, 4 figures

Scientific paper

We investigate the degree distribution $P(k)$ and the clustering coefficient $C$ of the line graphs constructed on the Erd\"os-R\'enyi networks, the exponential and the scale-free growing networks. We show that the character of the degree distribution in these graphs remains Poissonian, exponential and power law, respectively, i.e. the same as in the original networks. When the mean degree $$ increases, the obtained clustering coefficient $C$ tends to 0.50 for the transformed Erd\"os-R\'enyi networks, to 0.53 for the transformed exponential networks and to 0.61 for the transformed scale-free networks. These results are close to theoretical values, obtained with the model assumption that the degree-degree correlations in the initial networks are negligible.

Affiliated with

Also associated with

No associations

Rating

Clustering in random line graphs 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 Clustering in random line graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clustering in random line graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-132401