Finite‐Time Pinning Synchronization Control for Coupled Complex Networks with Time‐Varying Delays

Zhang, Hebing; Zheng, Xiaojing; Li, Ning

doi:10.1155/2022/7119370

Discrete Dynamics in Nature and Society

2022

DOI: 10.1155/2022/7119370

|View full text |Cite

Finite‐Time Pinning Synchronization Control for Coupled Complex Networks with Time‐Varying Delays

Hebing Zhang

Xiaojing Zheng

Ning Li

Abstract: The finite-time pinning synchronization control problem is studied for coupled complex networks with time-varying delays. Based on the finite-time stability theorem, a finite-time tractive synchronous controller is designed. In addition, the selection process of tractive nodes is developed to control as few nodes as possible such that all nodes are synchronized in the network in finite time. At the same time, sufficient conditions of the finite-time constraint synchronization of the drive-response network are … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

2024

Publication Types

Select...

Article3

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Synchronization analyze of k-uniform hyper-networks

Du,

Ma,

et al. 2024

Sci Rep

View full text Add to dashboard Cite

Hyper-networks tend to perform better in representing multivariate relationships among nodes. Yet, due to the complexity of the hyper-network structure, research in synchronization dynamics is rarely involved. In this paper, a Kuramoto model more suitable for k-uniform hyper-networks is proposed. And the generalized Laplacian matrix expression of the k-uniform hyper-network is present. We use the eigenvalue ratio of the generalized Laplacian matrix to quantify synchronization. And we studied the effects of some important structure parameters on the synchronization of three types of k-uniform hyper-networks. And obtained different relationships between synchronization and these parameters. The results show the synchronization of the k-uniform hyper-networks is related to both structure and parameters. And as the size of the nodes increases, the synchronization ability gradually increases for ER random hyper-network, while that gradually decreases for NW small-world hyper-network and BA scale-free hyper-network. As the uniformity increases, the synchronization ability of all three types of uniform hyper-networks increases. In addition, when the structure and node size are fixed, the synchronization ability increases with the increase of the hyper-clustering coefficient in BA scale-free hyper-network and ER random hyper-network, while it decreases with the increase of the hyper-clustering coefficient in NW small-world hyper-network.

show abstract

Synchronization analyze of k-uniform hyper-networks

Du,

Ma,

et al. 2024

Sci Rep

View full text Add to dashboard Cite

show abstract

Intermittent Finite‐Time Synchronization for Reaction‐Diffusion Competitive Neural Networks with Different Time Scales

Hu,

Liu

2024

Discrete Dynamics in Nature and Society

View full text Add to dashboard Cite

This paper focuses on the finite‐time synchronization issue for reaction‐diffusion competitive neural networks (RCNNs) with different time scales and time‐varying delays. To reduce the waste of network resources, a periodically intermittent control strategy is presented based on two time scales (short and long memory) and time‐varying delay. By constructing the Lyapunov–Krasovskii functional, with the help of Lyapunov stability theory and auxiliary inequality technique, the finite‐time synchronization can be guaranteed and the settling time is exactly estimated. Finally, an exhaustive numerical analysis is presented to illustrate the effectiveness of the controller and the correctness of theoretical results.

show abstract

New finite-time synchronization conditions of delayed multinonidentical coupled complex dynamical networks

Zhang

Wang

2022

MBE

View full text Add to dashboard Cite

<abstract><p>In this article, we mainly focus on the finite-time synchronization of delayed multinonidentical coupled complex dynamical networks. By applying the Zero-point theorem, novel differential inequalities, and designing three novel controllers, we obtain three new criteria to assure the finite-time synchronization between the drive system and the response system. The inequalities occurred in this paper are absolutely different from those in other papers. And the controllers provided here are fully novel. We also illustrate the theoretical results through some examples.</p></abstract>

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Finite‐Time Pinning Synchronization Control for Coupled Complex Networks with Time‐Varying Delays

Cited by 3 publications

References 41 publications

Synchronization analyze of k-uniform hyper-networks

Synchronization analyze of k-uniform hyper-networks

Intermittent Finite‐Time Synchronization for Reaction‐Diffusion Competitive Neural Networks with Different Time Scales

New finite-time synchronization conditions of delayed multinonidentical coupled complex dynamical networks

Contact Info

Product

Resources

About