Shortest-path percolation on scale-free networks

Abstract

The shortest-path percolation model describes the consumption and exhaustion of network resources. This work studies the transition on scale-free networks and finds universality classes controlled by the path-length budget rather than the degree exponent.

Publication
In Physical Review E
Hanlin Sun
Hanlin Sun
Wallenberg Initiative on Networks and Quantum Information (WINQ) Research Fellow