Optimal Path in Random Networks with Disorder: A Mini Review (original) (raw)

We review the analysis of the length of the optimal path ' opt in random networks with disorder (i.e., random weights on the links). In the case of strong disorder, in which the maximal weight along the path dominates the sum, we find that ' opt increases dramatically compared to the known small-world result for the minimum distance ' min : for Erd+ os-Re´nyi (ER) networks ' opt $ N 1=3 ; while for scale-free (SF) networks, with degree distribution PðkÞ$k À l ;we find that ' opt scales as N ðlÀ3Þ=ðlÀ1Þ for 3olo4andasN 1 = 3 for lX4: Thus, for these networks, the smallworld nature is destroyed. For 2olo3; our numerical results suggest that ' opt scales as ln lÀ1 N: We also find numerically that for weak disorder ' opt $ ln N for ER models as well as for SF networks. We also study the transition between the strong and weak disorder regimes in the scaling properties of the average optimal path ' opt in ER and SF networks. r

Sign up for access to the world's latest research.

checkGet notified about relevant papers

checkSave papers to use in your research

checkJoin the discussion with peers

checkTrack your impact