Shortest paths and load scaling in scale-free trees

G. Szabo, M. Alava, J. Kertesz

Tutkimustuotos: LehtiartikkeliArticleScientificvertaisarvioitu

53 Sitaatiot (Scopus)
2 Lataukset (Pure)


The average node-to-node distance of scale-free graphs depends logarithmically on N, the number of nodes, while the probability distribution function of the distances may take various forms. Here we analyze these by considering mean-field arguments and by mapping the m=1 case of the Barabási-Albert model into a tree with a depth-dependent branching ratio. This shows the origins of the average distance scaling and allows one to demonstrate why the distribution approaches a Gaussian in the limit of N large. The load, the number of the shortest distance paths passing through any node, is discussed in the tree presentation.
JulkaisuPhysical Review E
DOI - pysyväislinkit
TilaJulkaistu - 2002
OKM-julkaisutyyppiA1 Julkaistu artikkeli, soviteltu

Sormenjälki Sukella tutkimusaiheisiin 'Shortest paths and load scaling in scale-free trees'. Ne muodostavat yhdessä ainutlaatuisen sormenjäljen.

  • Siteeraa tätä