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

Abstract

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.

7 pages, 2 figures

References in corpus (14)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• Evolution of networks
• Hierarchical Organization in Complex Networks
• Search in Power-Law Networks
• Identity and Search in Social Networks
• Evolution of reference networks with aging
• Path finding strategies in scale-free networks
• Two-Peak and Three-Peak Optimal Complex Networks
• Introduction to Statistical Physics outside Physics
• Metric structure of random networks
• Global Physics: From Percolation to Terrorism, Guerilla Warfare and Clandestine Activities
• Average distance in growing trees

Cited by in corpus (3)

• Degree-dependent intervertex separation in complex networks
• Ferromagnetic Ising spin systems on the growing random tree
• Ageing of complex networks