Kleinberg Navigation in Fractal Small World Networks

Simple item page
dc.creatorRoberson, Mickey R.
dc.creatorben-Avraham, Daniel
dc.date2006-12-13
dc.date.accessioned2026-07-07T06:41:55Z
dc.date.available2026-07-07T06:41:55Z
dc.descriptionWe study the Kleinberg problem of navigation in Small World networks when the underlying lattice is a fractal consisting of N>>1 nodes. Our extensive numerical simulations confirm the prediction that most efficient navigation is attained when the length r of long-range links is taken from the distribution P(r)~r^{-alpha}, where alpha=d_f, the fractal dimension of the underlying lattice. We find finite-size corrections to the exponent alpha, proportional to 1/(ln N)^2.
dc.identifierhttps://arxiv.org/abs/cond-mat/0612326
dc.identifierhttp://arxiv.org/abs/cond-mat/0612326
dc.identifierPhys. Rev. E 74, 017101 (2006)
dc.identifierdoi:10.1103/PhysRevE.74.017101
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/101848
dc.subjectStatistical Mechanics
dc.titleKleinberg Navigation in Fractal Small World Networks
dc.typetext

Files

Collections

arXiv