Abstract
We study the load distribution in weighted networks by measuring the effective number of optimal paths passing through a given vertex. The optimal path, along which the total cost is minimum, crucially depends on the cost distribution function p(c) (c) . In the strong disorder limit, where p(c) (c) approximately c(-1) , the load distribution follows a power law both in the Erdös-Rényi (ER) random graphs and in the scale-free (SF) networks, and its characteristics are determined by the structure of the minimum spanning tree. The distribution of loads at vertices with a given vertex degree also follows the SF nature similar to the whole load distribution, implying that the global transport property is not correlated to the local structural information. Finally, we measure the effect of disorder by the correlation coefficient between vertex degree and load, finding that it is larger for ER networks than for SF networks.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
