Abstract
When transport in networks follows the shortest paths, the link weights are shown to play a crucial role. If the underlying topology with nodes is not changed and if the link weights are independent from each other, then we show that, by tuning the link weights, a phase transition occurs around a critical extreme value index of the link weight distribution. If the extreme value index of the link weight distribution , transport in the network traverses many links whereas for , all transport flows over a critical backbone consisting of links. For connected Erdös-Rényi random graphs and square lattices, we have characterised the phase transition and found that with and .
- Received 10 March 2005
DOI:https://doi.org/10.1103/PhysRevE.72.056138
©2005 American Physical Society