Jin Zhou

Jin Zhou

Auto-generated profile, based on publicly available information

Jin Zhou

Wuhan University

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
2 May 2023 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
SJSiyang Jiang
Siyang Jiang
JZJin Zhou
Jin Zhou
Michael SmallMichael Small
Michael Small
JLJun-An Lu
Jun-An Lu
YZYanqi Zhang
Yanqi Zhang
Searching for key nodes and edges in a network is a long-standing problem. Recently cycle structure in a network has received more attention. Is it possible to propose a ranking algorithm for cycle importance? We address the problem of identifying the key cycles of a network. First, we provide a more concrete definition of importance—in terms of Fiedler value (the second smallest Laplacian eigenvalue). Key cycles are those that contribute most substantially to the dynamical behavior of the network. Second, by comparing the sensitivity of Fiedler value to different cycles, a neat index for ranking cycles is provided. Numerical examples are given to show the effectiveness of this method.

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.

22 June 2018 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
JZJin Zhou
Jin Zhou
XYXinghuo Yu
Xinghuo Yu
JLJun-An Lu
Jun-An Lu
The problem of node importance in a general controlled complex network is investigated in this brief. An index, ControlRank index, to measure the node importance is presented. The index is relatively intuitive and helps unify various indexes that are effective only in the networks with some particular topology. If all nodes except one are pinned in a network, the importance of the unpinned node is sorted in descending order of degree; even if a node is the most significant node, it does not necessarily belong to the most efficient node set; it is very crucial to have an eye on the information balance as for information dissemination in a network; it is reasonable to rank node importance by sorting the node degrees in a scale-free network. The results and phenomena provide us with a broader and clearer perspective to view node importance in complex networks.

23 September 2015 in The European Physical Journal B
Verified
Journal Article
Closed access
PDF file
MXMingming Xu
Mingming Xu
JZJin Zhou
Jin Zhou
JLJun-An Lu
Jun-An Lu
XWXiaoqun Wu
Xiaoqun Wu

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.