The paper by K.-I. Goh, B. Kahng, and D. Kim investigates the load distribution in scale-free (SF) networks, where data packets are transmitted through shortest paths. The load, defined as the total number of data packets passing through a vertex, is found to follow a power-law distribution with an exponent \(\delta \approx 2.2(1)\), which is independent of the degree exponent \(\gamma\) in the range \(2 < \gamma \leq 3\) and different mean degrees. This universality is observed for both undirected and directed networks. The authors conjecture that \(\delta\) is a universal quantity characterizing SF networks. They also analyze the load distribution in real-world networks, such as the co-authorship network, and find agreement with the theoretical predictions. The study highlights the importance of understanding the load distribution in SF networks for efficient data transmission and network dynamics.The paper by K.-I. Goh, B. Kahng, and D. Kim investigates the load distribution in scale-free (SF) networks, where data packets are transmitted through shortest paths. The load, defined as the total number of data packets passing through a vertex, is found to follow a power-law distribution with an exponent \(\delta \approx 2.2(1)\), which is independent of the degree exponent \(\gamma\) in the range \(2 < \gamma \leq 3\) and different mean degrees. This universality is observed for both undirected and directed networks. The authors conjecture that \(\delta\) is a universal quantity characterizing SF networks. They also analyze the load distribution in real-world networks, such as the co-authorship network, and find agreement with the theoretical predictions. The study highlights the importance of understanding the load distribution in SF networks for efficient data transmission and network dynamics.