Bin Zhou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Bin Zhou has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Xiangyi Meng
Department of Physics, Applied Physics, and Astronomy, Rensselaer Polytechnic Institute, Troy, USA
4 shared publications - Xin Lu
College of Systems Engineering, National University of Defense Technology, Changsha, China
2 shared publications - Zaiwu Gong
Research Center of Risk Management and Emergency Decision Making, School of Management Science and Engineering, Nanjing University of Information Science and Technology, Nanjing, China
2 shared publications - Alon Sela
Affiliation Agricultural and Biosystems Engineering, Agriculture Research Organization (ARO), Rishon LeZion, Israel
1 shared publication - Bing-Hong Wang
Department of Modern Physics University of Science and Technology of China 230026 Hefei P. R. China
1 shared publication Chaojun Zhang
College of Systems Engineering, National University of Defense Technology, Changsha, China
1 shared publication
Latest Publications
- Open Access
- 2 February 2026
- Published by Springer Nature in Communications Physics
- Vol. 9 (1)
Network hierarchy entropy for quantifying graph dissimilarity
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.
- 2 February 2026
- Published by Springer Nature in Communications Physics
- Vol. 9 (1)
Open AccessNetwork hierarchy entropy for quantifying graph dissimilarity
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.
- Open Access
Empathic network learning for multi-expert emergency decision-making under incomplete and inconsistent information
Challenges, such as a lack of information for emergency decision-making, time pressure, and limited knowledge of experts acting as decision-makers (DMs), can result in the generation of poor or inconsistent indirect information regarding DMs' preferences. Simultaneously, the empathic relationship represents a tangible social connection within the context of actual emergency decision-making, with the structure of the empathic network being a significant factor influencing the outcomes of the decision-making process. To deduce the empathic network underpinning the decision behaviors of DMs from incomplete and inconsistent preference information, we introduce an empathic network learning methodology rooted in the concept of robust ordinal regression via preference disaggregation. Firstly, we complete incomplete fuzzy judgment matrices including holistic preference information given in terms of decision examples on some reference alternatives, independently by each DM, and we calculate the intrinsic utilities of DMs. Secondly, we establish constraints for empathic network learning models based on empathic preference information and information about relations between some reference nodes. Then, the necessary and possible empathic relationships between any two DMs are calculated. Lastly, tailored to the specific requirements of different emergency scenarios, we design six target networks and construct models to derive the most representative empathic network.
Open AccessEmpathic network learning for multi-expert emergency decision-making under incomplete and inconsistent information
Challenges, such as a lack of information for emergency decision-making, time pressure, and limited knowledge of experts acting as decision-makers (DMs), can result in the generation of poor or inconsistent indirect information regarding DMs' preferences. Simultaneously, the empathic relationship represents a tangible social connection within the context of actual emergency decision-making, with the structure of the empathic network being a significant factor influencing the outcomes of the decision-making process. To deduce the empathic network underpinning the decision behaviors of DMs from incomplete and inconsistent preference information, we introduce an empathic network learning methodology rooted in the concept of robust ordinal regression via preference disaggregation. Firstly, we complete incomplete fuzzy judgment matrices including holistic preference information given in terms of decision examples on some reference alternatives, independently by each DM, and we calculate the intrinsic utilities of DMs. Secondly, we establish constraints for empathic network learning models based on empathic preference information and information about relations between some reference nodes. Then, the necessary and possible empathic relationships between any two DMs are calculated. Lastly, tailored to the specific requirements of different emergency scenarios, we design six target networks and construct models to derive the most representative empathic network.
- Open Access
- 3 November 2023
- Published by Springer Nature in Nature Communications
- Vol. 14 (1) , 1-8
The nature and nurture of network evolution
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.
- 3 November 2023
- Published by Springer Nature in Nature Communications
- Vol. 14 (1) , 1-8
Open AccessThe nature and nurture of network evolution
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.
- Open Access
Scale-Free Networks beyond Power-Law Degree Distribution
Complex networks across various fields are often considered to be scale free -- a statistical property usually solely characterized by a power-law distribution of the nodes' degree $k$. However, this characterization is incomplete. In real-world networks, the distribution of the degree-degree distance $η$, a simple link-based metric of network connectivity similar to $k$, appears to exhibit a stronger power-law distribution than $k$. While offering an alternative characterization of scale-freeness, the discovery of $η$ raises a fundamental question: do the power laws of $k$ and $η$ represent the same scale-freeness? To address this question, here we investigate the exact asymptotic {relationship} between the distributions of $k$ and $η$, proving that every network with a power-law distribution of $k$ also has a power-law distribution of $η$, but \emph{not} vice versa. This prompts us to introduce two network models as counterexamples that have a power-law distribution of $η$ but not $k$, constructed using the preferential attachment and fitness mechanisms, respectively. Both models show promising accuracy by fitting only one model parameter each when modeling real-world networks. Our findings suggest that $η$ is a more suitable indicator of scale-freeness and can provide a deeper understanding of the universality and underlying mechanisms of scale-free networks.Open AccessScale-Free Networks beyond Power-Law Degree Distribution
Complex networks across various fields are often considered to be scale free -- a statistical property usually solely characterized by a power-law distribution of the nodes' degree $k$. However, this characterization is incomplete. In real-world networks, the distribution of the degree-degree distance $η$, a simple link-based metric of network connectivity similar to $k$, appears to exhibit a stronger power-law distribution than $k$. While offering an alternative characterization of scale-freeness, the discovery of $η$ raises a fundamental question: do the power laws of $k$ and $η$ represent the same scale-freeness? To address this question, here we investigate the exact asymptotic {relationship} between the distributions of $k$ and $η$, proving that every network with a power-law distribution of $k$ also has a power-law distribution of $η$, but \emph{not} vice versa. This prompts us to introduce two network models as counterexamples that have a power-law distribution of $η$ but not $k$, constructed using the preferential attachment and fitness mechanisms, respectively. Both models show promising accuracy by fitting only one model parameter each when modeling real-world networks. Our findings suggest that $η$ is a more suitable indicator of scale-freeness and can provide a deeper understanding of the universality and underlying mechanisms of scale-free networks. - 17 October 2023
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 176
Scale-free networks beyond power-law degree distribution
- 17 October 2023
- Published by Elsevier in Chaos, Solitons & Fractals
- Vol. 176
Scale-free networks beyond power-law degree distribution
- 28 August 2020
- Published by Springer Nature in Nature Human Behaviour
- Vol. 4 (11) , 1198-1207
Realistic modelling of information spread using peer-to-peer diffusion patterns
In computational social science, epidemic-inspired spread models have been widely used to simulate information diffusion. However, recent empirical studies suggest that simple epidemic-like models typically fail to generate the structure of real-world diffusion trees. Such discrepancy calls for a better understanding of how information spreads from person to person in real-world social networks. Here, we analyse comprehensive diffusion records and associated social networks in three distinct online social platforms. We find that the diffusion probability along a social tie follows a power-law relationship with the numbers of disseminator’s followers and receiver’s followees. To develop a more realistic model of information diffusion, we incorporate this finding together with a heterogeneous response time into a cascade model. After adjusting for observational bias, the proposed model reproduces key structural features of real-world diffusion trees across the three platforms. Our finding provides a practical approach to designing more realistic generative models of information diffusion.
- 28 August 2020
- Published by Springer Nature in Nature Human Behaviour
- Vol. 4 (11) , 1198-1207
Realistic modelling of information spread using peer-to-peer diffusion patterns
In computational social science, epidemic-inspired spread models have been widely used to simulate information diffusion. However, recent empirical studies suggest that simple epidemic-like models typically fail to generate the structure of real-world diffusion trees. Such discrepancy calls for a better understanding of how information spreads from person to person in real-world social networks. Here, we analyse comprehensive diffusion records and associated social networks in three distinct online social platforms. We find that the diffusion probability along a social tie follows a power-law relationship with the numbers of disseminator’s followers and receiver’s followees. To develop a more realistic model of information diffusion, we incorporate this finding together with a heterogeneous response time into a cascade model. After adjusting for observational bias, the proposed model reproduces key structural features of real-world diffusion trees across the three platforms. Our finding provides a practical approach to designing more realistic generative models of information diffusion.
- 15 June 2020
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 117 (26) , 14812-14818
Power-law distribution of degree–degree distance: A better representation of the scale-free property of complex networks
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.
- 15 June 2020
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 117 (26) , 14812-14818
Power-law distribution of degree–degree distance: A better representation of the scale-free property of complex networks
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.
- Open Access
Degree-layer theory of network topology
The network topology can be described by the number of nodes and the interconnections among them. The degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability distribution of these degrees over the whole network. Therefore, the degree is very important structural parameter of network topology. However, given the number of nodes and the degree of each node in a network, the topology of the network cannot be determined. Therefore, we propose the degree-layer theory of network topology to describe deeply the network topology. First, we propose the concept of degree-tree with the breadth-first search tree. The degrees of all nodes are layered and have a hierarchical structure. Second,the degree-layer theory is described in detail. Two new concepts are defined in the theory. An index is proposed to quantitatively distinguish the two network topologies. It also can quantitatively measure the stability of network topology built by a model mechanism. One theorem is given and proved, furthermore, and one corollary is derived directly from the theorem. Third, the applications of the degree-layer theory are discussed in the ER random network, WS small world network and BA scale-free network, and the influences of the degree distribution on the stability of network topology are studied in the three networks. In conclusion, the degree-layer theory is helpful for accurately describing the network topology, and provides a new starting point for researching the similarity and isomorphism between two network topologies.
Open AccessDegree-layer theory of network topology
The network topology can be described by the number of nodes and the interconnections among them. The degree of a node in a network is the number of connections it has to other nodes and the degree distribution is the probability distribution of these degrees over the whole network. Therefore, the degree is very important structural parameter of network topology. However, given the number of nodes and the degree of each node in a network, the topology of the network cannot be determined. Therefore, we propose the degree-layer theory of network topology to describe deeply the network topology. First, we propose the concept of degree-tree with the breadth-first search tree. The degrees of all nodes are layered and have a hierarchical structure. Second,the degree-layer theory is described in detail. Two new concepts are defined in the theory. An index is proposed to quantitatively distinguish the two network topologies. It also can quantitatively measure the stability of network topology built by a model mechanism. One theorem is given and proved, furthermore, and one corollary is derived directly from the theorem. Third, the applications of the degree-layer theory are discussed in the ER random network, WS small world network and BA scale-free network, and the influences of the degree distribution on the stability of network topology are studied in the three networks. In conclusion, the degree-layer theory is helpful for accurately describing the network topology, and provides a new starting point for researching the similarity and isomorphism between two network topologies.
- Open Access
- 25 February 2012
- Published by Springer Nature in Pramana
- Vol. 78 (3) , 399-404
The second Born approximation of electron–argon elastic scattering in a bichromatic laser field
- 25 February 2012
- Published by Springer Nature in Pramana
- Vol. 78 (3) , 399-404
Open AccessThe second Born approximation of electron–argon elastic scattering in a bichromatic laser field