Kleinberg Navigation on Anisotropic Lattices
Keyword(s):
We study the Kleinberg problem of navigation in small-world networks when the underlying lattice is stretched along a preferred direction. Extensive simulations confirm that maximally efficient navigation is attained when the length r of long-range links is taken from the distribution P(r)∼r−α, when the exponent α is equal to 2, the dimension of the underlying lattice, regardless of the amount of anisotropy, but only in the limit of infinite lattice size, L→∞. For finite size lattices we find an optimal α(L) that depends strongly on L. The convergence to α=2 as L→∞ shows interesting power-law dependence on the anisotropy strength.
2004 ◽
Vol 15
(06)
◽
pp. 755-765
◽
2020 ◽
Vol 31
(08)
◽
pp. 2050116
Keyword(s):
2016 ◽
Vol 30
(30)
◽
pp. 1650207
◽
Keyword(s):
2006 ◽
Vol 23
(3)
◽
pp. 746-749
◽
2007 ◽
Vol 17
(07)
◽
pp. 2331-2342
◽
2013 ◽
Vol 45
(4)
◽
pp. 981-1010
◽