Dependence of the average to-node distance on the node degree for random graphs and growing networks
Faculty of Physics and Applied Computer Science, AGH University of Science and Technology, al. Mickiewicza 30, PL-30059 Kraków, Poland
Corresponding author: a firstname.lastname@example.org
Revised: 15 June 2004
Published online: 21 October 2004
In a connected graph, nodes can be characterised locally (with their degree k) or globally (e.g. with their average length path ξ to other nodes). Here we investigate how ξ depends on k. The numerical algorithm based on the construction of the distance matrix is applied to random graphs and the growing networks: the scale-free ones and the exponential ones. The results are relevant for search strategies in different networks.
PACS: 02.10.Ox – Combinatorics; graph theory / 05.10.-a – Computational methods in statistical physics and nonlinear dynamics
© EDP Sciences, Società Italiana di Fisica, Springer-Verlag, 2004