Shuaibing Zhu

Shuaibing Zhu

Auto-generated profile, based on publicly available information

Shuaibing Zhu

Hunan Normal University

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 May 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
SZShuaibing Zhu
Shuaibing Zhu
JZJin Zhou
Jin Zhou
XYXinghuo Yu
Xinghuo Yu
JLJun-An Lu
Jun-An Lu
This article addresses the bounded synchronization of heterogeneous complex dynamical networks. Different from most existing criteria which deal with only global bounded synchronization, a general theorem is established for analyzing both the local and global bounded synchronization of a class of heterogeneous networks in a unified approach. By developing a joint-diagonalization-like technique, several easy-to-use bounded synchronization criteria with low-dimensional linear matrix inequalities are derived based on the general theorem. Particularly, an estimate of the synchronization error and the admissible initial values are given. Examples are provided to verify the theoretical results.

8 September 2020 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
SZShuaibing Zhu
Shuaibing Zhu
JZJin Zhou
Jin Zhou
JLJinhu Lu
Jinhu Lu
JLJun-An Lu
Jun-An Lu
Finite-time synchronization (FTS) of dynamical networks has received much attention in recent years, as it has fast convergence rate and good robustness. Most existing results rely heavily on some global condition such as the Lipschitz condition, which has limitations in describing the strong nonlinearity of most real systems. Dealing with strong nonlinearity in the field of FTS is still a challenging problem. In this article, the FTS problem of impulsive dynamical networks with general nonlinearity (especially strong nonlinearity) is considered. In virtue of the concept of nonlinearity strength that quantizes the network nonlinearity, local FTS criteria are established, where the range of the admissible initial values and the settling time are solved. For the networks with weak nonlinearity, global FTS criteria that unify synchronizing, inactive, and desynchronizing impulses are derived. Differing from most existing studies on FTS, the node system here does not have to satisfy the global Lipschitz condition, therefore covering more situations that are practical. Finally, numerical examples are provided to demonstrate our theoretical results.

7 October 2020 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
SZShuaibing Zhu
Shuaibing Zhu
JZJin Zhou
Jin Zhou
XYXinghuo Yu
Xinghuo Yu
JLJun-An Lu
Jun-An Lu
In this article, we investigate the synchronization of complex networks with general time-varying delay, especially with nondifferentiable delay. In the literature, the time-varying delay is usually assumed to be differentiable. This assumption is strict and not easy to verify in engineering. Until now, the synchronization of networks with nondifferentiable delay through adaptive control remains a challenging problem. By analyzing the boundedness of the adaptive control gain and extending the well-known Halanay inequality, we solve this problem and establish several synchronization criteria for networks under the centralized adaptive control and networks under the decentralized adaptive control. Particularly, the boundedness of the centralized adaptive control gain is theoretically proved. Numerical simulations are provided to verify the theoretical results.

1 April 2024 in Chaos: An Interdisciplinary Journal of Nonlinear Science
Verified
Journal Article
Open access
PDF file
SZShidong Zhai
Shidong Zhai
HLHaolin Li
Haolin Li
SZShuaibing Zhu
Shuaibing Zhu
JMJun Ma
Jun Ma
Rumors spread among the crowd have an impact on media influence, while media influence also has an impact on rumor dissemination. This article constructs a two-layer rumor media interaction network model, in which the rumors spread in the crowd are described using the susceptibility-apathy-propagation-recovery model, and the media influence is described using the corresponding flow model. The rationality of the model is studied, and then a detailed analysis of the model is conducted. In the simulation section, we undertake a sensitivity analysis of the crucial parameters within our model, focusing particularly on their impact on the basic reproduction number. According to data simulation analysis, the following conclusion can be drawn: First, when the media unilaterally influences the crowd and does not accept feedback from the crowd, the influence of the media will decrease to zero over time, which has a negative effect on the spread of rumors among the crowd (the degree of rumor dissemination decreases). Second, when the media does not affect the audience and accepts feedback from the audience, this state is similar to the media collecting information stage, which is to accept rumors from the audience but temporarily not disclose their thoughts. At this time, both the media influence and the spread of rumors in the audience will decrease. Finally, the model is validated using an actual dataset of rumors. The simulation results show an R-squared value of 0.9606, indicating that the proposed model can accurately simulate rumor propagation in real social networks.

1 April 2018 in Chaos: An Interdisciplinary Journal of Nonlinear Science
Verified
Journal Article
Closed access
PDF file
SZShuaibing Zhu
Shuaibing Zhu
JZJin Zhou
Jin Zhou
JLJun-An Lu
Jun-An Lu
In this paper, we study the problem of identifying the partial topology of complex dynamical networks via a pinning mechanism. By using the network synchronization theory and the adaptive feedback controlling method, we propose a method which can greatly reduce the number of nodes and observers in the response network. Particularly, this method can also identify the whole topology of complex networks. A theorem is established rigorously, from which some corollaries are also derived in order to make our method more cost-effective. Several numerical examples are provided to verify the effectiveness of the proposed method. In the simulation, an approach is also given to avoid possible identification failure caused by inner synchronization of the drive network.

1 January 2019 in SIAM Journal on Control and Optimization
Verified
Journal Article
Closed access
SZShuaibing Zhu
Shuaibing Zhu
JZJin Zhou
Jin Zhou
GCGuanrong Chen
Guanrong Chen
JLJun-An Lu
Jun-An Lu
Despite the prevalence of synchronization analysis on complex dynamical networks, little attention was paid to the problem of estimating their regions of attraction. This paper addresses the issue ...