15 June 2020 in Proceedings of the National Academy of Sciences
Whether real-world complex networks are scale free or not has long been controversial. Recently, in Broido and Clauset [A. D. Broido, A. Clauset, Nat. Commun. 10, 1017 (2019)], it was claimed that the degree distributions of real-world networks are rarely power law under statistical tests. Here, we attempt to address this issue by defining a fundamental property possessed by each link, the degree–degree distance, the distribution of which also shows signs of being power law by our empirical study. Surprisingly, although full-range statistical tests show that degree distributions are not often power law in real-world networks, we find that in more than half of the cases the degree–degree distance distributions can still be described by power laws. To explain these findings, we introduce a bidirectional preferential selection model where the link configuration is a randomly weighted, two-way selection process. The model does not always produce solid power-law distributions but predicts that the degree–degree distance distribution exhibits stronger power-law behavior than the degree distribution of a finite-size network, especially when the network is dense. We test the strength of our model and its predictive power by examining how real-world networks evolve into an overly dense stage and how the corresponding distributions change. We propose that being scale free is a property of a complex network that should be determined by its underlying mechanism (e.g., preferential attachment) rather than by apparent distribution statistics of finite size. We thus conclude that the degree–degree distance distribution better represents the scale-free property of a complex network. Significance It is hard to decide if a real-world complex network is scale free, as it has never reached an agreement on how to confirm whether the network exhibits statistically favored power-law distributions. Here, we define a fundamental property—the degree–degree distance—possessed by each link, the distribution of which usually exhibits a stronger power law than the degree distribution of a finite-size network as indicated by empirical and statistical studies. A bidirectional preferential selection model is introduced to explain and reproduce this finding, which implies that being scale free as a property should not be defined by apparent statistics but determined by the underlying mechanism. We conclude that power-law degree–degree distance distribution better represents the scale-free property.
28 August 2020 in Nature Human Behaviour
3 November 2023 in Nature Communications
Although the origin of the fat-tail characteristic of the degree distribution in complex networks has been extensively researched, the underlying cause of the degree distribution characteristic across the complete range of degrees remains obscure. Here, we propose an evolution model that incorporates only two factors: the node’s weight, reflecting its innate attractiveness (nature), and the node’s degree, reflecting the external influences (nurture). The proposed model provides a good fit for degree distributions and degree ratio distributions of numerous real-world networks and reproduces their evolution processes. Our results indicate that the nurture factor plays a dominant role in the evolution of social networks. In contrast, the nature factor plays a dominant role in the evolution of non-social networks, suggesting that whether nodes are people determines the dominant factor influencing the evolution of real-world networks.
17 October 2023 in Chaos, Solitons & Fractals
2 February 2026 in Communications Physics
Quantifying subtle structural differences between networks remains a critical challenge across diverse scientific disciplines. Traditional network comparison methods often overlook the crucial role of edges and their interactions with nodes, thereby limiting their ability to capture complex structural dissimilarity governed by node-edge interplay. Here, we introduce a dissimilarity measure based on network hierarchy entropy, defined via the cross-entropy between node-level and edge-level distance distributions. This measure captures multiscale structural complexity by integrating hierarchical information encoded in shortest-path distributions across nodes and edges. Extensive experiments on synthetic and empirical networks show that this measure effectively discriminates fine-grained variations between networks with identical mesoscopic structures and robustly tracks evolving topologies in dynamic networks. It achieves 74.62% classification accuracy in distinguishing enzyme from non-enzyme proteins, comparable to state-of-the-art supervised learning models but without requiring feature engineering.