Dependence of the average to-node distance on the node degree for random graphs and growing networks

Details Dependence of the average to-node distance on the node degree for random graphs and growing networks Dependence of the average to-node distance on the node degree for random graphs and growing networks

2004-02-18

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

Eur. Phys. J. B41 (2004) 333

Physics

Condensed Matter

Statistical Mechanics

7 pages, 2 figures

Scientific paper

10.1140/epjb/e2004-00326-3

In a graph, nodes can be characterized locally (with their degree $k$) or globally (e.g. with their average length path $\xi$ to other nodes). Here we investigate how $\xi$ depends on $k$. Our earlier algorithm of the construction of the distance matrix is applied to the random graphs. Numerical calculations are performed for the random graphs and the growing networks: the scale-free ones and the exponential ones. The results are relevant for search strategies in different networks.

Affiliated with

Also associated with

No associations

Rating

Dependence of the average to-node distance on the node degree for random graphs and 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 Dependence of the average to-node distance on the node degree for random graphs and growing networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dependence of the average to-node distance on the node degree for random graphs and growing networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-180784