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

Properties of transportation dynamics on scale-free networks

Author

Listed:
  • Zheng, Jian-Feng
  • Gao, Zi-You
  • Zhao, Xiao-Mei

Abstract

In this work, we study the statistical properties of transportation dynamics considering congestion effects, based on the standard Barabási–Albert scale-free model. In terms of user equilibrium (UE) condition, congestion effects can be described by cost function. Simulation results demonstrate that the cumulative load distribution exhibits a power-law behavior with Pl∼l-(γ-1), where l is the flow loaded on the node and γ≈2.7 which is much bigger than that obtained in many networks without considering congestion effects. That is, there exist fewer heavily loaded nodes in the network when considering congestion effects. Furthermore, by numerically investigating overload phenomenon of the heaviest loaded link removal in transportation networks, a phase-transition phenomenon is uncovered in terms of the key parameter characterizing the node capacity.

Suggested Citation

  • Zheng, Jian-Feng & Gao, Zi-You & Zhao, Xiao-Mei, 2007. "Properties of transportation dynamics on scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 373(C), pages 837-844.
    • Handle: RePEc:eee:phsmap:v:373:y:2007:i:c:p:837-844
    DOI: 10.1016/j.physa.2006.05.032
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437106006455
    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.2006.05.032?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Rui Ding & Norsidah Ujang & Hussain Bin Hamid & Mohd Shahrudin Abd Manan & Rong Li & Safwan Subhi Mousa Albadareen & Ashkan Nochian & Jianjun Wu, 2019. "Application of Complex Networks Theory in Urban Traffic Network Researches," Networks and Spatial Economics, Springer, vol. 19(4), pages 1281-1317, December.

    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:373:y:2007:i:c:p:837-844. 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.