Stability of shortest paths in complex networks with random edge weights
Jae Dong Noh, Heiko Rieger

TL;DR
This paper investigates how the stability of shortest paths and spanning trees in complex networks is affected by random edge weights, revealing phase transitions and scaling behaviors that depend on network type and size.
Contribution
It introduces a comprehensive analysis of the stability and phase transition phenomena of shortest paths under quenched disorder in various complex network models.
Findings
Spanning tree stability is sensitive to disorder, with phase transitions at zero disorder strength.
Regular networks exhibit continuous transitions with specific scaling laws.
Small-world and scale-free networks show first-order transitions with discontinuities.
Abstract
We study shortest paths and spanning trees of complex networks with random edge weights. Edges which do not belong to the spanning tree are inactive in a transport process within the network. The introduction of quenched disorder modifies the spanning tree such that some edges are activated and the network diameter is increased. With analytic random-walk mappings and numerical analysis, we find that the spanning tree is unstable to the introduction of disorder and displays a phase-transition-like behavior at zero disorder strength . In the infinite network-size limit (), we obtain a continuous transition with the density of activated edges growing like and with the diameter-expansion coefficient growing like in the regular network, and first-order transitions with discontinuous jumps in …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
