Evolving networks with distance preferences

Details Evolving networks with distance preferences Evolving networks with distance preferences

2002-02-20

arxiv.org/abs/cond-mat/0202343v2

Phys. Rev. E 66, 036126 (2002)

Physics

Condensed Matter

Statistical Mechanics

REVTEX Format, 6 Pages, 6 Figures, 1 Table; References added and Revised

Scientific paper

10.1103/PhysRevE.66.036126

We study evolving networks where new nodes when attached to the network form links with other nodes of preferred distances. A particular case is where always the shortest distances are selected (``make friends with the friends of your present friends''). We present simulation results for network parameters like the first eigenvalue of the graph Laplacian (synchronizability), clustering coefficients, average distances, and degree distributions for different distance preferences and compare with the parameter values for random and scale free networks. We find that for the shortest distance rule we obtain a power law degree distribution as in scale free networks, while the other parameters are significantly different, especially the clustering coefficient.

Affiliated with

Also associated with

No associations

Rating

Evolving networks with distance preferences 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 Evolving networks with distance preferences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Evolving networks with distance preferences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-538544