Answers are grounded in this paper and cite their sources.
When transport in networks follows the shortest paths, the link weights are shown to play a crucial role. If the underlying topology with N 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 αc of the link weight distribution. If the extreme value index of the link weight distribution α>αc, transport in the network traverses many links whereas for α<αc, all transport flows over a critical backbone consisting of N-1 links. For connected Erd\"os-R\'enyi random graphs Gₚ(N) and square lattices, we have characterised the phase transition and found that αcbN^-β with β_Gₚ(N)≈0.63 and βlattice≈0.62.
No takes yet. Share an insight, caveat, or question.
Mieghem et al. (2005) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: