Xu Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xu Wang has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Jia-Bao Liu
School of Mathematics and Physics, Anhui Jianzhu University, Hefei, China
4 shared publications - Jinde Cao
School of Mathematics, Southeast University, Nanjing 210096, China
4 shared publications - Ji-Zhi Yin
Anhui Jianzhu University
1 shared publication - Liang Hua
School of Electrical Engineering and Automation, Nantong University, Nantong 226019, China
1 shared publication Liping Chen
Hefei University of Technology School of Electrical Engineering and Automation No. 193 Tunxi Road , Hefei, Anhui, 230009
1 shared publication- Liping Chen
School of Electrical Engineering and Automation, Hefei University of Technology, Hefei 230009, China
1 shared publication
Latest Publications
- 4 November 2025
- Published by Oxford University Press (OUP) in Journal of Complex Networks
- Vol. 13 (6)
The topological characteristics and robustness analysis for a class of fractal weighted networks
This study investigates a fractal weighted network model to explore the topological properties and robustness of complex networks. Firstly, we systematically analyze the network’s topological characteristics by constructing hierarchical recursive and self-similar structures. These characteristics include weighted degree distribution, network density, global efficiency, and key indicators such as first-order and second-order leader-follower coherence. We also derive exact solutions for these properties. Secondly, we conduct simulation analyses using various parameter combinations, based on the computational results. This allows us to thoroughly examine the network’s first-order and second-order coherence performance under external disturbances to assess the system’s robustness. The results show that achieving an ideal convergence state is more challenging for second-order coherence than for first-order coherence, and has a more significant impact on system robustness. Lower coherence values indicate that the system exhibits stronger anti-interference capabilities under external disturbances. Furthermore, this study provides a theoretical foundation for the optimal configuration of network parameters to improve system stability, highlights the strong relationship between coherence and robustness, and establishes a basis for designing more robust and efficient complex network systems.
- 4 November 2025
- Published by Oxford University Press (OUP) in Journal of Complex Networks
- Vol. 13 (6)
The topological characteristics and robustness analysis for a class of fractal weighted networks
This study investigates a fractal weighted network model to explore the topological properties and robustness of complex networks. Firstly, we systematically analyze the network’s topological characteristics by constructing hierarchical recursive and self-similar structures. These characteristics include weighted degree distribution, network density, global efficiency, and key indicators such as first-order and second-order leader-follower coherence. We also derive exact solutions for these properties. Secondly, we conduct simulation analyses using various parameter combinations, based on the computational results. This allows us to thoroughly examine the network’s first-order and second-order coherence performance under external disturbances to assess the system’s robustness. The results show that achieving an ideal convergence state is more challenging for second-order coherence than for first-order coherence, and has a more significant impact on system robustness. Lower coherence values indicate that the system exhibits stronger anti-interference capabilities under external disturbances. Furthermore, this study provides a theoretical foundation for the optimal configuration of network parameters to improve system stability, highlights the strong relationship between coherence and robustness, and establishes a basis for designing more robust and efficient complex network systems.
- Top Cited Papers
- 9 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 11, 378-387
The Coherence and Robustness Analysis for a Family of Unbalanced Networks
This study focuses on the coherence in a class of unbalanced networks, emphasizing the investigation of the impact of leader selection and network parameters on coherence. We discuss three different categories of consensus algorithms: leaderless algorithms of first and second orders, and first-order leader-follower algorithm. Firstly, we derive exact solutions for leaderless network coherence in the first and second orders. Secondly, we design various leader allocation schemes for the first-order leader-follower networks, obtaining expressions correlated with the network scale $N$, the double-ring cardinalities $p$ and $q$, and the number of leaders $k$. Thirdly, we conduct numerical simulations and robustness analyses to explore the impact of leader quantity and topology structure on network coherence. Specifically, the conclusions are as follows: (1) When $N$ decreases, an increase in $k$ demonstrates improved network coherence. (2) The smaller the difference between $p$ and $q$, the better the coherence. (3) The smaller the sum of $p$ and $q$, the stronger the robustness. (4) Uniform distribution of $k_{1}$ and $k_{2}$ leads to optimal coherence. Finally, the Laplacian energy and Kirchhoff index of the network are analyzed.
- 9 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 11, 378-387
Top Cited PapersThe Coherence and Robustness Analysis for a Family of Unbalanced Networks
This study focuses on the coherence in a class of unbalanced networks, emphasizing the investigation of the impact of leader selection and network parameters on coherence. We discuss three different categories of consensus algorithms: leaderless algorithms of first and second orders, and first-order leader-follower algorithm. Firstly, we derive exact solutions for leaderless network coherence in the first and second orders. Secondly, we design various leader allocation schemes for the first-order leader-follower networks, obtaining expressions correlated with the network scale $N$, the double-ring cardinalities $p$ and $q$, and the number of leaders $k$. Thirdly, we conduct numerical simulations and robustness analyses to explore the impact of leader quantity and topology structure on network coherence. Specifically, the conclusions are as follows: (1) When $N$ decreases, an increase in $k$ demonstrates improved network coherence. (2) The smaller the difference between $p$ and $q$, the better the coherence. (3) The smaller the sum of $p$ and $q$, the stronger the robustness. (4) Uniform distribution of $k_{1}$ and $k_{2}$ leads to optimal coherence. Finally, the Laplacian energy and Kirchhoff index of the network are analyzed.
- 1 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 11 (5) , 4719-4728
The Coherence and Properties Analysis of Balanced $2^{p}$-Ary Tree Networks
This study aims to analyze the coherence and properties in generalized Bethe tree networks within a uniform noise distribution. We handle two distinct categories of consensus algorithms within the balanced $2^{p}$ -ary trees, denoted as $B_{k}^{p}$ , designed for both leaderless and leader-follower networks. First, we derive the precise expressions for two cases of consensus algorithms based on the regular network topology. Second, we investigate an in-depth analysis of network properties from three perspectives: (1) Kirchhoff index of balanced $2^{p}$ -ary tree networks. (2) Global average first-passage time of balanced $2^{p}$ -ary tree networks. (3) The robustness of network coherence. Finally, we further obtain exact solutions for the first two perspectives, gaining insights into the impacts of network parameters on consensus. We reveal: (1) Single-leader networks show better coherence than leaderless networks. (2) Different network parameters result in different consensus distribution patterns, indicating that the topology structures of complex networks significantly influence the robustness of network coherence.
- 1 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 11 (5) , 4719-4728
The Coherence and Properties Analysis of Balanced $2^{p}$-Ary Tree Networks
This study aims to analyze the coherence and properties in generalized Bethe tree networks within a uniform noise distribution. We handle two distinct categories of consensus algorithms within the balanced $2^{p}$ -ary trees, denoted as $B_{k}^{p}$ , designed for both leaderless and leader-follower networks. First, we derive the precise expressions for two cases of consensus algorithms based on the regular network topology. Second, we investigate an in-depth analysis of network properties from three perspectives: (1) Kirchhoff index of balanced $2^{p}$ -ary tree networks. (2) Global average first-passage time of balanced $2^{p}$ -ary tree networks. (3) The robustness of network coherence. Finally, we further obtain exact solutions for the first two perspectives, gaining insights into the impacts of network parameters on consensus. We reveal: (1) Single-leader networks show better coherence than leaderless networks. (2) Different network parameters result in different consensus distribution patterns, indicating that the topology structures of complex networks significantly influence the robustness of network coherence.