IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v330y2003i1p246-252.html
   My bibliography  Save this article

Length of optimal path in random networks with strong disorder

Author

Listed:
  • Buldyrev, Sergey V.
  • Braunstein, Lidia A.
  • Cohen, Reuven
  • Havlin, Shlomo
  • Stanley, H.Eugene

Abstract

We study the optimal distance ℓopt in random networks in the presence of disorder implemented by assigning random weights to the links. The optimal distance between two nodes is the length of the path for which the sum of weights along the path (“cost”) is a minimum. We study the case of strong disorder for which the distribution of weights is so broad that its sum along any path is dominated by the largest link weight in the path. We find that in random graphs, ℓopt scales as N1/3, where N is the number of nodes in the network. Thus, ℓopt increases dramatically compared to the known small-world result for the minimum distance ℓmin, which scales as logN. We also study, theoretically and by simulations, scale-free networks characterized by a power law distribution for the number of links, P(k)∼k−λ, and find that ℓopt scales as N1/3 for λ>4 and as N(λ−3)/(λ−1) for 3<λ<4. For 2<λ<3, our numerical results suggest that ℓopt scales logarithmically with N.

Suggested Citation

  • Buldyrev, Sergey V. & Braunstein, Lidia A. & Cohen, Reuven & Havlin, Shlomo & Stanley, H.Eugene, 2003. "Length of optimal path in random networks with strong disorder," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 330(1), pages 246-252.
    • Handle: RePEc:eee:phsmap:v:330:y:2003:i:1:p:246-252
    DOI: 10.1016/j.physa.2003.08.030
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437103007040
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2003.08.030?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:phsmap:v:330:y:2003:i:1:p:246-252. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.