Numbers of n-th neighbors and node-to-node distances in growing networks

dc.creatorMalarz, K.
dc.date2005-07-06
dc.date2006-01-18
dc.date.accessioned2026-07-07T06:41:17Z
dc.date.available2026-07-07T06:41:17Z
dc.descriptionTopology of exponential and scale-free trees and simple graphs is investigated numerically. The numbers of the nearest neighbors, the next-nearest neighbors, the next-next-nearest neighbors, the 4-th and the 5-th neighbors are calculated. The functional dependence of the node-to-node distance d_{ij} on the product of connectivities k_ik_j has been also checked. The results of simulations for exponential networks agree with the existing analytical predictions.
dc.description5 pages, RevTeX4, 3 figures with 9 eps files, dedicated to Professor Andrzej Z. Maksymowicz on the occasion of his 65th birthday
dc.identifierhttps://arxiv.org/abs/cond-mat/0507127
dc.identifierhttp://arxiv.org/abs/cond-mat/0507127
dc.identifierActa Phys. Pol. B 37 (2006) 309
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/101614
dc.subjectStatistical Mechanics
dc.titleNumbers of n-th neighbors and node-to-node distances in growing networks
dc.typetext

Files

Collections