Next Article in Journal
RETRACTED: Lin et al. A Perception Study for Unit Charts in the Context of Large-Magnitude Data Representation. Symmetry 2023, 15, 219
Previous Article in Journal
Mean-Field Stochastic Linear Quadratic Optimal Control for Jump-Diffusion Systems with Hybrid Disturbances
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Estimation of the Domain of Attraction on Controlled Nonlinear Neutral Complex Networks via Razumikhin Approach

School of Information and Mathematics, Yangtze University, Jingzhou 430023, China
*
Author to whom correspondence should be addressed.
Symmetry 2024, 16(6), 643; https://doi.org/10.3390/sym16060643
Submission received: 3 April 2024 / Revised: 18 May 2024 / Accepted: 20 May 2024 / Published: 22 May 2024
(This article belongs to the Section Mathematics)

Abstract

:
This paper is devoted to dealing with the issue of the estimation of the domain of attraction (DOA) for highly nonlinear neutral complex networks (HNNCNs) with time delays. Firstly, by the Razumikhin approach, we establish several novel lemmas on the estimation of DOA for highly nonlinear neutral differential systems. The cases of bounded non-differentiable delays and unbounded proportional delays are discussed, respectively. Subsequently, by utilizing the proposed lemmas, combining the Lyapunov stability theory and inequality technique, the estimation of DOA on HNNCNs with bounded delays or proportional delays is derived when the chosen control gain is sufficiently large. If initial values start from DOA, then the states of systems will exponentially or polynomially converge to the equilibrium point, which means that the local exponential or polynomial synchronization of HNNCNs is realized. Additionally, the weighted outer-coupling matrix of complex networks is not required to be symmetric, which means that the derived results can be applied to both the undirected networks and directed networks. Finally, several numerical examples are provided to illustrate the feasibility of theoretical findings.

1. Introduction

Complex networks (CNs) are composed of a great deal of nodes and complex edge associations, which can accurately simulate the practical systems such as the World Wide Web [1], air transportation networks [2], power-communication interdependent networks [3], and so on. With the rapid development of information technology, the applications of complex networks have been becoming more and more extensive in many fields including road traffic systems [4], power grids [5], and disease research [6]. Recently, great efforts have been made to investigate the CNs and fruitful work [7,8,9,10,11] about synchronization, pattern identification, statistical characteristics, and tracking control have sprung up.
Synchronization as a kind of important dynamic connective behavior has attracted widespread attention, which can be appropriately used to explain some natural phenomena. For a complex network (CN), global synchronization means that the states of each node eventually adapt to a common dynamical behavior for arbitrary initial values, and local synchronization means that the states of each node eventually adjust to a common dynamical behavior when initial values belong to a bounded domain. In order to realize global synchronization, it is necessary to impose control over addressed systems, and some control strategies are developed, such as feedback control [12], adaptive control [13], impulsive control [14], event-triggered control [15], and PID control [16]. Nevertheless, when the nonlinear node system has strong high-order nonlinearity, this network system cannot achieve global synchronization, even if the external controller is adopted and the chosen control gain is sufficiently large. Under this circumstance, the local synchronization is introduced and some results with respect to the local synchronization of CNs were acquired in [17,18,19,20,21,22]. From the aforementioned existing literature [17,18,19], it can be known that the strong nonlinearity is considered relatively rarely, and the influence of initial values on synchronization realization is also ignored. To solve this issue, the estimation of the domain of attraction (DOA) of a highly nonlinear network system is significant to achieve local synchronization.
Additionally, the estimation of DOA also plays an important role in the stability analysis and control of dynamic systems. In general, DOA can be classified into two categories. One kind originates from the invariant set. Under this case, if the solution of a system starting from an arbitrary initial state eventually converges to a set, then this set is called an attractive set, which can also be viewed as an invariant set. A body of work about attractive sets have been reported in [23,24,25,26].
The other kind of DOA greatly depends on the initial values of systems. If the trajectories of a system with its initial values from a certain region asymptotically converge to an equilibrium, periodic orbit, or chaos attractor, then this region is called DOA. Recently, numerous scholars have focused their attention on the estimation of DOA. For instance, in [27,28], the robust estimations of DOA for polynomial systems have been given with the help of parameter-dependent Lyapunov functions, where all possible uncertainties have been considered. In [29], the estimation of DOA for a controlled nonlinear system with polynomial dynamics and input constraints has been computed by solving an infinite-dimensional convex linear programming issue. Moreover, the estimations of DOA are further explored in nonlinear time-delay systems [30,31,32] by constructing a Lyapunov–Krasovskii functional.
Additionally, the estimation of DOA is investigated in some applicable systems such as the human respiratory model [33] and complex networks [34,35,36,37,38]. Particularly, in [34,35], based on the estimations of DOA, several algorithms were proposed to identify one appropriate driver node or an optimal set of driver nodes of CNs. In [36], combining a decomposition technique and Lyapunov stability theory, the estimation of DOA for the load balancing of a networked system has been discussed and the relationship between DOA and network topology has also been revealed. More recently, in [37], the estimation of the DOA of CNs without time delays has been explored, and the findings were further generalized to the controlled CNs with time delays in virtue of the Razumikhin approach in [38], where both delay-dependent DOA and delay-independent DOA have been analyzed.
It can be observed that the local synchronization [17,18] and estimation of DOA [30,31,32] have been considered based on the approach of Lyapunov–Krasovskii functional. Actually, the appropriate Lyapunov–Krasovskii functionals are difficult to find, and some sufficient conditions cannot be easily verified. Various classes of CNs are defined by some neutral-type functional differential equations involving neutral time delays. Such network models are called neutral-type CNs, where the time derivative of the states of each node involve time delay. Although the dynamic properties of neutral complex networks such as stability, periodic solution, and synchronization have been sufficiently analyzed in [39,40,41,42], the research into DOA for highly nonlinear neutral complex networks has not been examined. Since neutral term and high-order nonlinearity are included, the theory proposed in [38] by utilizing the Razumikhin approach cannot be applicable. Additionally, almost all literature only considers the estimation of DOA for systems with bounded time delays, and the case of unbounded proportional delays can be explored comparatively rarely.
Inspired by the above discussions, this paper aims to estimate the second category of DOA for highly nonlinear neutral complex networks (HNNCNs) with time delays. The main contributions of this paper are highlighted as follows.
(1) In contrast to the existing literature [37,38], we deal with the DOA issue of HNNCNs. Neutral term, high-order nonlinearity, non-differentiable bounded delays, and unbounded proportional delays are taken into account, which makes the addressed system in our paper more general.
(2) In virtue of the Razumikhin approach, two novel lemmas on the estimation of DOA for highly nonlinear neutral differential systems with bounded non-differentiable delays or unbounded proportional delays are established, respectively. Compared with the results proposed in [30,31,32], our findings are not required to choose the complicated Lyapunov–Krasovskii functional, and the acquired conditions are easier to verify. Meanwhile, since the neutral term is incorporated, Lemma 2 in [38] cannot be applied directly to this circumstance. We further develop the theory work [37,38] to neutral differential systems.
(3) By combining the presented lemmas and inequality technique, some estimations of DOA by HNNCNs with bounded non-differentiable delays or proportional delays are provided, and the local exponential synchronization or polynomial synchronization of HNNCNs is realized. Meanwhile, the convergent rate of the local synchronization error is accurately calculated and appropriate control gain is designed. Furthermore, the weighted outer-coupling matrix of complex networks may be chosen to be asymmetric, which makes the derived findings applicable to more general CNs.
The structure of this article is arranged as below. In Section 2, a class of highly nonlinear neutral complex networks are introduced, and some definitions about synchronization and DOA and one assumption are provided. Moreover, based on Razumikhin approach, several lemmas about the DOA estimation are established for neutral nonlinear differential equations. In Section 3, by utilizing the presented lemmas, some criteria on the DOA estimation of HNNCNs with bounded delays or proportional delays are derived. In Section 4, two numerical simulation examples are given to verify the effectiveness of the theoretical findings. Conclusions and future work are summarized in the last section.
Notations. Throughout this article, R n and R n × m denote the set of n-dimensional real column vectors and the set of the n × m -dimensional real matrices, respectively. R + indicates the set of non-negative real numbers. · means the two-norm of a vector or a matrix. I n represents an n-dimensional identity matrix. λ max P denotes the maximum eigenvalue of symmetric matrix P. For a continuous function Ψ ( t ) , its norm is represented by Ψ ( t ) t , δ 0 = sup ξ [ t δ 0 , t ] Ψ ( ξ ) . The Kronecker product of matrices A 1 and A 2 is expressed as A 1 A 2 .

2. Preliminaries and Definitions

Consider a class of highly nonlinear neutral complex network system (HNNCNS) composed of N nodes
d [ y i ( t ) D y i ( t δ ( t ) ) ] d t = F ( y i ( t ) , y i ( t δ ( t ) ) ) + l j = 1 N q i j Γ g ( y j ( t δ ( t ) ) ) + U i ( t ) , t t 0 , y i ( s ) = ζ i ( s ) , s [ t 0 δ 0 , t 0 ] , 1 i N ,
where y i ( · ) R n expressed by the state vector of the ith node; F : R n × R n R n and g : R n R n are continuous differentiable nonlinear functions; l > 0 stands for delayed coupling strength; Γ = ( γ i j ) R n × n is an inner-coupling matrix; Q = ( q i j ) N × N denotes the weighted outer-coupling matrix; D R n × n is a neutral delayed connection weight matrix. δ ( t ) denotes the time-varying delay. U i ( t ) represents the designed controller. ζ i ( s ) C ( [ t 0 δ 0 , t 0 ] , R n ) denotes the initial value of system (1). If there is a connection from node i to node j ( j i ) , then q i j > 0 ; otherwise, q i j = 0 . Moreover, the elements of coupled matrix Q satisfy q i i = j = 1 , j i N q i j .
Let vector ϑ = ( θ 1 , θ 2 , , θ n ) R n be an equilibrium point of the following isolated node system
d [ y ( t ) D y ( t δ ( t ) ) ] d t = F ( y ( t ) , y ( t δ ( t ) ) ) .
According to the definition of the equilibrium point ϑ , we correspondingly obtain the following equation
F ( ϑ , ϑ ) + l j = 1 N q i j Γ g ( ϑ ) = F ( ϑ , ϑ ) = 0 .
Obviously, the synchronized state y 1 = y 2 = = y N = ϑ is also an equilibrium point of system (1) when U i ( t ) = 0 . The controller U i ( t ) is designed as U i ( t ) = c z i ( t ) , in which z i ( t ) = y i ( t ) ϑ denotes the synchronization error and c > 0 represents the control gain. Let Θ = [ ϑ T , ϑ T , , ϑ T ] T R n N and z ( t ) = [ z 1 T ( t ) , z 2 T ( t ) , , z N T ( t ) ] T R n N . Subsequently, subtracting Equation (3) from Equation (1) yields the following system:
d [ z i ( t ) D z i ( t δ ( t ) ) ] d t = F ( y i ( t ) , y i ( t δ ( t ) ) ) F ( ϑ , ϑ ) + l j = 1 N q i j Γ [ g ( y j ( t δ ( t ) ) ) g ( ϑ ) ] + U i ( t ) , t t 0 , z i ( s ) = ζ i ( s ) ϑ = ϕ i ( s ) , s [ t 0 δ 0 , t 0 ] , 1 i N .
For the above system, let J 1 = 𝜕 F ( x , y ) 𝜕 x | ( ϑ , ϑ ) , J 2 = 𝜕 F ( x , y ) 𝜕 y | ( ϑ , ϑ ) and J 3 = 𝜕 g ( x ) 𝜕 x | x = ϑ be the Jacobian matrices of F and g, respectively. Therefore, the synchronization error system (4) can be rewritten as:
d [ z i ( t ) D z i ( t δ ( t ) ) ] d t = [ J 1 c I n ] z i ( t ) + J 2 z i ( t δ ( t ) ) + Φ ( 1 ) i ( t ) + l j = 1 N q i j Γ J 3 z j ( t δ ( t ) ) + l j = 1 N q i j Γ Φ ( 2 ) j ( t δ ( t ) ) ,
where
Φ ( 1 ) i ( t ) = F ( y i ( t ) , y i ( t δ ( t ) ) ) F ( ϑ , ϑ ) J 1 z i ( t ) J 2 z i ( t δ ( t ) ) , Φ ( 2 ) i ( t ) = g ( y i ( t δ ( t ) ) ) g ( ϑ ) J 3 z i ( t δ ( t ) ) .
Suppose that functions ψ i : R + R + with ψ i ( 0 ) = 0 , 1 i 3 are nondecreasing and continuous. Meanwhile, Φ ( 1 ) i ( t ) , Φ ( 2 ) i ( t ) satisfy the following conditions:
Φ ( 1 ) i T ( t ) Φ ( 1 ) i ( t ) ψ 1 ( z i ( t ) ) z i T ( t ) z i ( t ) + ψ 2 ( z i ( t ) t , δ ( t ) ) z i T ( t δ ( t ) ) z i ( t δ ( t ) ) ,
Φ ( 2 ) i T ( t ) Φ ( 2 ) i ( t ) ψ 3 ( z i ( t ) t , δ ( t ) ) z i T ( t δ ( t ) ) z i ( t δ ( t ) ) .
Remark 1.
For network system (1), since functions F ( x ( t ) , x ( t δ ( t ) ) ) and g ( x ( t δ ( t ) ) are continuous and differentiable, they satisfy local the Lipschitz condition, which guarantees the existence and uniqueness of the local solution of the network system (1). In order to overcome the difficulties introduced by high-order nonlinearity, some necessary assumptions on nonlinear functions F ( x ( t ) , x ( t δ ( t ) ) ) and g ( x ( t δ ( t ) ) are made in inequalities (6) and (7).
Definition 1.
Complex network (1) is said to achieve global exponential synchronization, if positive constants K 0 and η 1 exist such that
z ( t ; ϕ ) = y ( t ; ζ ) Θ K 0 e η 1 ( t t 0 ) ,
where ζ = [ ζ 1 T , ζ 2 T , , ζ N T ] T , ζ i C ( [ t 0 δ 0 , t 0 ] , R n ) , i = 1 , 2 , , N .
Definition 2.
Complex network (1) is said to achieve local exponential synchronization, if positive constants K 0 , η 1 and r exist such that
z ( t ; ϕ ) = y ( t ; ζ ) Θ K 0 e η 1 ( t t 0 ) ,
where ζ = [ ζ 1 T , ζ 2 T , , ζ N T ] T , ζ Θ t 0 , δ 0 < r , ζ i C ( [ t 0 δ 0 , t 0 ] , R n ) , i = 1 , 2 , , N .
Definition 3.
Complex network (1) is said to achieve global polynomial synchronization, if positive constants K 0 and η 1 exist such that
z ( t ; ϕ ) = y ( t ; ζ ) Θ K 0 ( 1 + t ) η 1 ,
where ζ = [ ζ 1 T , ζ 2 T , , ζ N T ] T , ζ i C ( [ t 0 δ 0 , t 0 ] , R n ) , i = 1 , 2 , , N .
Definition 4.
Complex network (1) is said to achieve local polynomial synchronization, and if there exists positive constants K 0 , η 1 and r such that
z ( t ; ϕ ) = y ( t ; ζ ) Θ K 0 ( 1 + t ) η 1 ,
where ζ = [ ζ 1 T , ζ 2 T , , ζ N T ] T , ζ Θ t 0 , δ 0 < r , ζ i C ( [ t 0 δ 0 , t 0 ] , R n ) , i = 1 , 2 , , N .
Definition 5
([38]). A set R D is said to be a DOA if all the trajectories of network (1) converge to the equilibrium point Θ for the initial values ζ ( s ) = [ ζ 1 T ( s ) , ζ 2 T ( s ) , , ζ N T ( s ) ] T R D , then we call it a DOA, which is equivalent to
R D = { ζ | lim t y ( t ; ζ ) Θ = 0 } .
In general, some difficulties are encountered during the process of estimation of DOA. For simplicity, we may choose the ball-like set or cube-like set as a DOA. In this article, we attempt to find an open ball-like subset of R D as described below
R 0 ( r ) = { ζ R D | ζ Θ t 0 , δ 0 < r } ,
which implies that the states of each node converge to the equilibrium point Θ and synchronization is achieved when the upper bound of the initial error ζ Θ is less than r. Correspondingly, the upper bound r is called the radius of the ball-like set R 0 ( r ) . This paper intends to seek the maximum radius r 0 .
In what follows, several necessary assumptions and lemmas are presented to derive the main results.
Assumption 1.
Suppose that there is a constant k ( 0 , 1 ) such that D k , which means that
| D x ( t δ ( t ) ) | k | x ( t δ ( t ) ) | .
According to Lemma 2 in the literature [43], by choosing p = 2 , we immediately acquire the following lemma.
Lemma 1.
Let assumption 1 hold and x ( t ) denote a solution of Equation (1). If
e η ( t t 0 ) | x ( t ) D x ( t δ ( t ) ) | 2 ( 1 + k ) 2 sup t 0 δ 0 θ t 0 | x ( θ ) | 2 ,
where 0 < η < 2 δ 0 ln k for t t 0 , then
e η ( t t 0 ) | x ( t ) | 2 ( 1 + k ) 2 [ 1 k ( e η δ 0 ) 1 2 ] 2 sup t 0 δ 0 θ t 0 | x ( θ ) | 2 .
Proof. 
According to the inequality | a + b | 2 ( 1 + ϵ ) ( | a | 2 + | b | 2 ϵ ) , 0 < ϵ < 1 , we can obtain that
| x ( t ) | 2 1 1 ϵ | x ( t ) D x ( t δ ( t ) ) | 2 + k 2 ϵ sup t 0 δ 0 θ t 0 | x ( θ ) | 2 .
Choose a positive constant ϵ satisfying k 2 e η δ 0 < ϵ < 1 . Noting that e η ( t t 0 ) | x ( t ) D x ( t δ ( t ) ) | 2 ( 1 + k ) 2 sup t 0 δ 0 θ t 0 | x ( θ ) | 2 , we can calculate that
sup t 0 s t ( e η ( t t 0 ) | x ( s ) | 2 ) 1 1 ϵ sup t 0 s t ( e η ( s t 0 ) | x ( s ) D x ( s δ ( s ) ) | 2 ) + k 2 ϵ sup t 0 s t ( e η ( s t 0 ) sup s δ 0 θ s | x ( θ ) | 2 ) ( 1 + k ) 2 1 ϵ sup t 0 δ 0 θ t 0 | x ( θ ) | 2 + k 2 e η δ 0 ϵ sup t 0 δ 0 s t ( e η ( s t 0 ) | x ( t ) | 2 ) ,
which implies that
sup t 0 δ 0 s t ( e η ( t t 0 ) | x ( s ) | 2 ) ( 1 + k ) 2 1 ϵ sup t 0 δ 0 θ t 0 | x ( θ ) | 2 + k 2 e η δ 0 ϵ sup t 0 δ 0 s t ( e η ( s t 0 ) | x ( t ) | 2 ) .
By taking ϵ = ( k 2 e η δ 0 ) 1 2 , we immediately acquire that
sup t 0 δ 0 s t ( e η ( t t 0 ) | x ( s ) | 2 ) ( 1 + k ) 2 [ 1 k ( e η δ 0 ) 1 2 ] 2 sup t 0 δ 0 θ t 0 | x ( θ ) | 2 .
Since a neutral term is introduced, we cannot directly establish the Halanay inequality to deal with the estimation of DOA of network (1) similar to the literature [38]. In order to solve this issue, the Razumikhin approach is developed and one novel lemma is derived.
Lemma 2.
Let Assumption 1 hold. Suppose that H 1 : R + R + is a nonincreasing continuous function while H 2 : R + R + is a nondecreasing continuous function. Let V : R n [ 0 , + ) be a differentiable function that satisfies
α 1 | x | 2 V ( x ) α 2 | x | 2 , α 2 α 1 > 0 .
x ( t ) is the solution of the equation
d [ x D x ( t δ ( t ) ) ] d t = f ( x ( t ) , x ( t δ ( t ) ) , t ) .
Let ϖ ( t ) = x ( t ) D x ( t δ ( t ) ) , ω ( t ) = V ( ϖ ( t ) ) and u ( t ) = V ( x ( t ) ) . Functions ω ( t ) and u ( t ) satisfy the following inequality
ω ˙ ( t ) [ H 1 ( u ( t ) ) + H 2 ( u ( t ) t , δ ( t ) ) ] ω ( t ) ,
for all t t 0 when u ( t + s ) < q ω ( t ) , s [ δ 0 , 0 ] , where q ¯ > ( 1 k ) 2 , q ¯ = α 1 q α 2 . If H 1 ( 0 ) > H 2 ( 0 ) and M = u ( t ) t 0 , δ 0 < r 0 M 0 , then there exists a sufficiently small positive constant η 1 such that
u ( t ) r 0 e η 1 ( t t 0 ) , t t 0 ,
where a series of parameters satisfy r 0 = sup { r | H 1 ( r ) > H 2 ( r ) } , M 0 = α 2 2 ( 1 + k ) 2 α 1 2 ( 1 k ) 2 , r 1 = M 0 M , λ = H 1 ( r 1 ) H 2 ( r 1 ) > 0 and η 1 0 , min λ , 1 δ 0 ln q ¯ ( 1 + q ¯ k ) 2 .
Proof. 
Since r 1 = M 0 M < r 0 , we can choose two small enough constants ε 0 > 0 and η 1 0 , min λ , 1 δ 0 ln q ( 1 + q k ) 2 satisfying
H 1 ( r 2 ) H 2 ( r 2 ) > η 1 ,
and
α 2 2 ( 1 + k ) 2 α 1 2 [ 1 k ( e η 1 δ 0 ) 1 2 ] 2 M 0 + ε 0 ,
where r 2 = ( M 0 + ε 0 ) M < r 0 . Now, we will claim that
e η 1 ( t t 0 ) ω ( t ) α 2 ( 1 + k ) 2 α 1 M , t t 0 δ 0 .
Assume that inequality (15) is not true, then there exists one constant ρ > t 0 such that
e η 1 ( t t 0 ) ω ( t ) e η 1 ( ρ t 0 ) ω ( ρ ) = α 2 ( 1 + k ) 2 α 1 M , t [ t 0 , ρ ] .
Accordingly, there exists a sufficient constant h > 0 satisfying
e η 1 ( ρ + h t 0 ) ω ( ρ + h ) e η 1 ( ρ t 0 ) ω ( ρ ) > 0 .
By employing Lemma 1, we have that
e η 1 ( t t 0 ) u ( t ) α 2 2 ( 1 + k ) 2 α 1 2 [ 1 k ( e η 1 δ 0 ) 1 2 ] 2 M = α 2 e η 1 ( ρ t 0 ) α 1 [ 1 k ( e η 1 δ 0 ) 1 2 ] 2 ω ( ρ ) , t [ t 0 , ρ ] .
In particular,
u ( ρ + θ ) α 2 e η 1 δ 0 α 1 [ 1 k ( e η 1 δ 0 ) 1 2 ] 2 ω ( ρ ) < q ω ( ρ ) , θ [ δ 0 , 0 ] .
which signifies that the inequality (11) holds at t = ρ . In virtue of Lemma 1 and Equation (16), it follows that u ( t ) α 2 2 ( 1 + k ) 2 α 1 2 [ 1 k ( e η 1 δ 0 ) 1 2 ] 2 M e η 1 ( t t 0 ) ( M 0 + ε 0 ) M = r 2 , t [ t 0 , ρ ] . When t = ρ + h , by the Newton–Leibniz formula, we can obtain that
e η 1 ( ρ + h t 0 ) ω ( ρ + h ) e η 1 ( ρ t 0 ) ω ( ρ ) = ρ ρ + h [ e η 1 ( s t 0 ) ω ( s ) ] d s = ρ ρ + h e η 1 ( s t 0 ) [ η 1 ω ( s ) + ω ˙ ( s ) ] d s ρ ρ + h e η 1 ( s t 0 ) η 1 ω ( s ) d s + ρ ρ + h e η 1 ( s t 0 ) H 1 ( u ( s ) ) + H 2 ( u t , δ ( t ) ) ω ( s ) d s ρ ρ + h e η 1 ( s t 0 ) η 1 ω ( s ) + H 1 ( r 2 ) + H 2 ( r 2 ) ω ( s ) d s 0 ,
which yields a contradiction with Equation (17). Therefore, inequality (15) holds. Accordingly, we have that
u ( t ) α 2 2 ( 1 + k ) 2 α 1 2 [ 1 k ( e η 1 δ 0 ) 1 2 ] 2 M e η 1 ( t t 0 ) ( M 0 + ε 0 ) M e η 1 ( t t 0 ) r 0 e η 1 ( t t 0 ) .
If D is a zero matrix, which implies that k = 0 , then the restrictive condition α 1 | x | 2 V ( x ) α 2 | x | 2 can be removed. Similarly to the proof of Lemma 2, we immediately derive the following assertion.
Corollary 1.
Suppose that H 1 : R + R + is a nonincreasing continuous function while H 2 : R + R + is a nondecreasing continuous function. Let V : R n [ 0 , + ) be a differentiable function and x ( t ) be the solution of the equation
d x d t = f ( x ( t ) , x ( t δ ( t ) ) , t ) .
Function u ( t ) = V ( x ( t ) ) satisfies the following inequality
u ˙ ( t ) [ H 1 ( u ( t ) ) + H 2 ( u t , δ ( t ) ) ] u ( t ) ,
for all t t 0 when u ( t + s ) < q u ( t ) , q > 1 , s [ δ 0 , 0 ] . If H 1 ( 0 ) > H 2 ( 0 ) and M = u t 0 , δ 0 < r 0 , then there exists a sufficiently small positive constant η 1 such that
u ( t ) r 0 e η 1 ( t t 0 ) , t t 0 ,
where a series of parameters r 0 , λ , η 1 satisfy r 0 = sup { r | H 1 ( r ) > H 2 ( r ) } , λ = H 1 ( r 0 ) H 2 ( r 0 ) and η 1 0 , min λ , 1 δ 0 ln q .
Remark 2.
In [38], a Halanay inequality is proposed based on the Razumikhin approach while the above corollary directly establishes the Razumikhin theory on the estimation of DOA for a class of time-delay system. Noting that q > 1 , the above result accords with the one in [38] in essence.
It can be observed that the considered delay δ ( t ) is bounded in Lemma 2. In what follows, we will discuss the case of the unbounded delay. This is especially true if δ ( t ) = ( 1 σ ) t , 0 < σ < 1 is a proportional delay, combining with the results in [44], then we can acquire the following assertion by choosing q = 2 .
Lemma 3.
Let Assumption 1 hold. If x ( t ) satisfies
( 1 + t ) η | x ( t ) D x ( σ t ) | 2 α 2 α 1 ( 1 + k ) 2 ( 1 + t 0 ) η sup σ t 0 s t 0 | x ( s ) | 2 ,
where t 0 0 and 0 < η < 2 ln k ln σ , then
( 1 + t ) η | x ( t ) | 2 α 2 ( 1 + k ) 2 ( 1 + t 0 ) η α 1 [ 1 k ( 1 σ ) η 2 ] 2 sup σ t 0 s t 0 | x ( s ) | 2 .
Proof. 
According to the inequality | a + b | 2 ( 1 + ϵ ) ( | a | 2 + | b | 2 ϵ ) , 0 < ϵ < 1 , we can obtain that
( 1 + t ) η | x ( t ) | 2 ( 1 + t ) η | x ( t ) D x ( σ t ) | 2 1 ϵ + k 2 | x ( σ ( t ) | 2 ) ϵ .
Noting that
( 1 + t ) η | x ( t ) D x ( σ t ) | 2 α 2 α 1 ( 1 + k ) 2 ( 1 + t 0 ) η sup σ t 0 s t 0 | x ( s ) | 2 ,
we can calculate that
sup t 0 s t ( ( 1 + t ) η | x ( s ) | 2 ) 1 1 ϵ sup t 0 s t ( ( 1 + t ) η | x ( s ) D x ( σ s ) | 2 ) + k 2 ϵ sup t 0 s t ( ( 1 + t ) η sup σ t 0 θ t | x ( θ ) | 2 ) α 2 α 1 ( 1 + t ) η ( 1 + k ) 2 ( 1 + t 0 ) η sup σ t 0 s t 0 | x ( s ) | 2 1 ϵ + k 2 ϵ ( 1 + t 1 + σ t ) η sup σ t 0 s t 0 ( 1 + s ) η | x ( s ) | 2 ,
which implies that
sup σ t 0 s t ( ( 1 + t ) η | x ( s ) | 2 ) α 2 α 1 ( 1 + t ) η ( 1 + k ) 2 ( 1 + t 0 ) η sup σ t 0 s t 0 | x ( s ) | 2 1 ϵ + k 2 ϵ ( 1 + t 1 + σ t ) η sup σ t 0 s t 0 ( 1 + s ) η | x ( s ) | 2 , t t 0 .
By taking ϵ = k ( 1 σ ) η 2 , we immediately acquire that
sup σ t 0 s t ( ( 1 + t ) η | x ( s ) | 2 ) α 2 ( 1 + k ) 2 ( 1 + t 0 ) η α 1 [ 1 k ( 1 σ ) η 2 ] 2 sup σ t 0 θ t 0 | x ( θ ) | 2 .
Lemma 4.
Let Assumption 1 hold. Suppose that functions H 1 , H 2 and V satisfy the same conditions as Lemma 2. x ( t ) is the solution of the equation
d [ x D x ( σ t ) ] d t = f ( x ( t ) , x ( σ t ) , t ) .
Let ϖ ( t ) = x ( t ) D x ( σ t ) , ω ( t ) = V ( ϖ ( t ) ) and u ( t ) = V ( x ( t ) ) . Functions ω ( t ) , u ( t ) and u ˜ ( t ) satisfy the following differentiable inequality
ω ˙ ( t ) [ H 1 ( u ( t ) ) + H 2 ( u ˜ ( t ) ) ] ω ( t ) , t t 0 ,
when u ( t + s ) < q ω ( t ) , s [ ( σ 1 ) t , 0 ] , where u ˜ ( t ) = u t , ( 1 σ ) t and q ¯ > ( 1 k ) 2 , q ¯ = α 1 q α 2 . If H 1 ( 0 ) > H 2 ( 0 ) and M = u t 0 , ( 1 σ ) t 0 < r 0 M 0 , then there exists a sufficiently small positive constant η 1 such that
u ( t ) r 0 ( 1 + t 0 ) η 1 ( 1 + t ) η 1 , t t 0 ,
where a series of parameters satisfy r 0 = sup { r | H 1 ( r ) H 2 ( r ) > 0 } , M 0 = α 2 2 ( 1 + k ) 2 α 1 2 ( 1 k ) 2 ( 1 + t 0 ) η 1 , r 1 = M 0 M , λ = H 1 ( r 1 ) H 2 ( r 1 ) and 0 < η 1 < min λ , 1 ln 1 σ ln q ¯ ( 1 + k q ¯ ) 2 .
Proof. 
In light of r 1 = M 0 M < r 0 , we can also choose two small enough constants ε 0 > 0 and
η 1 0 , min λ , 1 ln 1 σ ln q ( 1 + k q ) 2
such that
H 1 ( r 2 ) H 2 ( r 2 ) > η 1 ,
and
α 2 2 ( 1 + k ) 2 ( 1 + t 0 ) η 1 α 1 2 [ 1 k ( 1 σ ) η 1 2 ] 2 M 0 + ε 0 ,
where r 2 = ( M 0 + ε 0 ) M < r 0 . In what follows, we will prove that
( 1 + t ) η 1 ω ( t ) α 2 ( 1 + k ) 2 ( 1 + t 0 ) η 1 α 1 M .
If the above inequality is not true, then there exists one constant ρ > t 0 0 such that
( 1 + t ) η 1 ω ( t ) ( 1 + ρ ) η 1 ω ( ρ ) = α 2 ( 1 + k ) 2 ( 1 + t 0 ) η 1 α 1 M , t [ σ t 0 , ρ ] .
Correspondingly, there exists a time sequence of { t k } k 1 satisfying t k ρ and
( 1 + t k ) η 1 ω ( t k ) ( 1 + ρ ) η 1 ω ( ρ ) > 0 .
By utilizing Lemma 3, we obtain that
( 1 + t ) η 1 u ( t ) ( 1 + t 0 ) η 1 α 2 2 ( 1 + k ) 2 M α 1 2 [ 1 k ( 1 σ ) η 1 2 ] 2 = α 2 ( 1 + ρ ) η 1 ω ( ρ ) α 1 [ 1 k ( 1 σ ) η 1 2 ] 2 .
When θ [ ( σ 1 ) ρ , 0 ] , we have that
u ( ρ + θ ) ( 1 + ρ + θ ) η 1 α 2 ( 1 + ρ ) η 1 ω ( ρ ) α 1 [ 1 k ( 1 δ ) η 1 2 ] 2 1 + ρ 1 + ρ + θ η 1 α 2 ω ( ρ ) α 1 [ 1 k ( 1 δ ) η 1 2 ] 2 ( 1 σ ) η 1 α 2 α 1 [ 1 k ( 1 δ ) η 1 2 ] 2 ω ( ρ ) < q ω ( ρ ) .
Thus, we have ω ˙ ( t ) [ H 1 ( u ( t ) ) + H 2 ( u ˜ ( t ) ) ] ω ( t ) , t = ρ . When t [ σ t 0 , ρ ] , it follows that
u ( t ) α 2 2 ( 1 + k ) 2 ( 1 + t 0 ) η 1 α 1 2 [ 1 k ( 1 σ ) η 1 2 ] 2 M ( 1 + t ) η 1 ( M 0 + ε 0 ) M = r 2 .
When t = t k , by using the Newton–Leibniz formula, we can deduce that
( 1 + t k ) η 1 ω ( t k ) ( 1 + ρ ) η 1 ω ( ρ ) = ρ t k [ ( 1 + s ) η 1 ω ( s ) ] d s ρ t k ( 1 + s ) η 1 η 1 1 + s ω ( s ) + H 1 ( u ( s ) ) + H 2 ( u ˜ ( s ) ) ω ( s ) d s ρ t k ( 1 + s ) η 1 η 1 1 + s ω ( s ) H 1 ( r 2 ) H 2 ( r 2 ) ω ( s ) d s ρ t k ( 1 + s ) η 1 η 1 1 + s η 1 ω ( s ) d s 0 ,
which yields a contradiction, and inequality (29) holds. Therefore, one obtains
u ( t ) α 2 2 ( 1 + k ) 2 ( 1 + t 0 ) η 1 ( 1 + t ) η 1 M α 1 2 [ 1 k ( 1 σ ) η 1 2 ] 2 r 0 ( 1 + t 0 ) η 1 ( 1 + t ) η 1 .
Remark 3.
Lemma 2 and Lemma 4 give the estimations of DOA of neutral differential systems with bounded time-varying delays or unbounded proportional delays in the light of the Razumikhin approach. Compared with the results proposed in [31], our findings are not required to choose the complicated Lyapunov–Krasovskii functional, and the acquired conditions are easier to verify. Meanwhile, since the neutral term is incorporated, Lemma 2 in [38] cannot be directly applied to this circumstance. We further develop the theory work [37,38] to neutral differential systems.
Lemma 5.
([45]). Let P 1 , P 2 R n be n-dimensional vectors. The following inequality holds.
2 P 1 T P 2 P 1 T Λ P 1 + P 2 T Λ 1 P 2 ,
where Λ R n × n denotes arbitrary positive definite matrix.

3. Main Results

In this section, based on the established lemmas, we will estimate the DOA of HNNCNS (1). The cases of bounded delays and unbounded proportional delays are discussed, respectively. When the initial values belong to the DOA, the states of system locally exponentially or locally polynomially converge to the equilibrium point, which means that local synchronization is achieved.

3.1. Estimation of DOA on HNNCNs with Bounded Delays

In this subsection, we consider the case of the bounded delay δ ( t ) . Accordingly, we can derive the following theorem.
Theorem 1.
Let Assumption 1 hold. If control gain c > 0 satisfies
β = λ max 2 ( I N ( J 1 c I n ) ) + I n N + l 2 ( Q Q T Γ Γ T ) 2 q I N ( J 2 + ( J 1 c I n ) D ) + l ( Q Γ J 3 ) > 0 ,
and H 1 ( 0 ) > H 2 ( 0 ) , then system (1) realizes local exponential synchronization toward the equilibrium Θ, and the DOA is estimated as
R 0 ( r 0 ) = { ζ | z ( t ) t 0 , δ 0 < r 0 } = { ζ | ζ Θ t 0 , δ 0 < r 0 } ,
i.e.,
| | z ( t ) | | r ¯ 0 e η 1 2 ( t t 0 ) , ζ R 0 ( r 0 ) , t t 0 ,
where functions H 1 ( r ) , H 2 ( r ) satisfy H 1 ( r ) = β q ψ 1 ( r ) , H 2 ( r ) = q ψ 2 ( r ) + q ψ 3 ( r ) , and a series of parameters satisfy q > ( 1 k ) 2 , r ¯ 0 = sup { r | H 1 ( r ) + H 2 ( r ) < 0 } , M 0 = ( 1 + k ) 2 ( 1 k ) 2 , r 0 = r ¯ 0 M 0 , M = | | z ( t ) | | t 0 , δ 0 2 , r 1 = M 0 M , λ = H 1 ( r 1 ) H 2 ( r 1 ) > 0 , η 1 0 , min λ , 1 δ 0 ln q ( 1 + q k ) 2 .
Proof. 
To begin with, we can choose a candidate Lyapunov function
W ( t ) = i = 1 N [ z i ( t ) D z i ( t δ ( t ) ) ] T [ z i ( t ) D z i ( t δ ( t ) ) ] .
Calculating the derivative of W ( t ) along system (5), it can be deduced that
W ( t ) = 2 i = 1 N [ z i ( t ) D z i ( t δ ( t ) ) ] T ( J 1 c I n ) z i ( t ) + 2 i = 1 N [ z i ( t ) D z i ( t δ ( t ) ) ] T J 2 z i ( t δ ( t ) ) + 2 i = 1 N [ z i ( t ) D z i ( t δ ( t ) ) ] T Φ ( 1 ) i ( t ) + 2 l i = 1 N [ z i ( t ) D z i ( t δ ( t ) ) ] T j = 1 N q i j Γ J 3 z j ( t δ ( t ) ) + 2 l i = 1 N [ z i ( t ) D z i ( t δ ( t ) ) ] T j = 1 N q i j Γ Φ ( 2 ) j ( t δ ( t ) ) = 2 i = 1 N [ z i ( t ) D z i ( t δ ( t ) ) ] T ( J 1 c I n ) [ z i ( t ) D z i ( t δ ( t ) ) ] + 2 i = 1 N [ z i ( t ) D z i ( t δ ( t ) ) ] T J 2 + ( J 1 c I n ) D z i ( t δ ( t ) ) + 2 i = 1 N [ z i ( t ) D z i ( t δ ( t ) ) ] T Φ ( 1 ) i ( t ) + 2 l i = 1 N [ z i ( t ) D z i ( t δ ( t ) ) ] T j = 1 N q i j Γ J 3 z j ( t δ ( t ) ) + 2 l i = 1 N [ z i ( t ) D z i ( t δ ( t ) ) ] T j = 1 N q i j Γ Φ ( 2 ) j ( t δ ( t ) ) = 2 [ z ( t ) D ¯ z ( t δ ( t ) ) ] T I N ( J 1 c I n ) [ z ( t ) D ¯ z ( t δ ( t ) ) ] + 2 [ z ( t ) D ¯ z ( t δ ( t ) ) ] T I N ( J 2 + ( J 1 c I n ) D ) z ( t δ ( t ) ) + 2 [ z ( t ) D ¯ z ( t δ ( t ) ) ] T Φ ( 1 ) ( t ) + 2 l [ z ( t ) D ¯ z ( t δ ( t ) ) ] T Q Γ J 3 z ( t δ ( t ) ) + 2 l [ z ( t ) D ¯ z ( t δ ( t ) ) ] T Q Γ Φ ( 2 ) ( t δ ( t ) ) = 2 [ z ( t ) D ¯ z ( t δ ( t ) ) ] T I N ( J 1 c I n ) [ z ( t ) D ¯ z ( t δ ( t ) ) ] + 2 [ z ( t ) D ¯ z ( t δ ( t ) ) ] T I N ( J 2 + ( J 1 c I n ) D ) + l ( Q Γ J 3 ) z ( t δ ( t ) ) + 2 [ z ( t ) D ¯ z ( t δ ( t ) ) ] T Φ ( 1 ) ( t ) + 2 l [ z ( t ) D ¯ z ( t δ ( t ) ) ] T Q Γ Φ ( 2 ) ( t δ ( t ) ) ,
where z ( t ) = [ z 1 T ( t ) , z 2 T ( t ) , , z N T ( t ) ] T R n N , D ¯ = I N D R n N × n N . On the basis of inequalities (6) and (7) and Lemma 5, we have that
2 [ z ( t ) D ¯ z ( t δ ( t ) ) ] T I N ( J 2 + ( J 1 c I n ) D ) + l ( Q Γ J 3 ) z ( t δ ( t ) ) 2 | | z ( t ) D ¯ z ( t δ ( t ) ) | | | | I N ( J 2 + ( J 1 c I n ) D ) + l ( Q Γ J 3 ) | | | | z ( t δ ( t ) ) | | ,
2 [ z ( t ) D ¯ z ( t δ ( t ) ) ] T Φ ( 1 ) ( t ) [ z ( t ) D ¯ z ( t δ ( t ) ) ] T [ z ( t ) D ¯ z ( t δ ( t ) ) ] + ψ 1 ( z ( t ) ) z T ( t ) z ( t ) + ψ 2 ( z ( t ) t , δ ( t ) ) z T ( t δ ( t ) ) z ( t δ ( t ) ) ,
2 l [ z ( t ) D ¯ z ( t δ ( t ) ) ] T Q Γ Φ ( 2 ) ( t δ ( t ) ) l 2 [ z ( t ) D ¯ z ( t δ ( t ) ) ] T Q Q T Γ Γ T [ z ( t ) D ¯ z ( t δ ( t ) ) ] + ψ 3 ( z ( t ) t , δ ( t ) ) z T ( t δ ( t ) ) z ( t δ ( t ) ) .
Substituting inequalities (38)–(40) to inequality (37) yields that
W ( t ) 2 [ z ( t ) D ¯ z ( t δ ( t ) ) ] T I N ( J 1 c I n ) [ z ( t ) D ¯ z ( t δ ( t ) ) ] + 2 | | z ( t ) D ¯ z ( t δ ( t ) ) | | | | I N ( J 2 + ( J 1 c I n ) D ) + l ( Q Γ J 3 ) | | | | z ( t δ ( t ) ) | | + [ z ( t ) D ¯ z ( t δ ( t ) ) ] T [ z ( t ) D ¯ z ( t δ ( t ) ) ] + ψ 1 ( z ( t ) ) z T ( t ) z ( t ) + ψ 2 ( z ( t ) t , δ ( t ) ) z T ( t δ ( t ) ) z ( t δ ( t ) ) + l 2 [ z ( t ) D ¯ z ( t δ ( t ) ) ] T ( Q Q T Γ Γ T ) [ z ( t ) D ¯ z ( t δ ( t ) ) ] + ψ 3 ( z ( t ) t , δ ( t ) ) z T ( t δ ( t ) ) z ( t δ ( t ) ) [ z ( t ) D ¯ z ( t δ ( t ) ) ] T 2 ( I N ( J 1 c I n ) ) + I n N + l 2 ( Q Q T Γ Γ T ) [ z ( t ) D ¯ z ( t δ ( t ) ) ] + 2 | | z ( t ) D ¯ z ( t δ ( t ) ) | | | | I N ( J 2 + ( J 1 c I n ) D ) + l ( Q Γ J 3 ) | | | | z ( t δ ( t ) ) | | + ψ 1 ( z ( t ) ) z T ( t ) z ( t ) + ψ 2 ( z ( t ) t , δ ( t ) ) z T ( t δ ( t ) ) z ( t δ ( t ) ) + ψ 3 ( z ( t ) t , δ ( t ) ) z T ( t δ ( t ) ) z ( t δ ( t ) ) .
In light of Lemma 2, one has u ( t + s ) < q ω ( t ) , s [ δ 0 , 0 ] , which further gives that
W ( t ) λ max 2 ( I N ( J 1 c I n ) ) + I n N + l 2 ( Q Q T Γ Γ T ) z ( t ) D ¯ z ( t δ ( t ) ) 2 + 2 | | z ( t ) D ¯ z ( t δ ( t ) ) | | | | I N ( J 2 + ( J 1 c I n ) D ) + l ( Q Γ J 3 ) | | | | z ( t δ ( t ) ) | | + ψ 1 ( z ( t ) ) z ( t ) 2 + ψ 2 ( z ( t ) t , δ ( t ) ) z ( t δ ( t ) ) 2 + ψ 3 ( z ( t ) t , δ ( t ) ) z ( t δ ( t ) ) 2 [ λ max 2 ( I N ( J 1 c I n ) ) + I n N + l 2 ( Q Q T Γ Γ T ) + 2 q I N ( J 2 + ( J 1 c I n ) D ) + l ( Q Γ J 3 ) ] z ( t ) D ¯ z ( t δ ( t ) ) 2 + q ψ 1 ( z ( t ) ) z ( t ) D ¯ z ( t δ ( t ) ) 2 + q ψ 2 ( z ( t ) t , δ ( t ) ) z ( t ) D ¯ z ( t δ ( t ) ) 2 + q ψ 3 ( z ( t ) t , δ ( t ) ) z ( t ) D ¯ z ( t δ ( t ) ) 2 [ H 1 ( u ( t ) ) + H 2 ( u ^ ( t ) ) ] z ( t ) D ¯ z ( t δ ( t ) ) 2 = [ H 1 ( u ( t ) ) + H 2 ( u ^ ( t ) ) ] ω ( t ) ,
where parameter β satisfies β = λ max 2 ( I N ( J 1 c I n ) ) + I n N + l 2 ( Q Q T Γ Γ T ) 2 q I N ( J 2 + ( J 1 c I n ) D ) + l ( Q Γ J 3 ) > 0 , matrix P = 2 ( I N ( J 1 c I n ) ) + I n N + l 2 ( Q Q T Γ Γ T ) is a symmetric matrix, and a series of functions satisfy u ( t ) = z ( t ) 2 , u ^ ( t ) = z ( t ) t , δ ( t ) 2 , ω ( t ) = z ( t ) D ¯ z ( t δ ( t ) ) 2 , H 1 ( u ) = β q ψ 1 ( u ) , H 2 ( u ^ ) = q ψ 2 ( u ^ ) + q ψ 3 ( u ^ ) . Noting that H 1 ( 0 ) > H 2 ( 0 ) , we can choose an appropriate parameter r ¯ 0 such that
r ¯ 0 = sup { r | H 1 ( r ) + H 2 ( r ) < 0 } = sup { r | β + q ψ 1 ( r ) + q ψ 2 ( r ) + q ψ 3 ( r ) < 0 } .
Here, let α 1 = α 2 = 1 , q ¯ = q > ( 1 k ) 2 and M 0 = ( 1 + k ) 2 ( 1 k ) 2 . When initial data ζ R 0 ( r 0 ) = { ζ | z ( t ) t 0 , δ 0 < r 0 } = { ζ | ζ Θ t 0 , δ 0 < r 0 } , the states of system (1) exponentially converge to equilibrium Θ with the convergence rate η 1 by Lemma 2, namely
| | z ( t ) | | r ¯ 0 e η 1 2 ( t t 0 ) , t t 0 ,
where r 0 = r ¯ 0 M 0 , M = | | z ( t ) | | t 0 , δ 0 2 , r 1 = M 0 M , η 1 0 , min λ , 1 δ 0 ln q ( 1 + q k ) 2 and λ = H 1 ( r 1 ) H 2 ( r 1 ) > 0 , which means that the network system (1) realizes local exponential synchronization towards the equilibrium Θ with the convergence rate η 1 and the above DOA. □
Remark 4.
In Theorem 1, on the basis of Lemma 2, the problem of DOA estimation is solved for network system (1) with bounded delays. If control gain c is large enough, then network (1) achieves local exponential synchronization when the initial value ζ R 0 ( r 0 ) . Namely, there exists a close relationship among the control gain c, initial value ζ, and the local synchronization of the network system. On the other hand, although the dynamic properties of neutral complex networks such as stability, periodic solution, and synchronization have been sufficiently analyzed in [39,40,41,42], the research into DOA for highly nonlinear neutral complex networks has not been examined, and the above result bridges the gap. Additionally, it can also be viewed as an extension of the existing achievements [31,37,38].

3.2. Estimation of DOA on HNNCNs with Unbounded Proportional Delay

In this subsection, we consider the case of the unbounded proportional delay δ ( t ) = ( 1 σ ) t , 0 < σ < 1 . In system (1), the initial data are transformed into y i ( s ) = ζ i ( s ) , s [ σ t 0 , t 0 ] , 1 i N . Accordingly, we can derive the following theorem.
Theorem 2.
If all the conditions in Theorem 1 are satisfied, then system (1) realizes local polynomial synchronization toward the equilibrium Θ, and the DOA is estimated as
R 0 ( r 0 ) = { ζ | z ( t ) t 0 , ( 1 σ ) t 0 < r 0 } = { ζ | ζ Θ t 0 , ( 1 σ ) t 0 < r 0 } ,
i.e.,
| | z ( t ) | | r ¯ 0 ( 1 + t 0 ) η 1 2 ( 1 + t ) η 1 2 , ζ R 0 ( r 0 ) , t t 0 ,
where functions H 1 ( r ) , H 2 ( r ) satisfy H 1 ( r ) = β q ψ 1 ( r ) , H 2 ( r ) = q ψ 2 ( r ) + q ψ 3 ( r ) , and a series of parameters satisfy q > ( 1 k ) 2 , r ¯ 0 = sup { r | H 1 ( r ) + H 2 ( r ) < 0 } , M 0 = ( 1 + k ) 2 ( 1 k ) 2 ( 1 + t 0 ) η 1 , r 0 = r ¯ 0 M 0 , M = | | z ( t ) | | t 0 , ( 1 σ ) t 0 2 , r 1 = M 0 M , λ = H 1 ( r 1 ) H 2 ( r 1 ) > 0 , η 1 0 , min λ , 1 ln 1 σ ln q ( 1 + q k ) 2 .
Proof. 
Let W ( t ) be a candidate Lyapunov function
W ( t ) = i = 1 N [ z i ( t ) D z i ( σ t ) ] T [ z i ( t ) D z i ( σ t ) ] .
By repeating the previous proof procedure of Theorem 1, we can obtain the derivative of W ( t ) as follows
W ( t ) = 2 [ z ( t ) D ¯ z ( σ t ) ] T I N ( J 1 c I n ) [ z ( t ) D ¯ z ( σ t ) ] + 2 [ z ( t ) D ¯ z ( σ t ) ] T I N ( J 2 + ( J 1 c I n ) D ) + l ( Q Γ J 3 ) z ( σ t ) + 2 [ z ( t ) D ¯ z ( σ t ) ] T Φ ( 1 ) ( t ) + 2 l [ z ( t ) D ¯ z ( σ t ) ] T Q Γ Φ ( 2 ) ( σ t ) .
Subsequently, on the basis of Lemma 4, one obtains u ( t + s ) < q ω ( t ) , s [ ( σ 1 ) t , 0 ] , which further yields that
W ( t ) [ λ max 2 ( I N ( J 1 c I n ) ) + I n N + l 2 ( Q Q T Γ Γ T ) + 2 q I N ( J 2 + ( J 1 c I n ) D ) + l ( Q Γ J 3 ) ] z ( t ) D ¯ z ( σ t ) 2 + q ψ 1 ( z ( t ) ) z ( t ) D ¯ z ( σ t ) 2 + q ψ 2 ( z ( t ) t , ( 1 σ ) t ) z ( t ) D ¯ z ( σ t ) 2 + q ψ 3 ( z ( t ) t , ( 1 σ ) t ) z ( t ) D ¯ z ( σ t ) 2 [ H 1 ( u ( t ) ) + H 2 ( u ˜ ( t ) ) ] z ( t ) D ¯ z ( σ t ) 2 = [ H 1 ( u ( t ) ) + H 2 ( u ˜ ( t ) ) ] ω ( t ) ,
where parameter β satisfies β = λ max 2 ( I N ( J 1 c I n ) ) + I n N + l 2 ( Q Q T Γ Γ T ) 2 q I N ( J 2 + ( J 1 c I n ) D ) + l ( Q Γ J 3 ) > 0 , matrix P = 2 ( I N ( J 1 c I n ) ) + I n N + l 2 ( Q Q T Γ Γ T ) is a symmetric matrix, and a series of functions satisfy u ( t ) = z ( t ) 2 , u ˜ ( t ) = z ( t ) t , ( 1 σ ) t 2 , ω ( t ) = z ( t ) D ¯ z ( σ t ) 2 , H 1 ( u ) = β q ψ 1 ( u ) , H 2 ( u ˜ ( t ) ) = q ψ 2 ( u ˜ ( t ) ) + q ψ 3 ( u ˜ ( t ) ) . Since H 1 ( 0 ) > H 2 ( 0 ) , we can select an appropriate parameter r ¯ 0 satisfying
r ¯ 0 = sup { r | H 1 ( r ) + H 2 ( r ) < 0 } = sup { r | β + q ψ 1 ( r ) + q ψ 2 ( r ) + q ψ 3 ( r ) < 0 } .
Here, let α 1 = α 2 = 1 , q ¯ = q > ( 1 k ) 2 and M 0 = ( 1 + k ) 2 ( 1 k ) 2 ( 1 + t 0 ) η 1 . In virtue of Lemma 4, the states of system (1) polynomially converge to equilibrium Θ with the convergence rate η 1 when the initial data ζ R 0 ( r 0 ) = { ζ | z ( t ) t 0 , ( 1 σ ) t 0 < r 0 } = { ζ | ζ Θ t 0 , ( 1 σ ) t 0 < r 0 } , i.e.,
| | z ( t ) | | r ¯ 0 ( 1 + t 0 ) η 1 2 ( 1 + t ) η 1 2 , t t 0 ,
where r 0 = r ¯ 0 M 0 , M = | | z ( t ) | | t 0 , ( 1 σ ) t 0 2 , r 1 = M 0 M , η 1 0 , min λ , 1 ln 1 σ ln q ( 1 + q k ) 2 and λ = H 1 ( r 1 ) H 2 ( r 1 ) > 0 , which implies that the network system (1) realizes local polynomial synchronization towards the equilibrium Θ with the convergence rate η 1 and the above DOA. □
Remark 5.
Although the estimations of DOA of nonlinear systems are extensively investigated, the case of proportional unbounded delays has been discussed comparatively rarely. Here, the issue of DOA estimation is solved for the network system (1) with the unbounded proportional delay δ ( t ) = ( 1 σ ) t , 0 < σ < 1 by Lemma 4.
Remark 6.
In Assumption 1, it is noted that parameter k satisfies 0 < k < 1 which makes our results applicable to only one special class of neutral CNs. Additionally, in order to estimate the DOA of HNNCNs, the Razumikhin approach was adopted. Consequently, we can directly derive the DOA estimation rather than seek complicated Lyapunov–Krasovskii functionals. However, we do not design some parameter optimization algorithms to obtain the more accurate DOA estimation. In the future, we might further explore the DOA estimation based on various optimization algorithms.

4. Examples and Simulations

In this section, several examples are presented to verify the effectiveness of theoretical results.
Example 1.
Consider a class of HNNCNS composed of N nodes with the bounded delay δ ( t ) as following
d [ y i ( t ) D y i ( t δ ( t ) ) ] d t = F ( y i ( t ) , y i ( t δ ( t ) ) ) + l j = 1 N q i j Γ g ( y j ( t δ ( t ) ) ) + U i ( t ) , t t 0 , y i ( s ) = ζ i ( s ) , s [ t 0 δ 0 , t 0 ] , 1 i N ,
where the bounded delay δ ( t ) = 0.2 | cos ( t ) | , l = 0.5 , N = 10 , t 0 = 0 and
F 1 ( y i ( t ) , y i ( t δ ( t ) ) ) = 0.3 y i 1 ( t ) 0.6 y i 2 ( t ) 0.2 y i 1 ( t δ ( t ) ) + 0.5 y i 2 ( t δ ( t ) ) + y i 1 ( t ) ( y i 1 2 ( t ) + y i 2 2 ( t ) ) 3 2 , F 2 ( y i ( t ) , y i ( t δ ( t ) ) ) = 0.2 y i 1 ( t ) 0.7 y i 2 ( t ) + 0.6 y i 1 ( t δ ( t ) ) + 0.4 y i 2 ( t δ ( t ) ) + y i 2 ( t ) ( y i 1 2 ( t ) + y i 2 2 ( t ) ) 3 2 , g 1 ( y i ( t δ ( t ) ) ) = 0.8 y i 1 ( t δ ( t ) ) + 2 y i 1 ( t δ ( t ) ) ( y i 1 2 ( t δ ( t ) ) + y i 2 2 ( t δ ( t ) ) ) , g 2 ( y i ( t δ ( t ) ) ) = 0.4 y i 1 ( t δ ( t ) ) + 0.5 y i 2 ( t δ ( t ) ) + 2 y i 2 ( t δ ( t ) ) ( y i 1 2 ( t δ ( t ) ) + y i 2 2 ( t δ ( t ) ) ) , D = 0.1 0 0 0.12 , Γ = 0.2 0 0 0.5 , Q = 2 1 0 0 0 0 0 1 0 0 0 3 1 0 1 0 0 1 0 0 0 0 3 0 0 0 2 0 0 1 0 1 0 4 1 0 0 0 1 1 0 0 1 0 2 0 0 0 0 1 0 1 0 1 0 3 0 1 0 0 1 1 1 1 0 0 5 1 0 0 0 0 0 1 0 0 0 2 1 0 0 0 0 0 0 1 0 0 2 1 0 0 0 1 0 0 0 0 1 2 .
By Equation (3), we can obviously have an equilibrium point ϑ = [ 0 , 0 ] T , which is locally exponentially stable. By means of computation, we have that D = 0.12 , δ 0 = 0.2 , J 1 = 0.3 0.6 0.2 0.7 , J 2 = 0.2 0.5 0.6 0.4 , J 3 = 0.8 0 0.4 0.5 , and ψ 1 ( y ) = y 6 , ψ 2 ( y ) = 0 , ψ 3 ( y ) = 4 y 4 . By Assumption 1, we obtain that k = 1.2 . Taking q = 1.3 > ( 1 k ) 2 = 1.2913 and c = 12 , by means of computation, we can have that β = λ max 2 ( I N ( J 1 c I n ) ) + I n N + l 2 ( Q Q T Γ Γ T ) 2 q I N ( J 2 + ( J 1 c I n ) D ) + l ( Q Γ J 3 ) = 17.8354 > 0 , M 0 = ( 1 + k ) 2 ( 1 k ) 2 = 1.6198 > 1 , r ¯ 0 = sup { r | β + q ψ 1 ( r ) + q ψ 2 ( r ) + q ψ 3 ( r ) < 0 } = 1.8803 and r 0 = r ¯ M 0 = 1.1608 = 1.0774 . Let r 1 = M 0 M = 1.8 < r ¯ 0 , we obtain that
η 1 ( 0 , min { 1.8298 , 1 0.2 ln ( 1.3 ( 1 + 0.12 1.3 ) 2 ) } ) = ( 0 , 0.0295 ) .
According to Theorem 1, network (47) realizes local exponential synchronization toward the equilibrium Θ with the convergence rate η 1 if we can find that a sufficiently large control gain c such that β > 0 and the DOA is estimated as R 0 ( r 0 ) . Let the initial conditions be ζ 1 = [ 1 , 0.4 ] T , ζ 2 = [ 0.9 , 0.5 ] T , ζ 3 = [ 0.4 , 0.8 ] T , ζ 4 = [ 0.2 , 0.9 ] T , ζ 5 = [ 0.7 , 0.8 ] T , ζ 6 = [ 0.9 , 0.5 ] T , ζ 7 = [ 0.6 , 0.8 ] T , ζ 8 = [ 0.5 , 0.9 ] T , ζ 9 = [ 1 , 0.3 ] T , ζ 10 = [ 0.7 , 0.8 ] T . Noting that ζ R 0 ( r 0 ) , which illustrates that the initial condition belongs to the DOA R 0 ( r 0 ) . Taking η 1 = 0.02 , we obtain that
z ( t ) 1.8803 e 0.02 2 t = 1.3712 e 0.01 t , t 0 ,
which implies that the states of system (47) exponentially converge to the equilibrium point [ 0 , 0 ] T and further verifies the feasibility of Theorem 1. Figure 1 shows that the synchronization errors z i j ( i = 1 , 2 , , 10 ; j = 1 , 2 ) of Example 1 diverge to infinity, which indicates that exponential synchronization cannot be achieved without control input when ζ R 0 ( r 0 ) . On the other hand, Figure 2 shows that synchronization errors z i j ( i = 1 , 2 , , 10 ; j = 1 , 2 ) converge to equilibrium point, which indicates that the exponential synchronization can be realized with the control input when ζ R 0 ( r 0 ) . This example illustrates the significance of initial values and control input.
Example 2.
Consider a class of HNNCNS composed of N nodes with the unbounded proportional delay δ ( t ) = ( 1 σ ) t , 0 < σ < 1 as follows
d [ y i ( t ) D y i ( σ t ) ] d t = F ( y i ( t ) , y i ( σ t ) ) + l j = 1 N q i j Γ g ( y j ( σ t ) ) + U i ( t ) , t t 0 = 0 , y i ( t 0 ) = ζ i , 1 i N ,
where parameters l , σ , N , t 0 , functions F 1 ( y i ( t ) , y i ( σ t ) ) , F 2 ( y i ( t ) , y i ( σ t ) ) , g 1 ( y i ( σ t ) ) , g 2 ( y i ( σ t ) ) , and matrices D , Γ , Q are chosen as below
l = 0.1 , σ = 0.8 , N = 10 , t 0 = 0 , F 1 ( y i ( t ) , y i ( σ t ) ) = 0.1 y i 1 ( t ) + 0.2 y i 1 ( σ t ) + 0.4 y i 2 ( σ t ) + 0.8 y i 1 ( σ t ) ( y i 1 2 ( σ t ) + y i 2 2 ( σ t ) ) 2 , F 2 ( y i ( t ) , y i ( σ t ) ) = 0.4 y i 1 ( t ) 0.3 y i 2 ( t ) 0.4 y i 1 ( σ t ) + 0.5 y i 2 ( σ t ) + 0.8 y i 2 ( σ t ) ( y i 1 2 ( σ t ) + y i 2 2 ( σ t ) ) 2 , g 1 ( y i ( σ t ) ) = 0.4 y i 1 ( σ t ) + 0.1 y i 2 ( σ t ) + 1.5 y i 1 ( σ t ) ( y i 1 2 ( σ t ) + y i 2 2 ( σ t ) ) 1 2 , g 2 ( y i ( σ t ) ) = 0.1 y i 1 ( σ t ) + 0.3 y i 2 ( σ t ) + 1.5 y i 2 ( σ t ) ( y i 1 2 ( σ t ) + y i 2 2 ( σ t ) ) 1 2 , D = 0.2 0 0 0.18 , Γ = 0.3 0 0 0.4 , Q = 3 1 0 0 0 0 2 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0 2 0 0 0 0 0 1 0 0 0 0 5 1 2 0 0 1 1 0 0 1 0 3 0 1 0 0 1 0 1 0 1 0 2 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 1 0 0 1 0 0 3 1 0 0 0 0 0 0 1 0 0 2 1 1 0 0 1 0 0 1 0 1 4 .
By Equation (3), we can obviously have an equilibrium point ϑ = [ 0 , 0 ] T , which is locally polynomially stable. By computing, we have that D = 0.2 , J 1 = 0.1 0 0.4 0.3 , J 2 = 0.2 0.4 0.4 0.5 , J 3 = 0.4 0.1 0.1 0.3 , and ψ 1 ( y ) = 0 , ψ 2 ( y ) = 0.64 y 8 , ψ 3 ( y ) = 2.25 y 2 .
According to Assumption 1, we get k = 0.2 . Taking q = 1.6 > ( 1 k ) 2 = 1.5625 and c = 18 . By simply computational procedure, we obtain that β = λ max 2 ( I N ( J 1 c I n ) ) + I n N + l 2 ( Q Q T Γ Γ T ) 2 q I N ( J 2 + ( J 1 c I n ) D ) + l ( Q Γ J 3 ) = 26.2354 > 0 , M 0 = ( 1 + k ) 2 ( 1 k ) 2 ( 1 + t 0 ) η 1 = ( 1 + k ) 2 ( 1 k ) 2 = 2.2500 > 1 , r ¯ 0 = sup { r | β + q ψ 1 ( r ) + q ψ 2 ( r ) + q ψ 3 ( r ) < 0 } = 2.0216 and r 0 = r ¯ 0 M 0 = 0.8985 = 0.9479 . Let r 1 = M 0 M = 2 < r ¯ 0 , we have that
η 1 ( 0 , min { 0.9554 , 1 ln ( 1 0.8 ) ln ( 1.6 ( 1 + 0.2 1.6 ) 2 ) } ) = ( 0 , 0.0849 ) .
Based on Theorem 2, network (48) realizes local polynomial synchronization toward the equilibrium Θ with the convergence rate η 1 if we can find that a sufficiently large control gain c such that β > 0 and the DOA is estimated as R 0 ( r 0 ) . We can also choose the initial condition ζ R 0 ( r 0 ) as follows ζ 1 = [ 0.7 , 0.6 ] T , ζ 2 = [ 0.5 , 0.3 ] T , ζ 3 = [ 0.7 , 0.4 ] T , ζ 4 = [ 0.5 , 0.4 ] T , ζ 5 = [ 0.3 , 0.6 ] T , ζ 6 = [ 0.8 , 0.2 ] T , ζ 7 = [ 0.1 , 0.3 ] T , ζ 8 = [ 0.3 , 0.7 ] T , ζ 9 = [ 0.4 , 0.8 ] T , ζ 10 = [ 0.5 , 0.5 ] T , which shows that the initial conditions belong to the DOA R 0 ( r 0 ) . Taking η 1 = 0.08 , we can obtain that
z ( t ) 2.0216 ( 1 + t 0 ) 0.08 2 ( 1 + t ) 0.08 2 = 1.4218 ( 1 + t ) 0.04 , t 0 ,
which means that the states of system (48) polynomially converge to equilibrium point [ 0 , 0 ] T and validate the effectiveness of Theorem 2. Figure 3 shows that synchronization errors z i j ( i = 1 , 2 , , 10 ; j = 1 , 2 ) of Example 2 diverge towards infinity, indicating that polynomial synchronization cannot be achieved without control input when ζ R 0 ( r 0 ) . On the other hand, Figure 4 shows that synchronization errors z i j ( i = 1 , 2 , , 10 ; j = 1 , 2 ) converge to an equilibrium point, which indicates that polynomial synchronization can be realized with control input when ζ R 0 ( r 0 ) . In contrast to Example 1, proportional delays are considered here. Actually, when ζ R 0 ( r 0 ) and control gain c is not sufficiently large, polynomial synchronization cannot be realized.

5. Conclusions

In this paper, to begin with, several novel Razumikhin Lemmas on the estimations of DOA for a class of highly nonlinear neutral differential systems have been established. Thereafter, by utilizing the presented lemmas, the estimation of DOA of HNNCNs with bounded delays or unbounded proportional delays is given, respectively. The theoretical results reveal that the local exponential or polynomial synchronization of HNNCNs can be realized when initial values starting from the DOA finally exponentially or polynomially converge to an equilibrium point. Finally, several numerical simulations illustrate the feasibility of theoretical results. In the future, we will further explore the DOA estimation for highly nonlinear discrete systems and switching systems.

Author Contributions

Conceptualization, H.Y.; software, H.Y.; funding acquisition, Y.S.; investigation, H.Y.; methodology, Y.S.; writing—original draft preparation, H.Y.; writing—review and editing, H.Y. and Y.S.; supervision, Y.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research is jointly supported by the National Natural Science Foundation of China (62076039).

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. D’Ambra, J.; Wilson, C.S. Explaining perceived performance of the World Wide Web: Uncertainty and the task-technology fit model. Internet Res. 2004, 14, 294–310. [Google Scholar] [CrossRef]
  2. Zhou, Y.; Wang, J.; Huang, G.Q. Efficiency and robustness of weighted air transport networks. Transp. Res. Part E Logist. Transp. Rev. 2019, 122, 14–26. [Google Scholar] [CrossRef]
  3. Wang, Z.; Chen, G.; Liu, L.; Hill, D.J. Cascading risk assessment in power-communication interdependent networks. Phys. A Stat. Mech. Its Appl. 2020, 540, 120496. [Google Scholar] [CrossRef]
  4. Qian, Y.; Wang, B.; Xue, Y.; Zeng, J.; Wang, N. A simulation of the cascading failure of a complex network model by considering the characteristics of road traffic conditions. Nonlinear Dyn. 2015, 80, 413–420. [Google Scholar] [CrossRef]
  5. Wenli, F.; Zhigang, L.; Ping, H.; Shengwei, M. Cascading failure model in power grids using the complex network theory. IET Gener. Transm. Dis. 2016, 10, 3940–3949. [Google Scholar] [CrossRef]
  6. Silva, C.J.; Cantin, G. Synchronization and self-organization in complex networks for a tuberculosis model. Math. Comput. Sci. 2021, 15, 107–120. [Google Scholar] [CrossRef]
  7. Wan, P.; Zeng, Z. Synchronization of delayed complex networks on time scales via aperiodically intermittent control using matrix-based convex combination method. IEEE Trans. Neural Netw. Learn. Syst. 2021, 34, 2938–2950. [Google Scholar] [CrossRef] [PubMed]
  8. Zhou, Y.; Zeng, Z. Event-triggered impulsive quasisynchronization of coupled dynamical networks with proportional delay. IEEE Trans. Cybern. 2022, 53, 6479–6490. [Google Scholar] [CrossRef] [PubMed]
  9. Charakopoulos, A.; Karakasidis, T. Pattern identification for wind power forecasting via complex network and recurrence plot time series analysis. Energy Policy 2019, 133, 110934. [Google Scholar] [CrossRef]
  10. Wang, Q.; Cao, S.; Xiao, Y. Statistical characteristics of international conflict and cooperation network. Phys. A Stat. Mech. Its Appl. 2019, 535, 122334. [Google Scholar] [CrossRef]
  11. Gao, P.; Wang, Y.; Peng, Y.; Zhang, L.; Li, S. Tracking control of the nodes for the complex dynamical network with the auxiliary links dynamics. Inf. Sci. 2023, 628, 350–359. [Google Scholar] [CrossRef]
  12. Xie, T.; Xiong, X. Robustness Analysis of exponential synchronization in complex dynamic networks with deviating arguments and parameter uncertainties. Symmetry 2024, 16, 158. [Google Scholar] [CrossRef]
  13. Yu, W.; DeLellis, P.; Chen, G.; Di Bernardo, M.; Kurths, J. Distributed adaptive control of synchronization in complex networks. IEEE Trans. Autom. Control 2012, 57, 2153–2158. [Google Scholar] [CrossRef]
  14. Luo, M.; Liu, X.; Zhong, S.; Cheng, J. Synchronization of stochastic complex networks with discrete-time and distributed coupling delayed via hybrid nonlinear and impulsive control. Chaos Soliton Fract. 2018, 114, 381–393. [Google Scholar] [CrossRef]
  15. Lv, X.; Cao, J.; Li, X.; Abdel-Aty, M.; Al-Juboori, U.A. Synchronization analysis for complex dynamical networks with coupling delay via event-triggered delayed impulsive control. IEEE Trans. Cybern. 2020, 51, 5269–5278. [Google Scholar] [CrossRef] [PubMed]
  16. Zhao, L.H.; Wen, S.; Xu, M.; Shi, K.; Zhu, S.; Huang, T. PID control for output synchronization of multiple output coupled complex networks. IEEE Trans. Netw. Sci. Eng. 2022, 9, 1553–1566. [Google Scholar] [CrossRef]
  17. Lu, J.; Ho, D.W. Local and global synchronization in general complex dynamical networks with delay coupling. Chaos Soliton Fract. 2008, 37, 1497–1510. [Google Scholar] [CrossRef]
  18. Wang, J.L.; Wu, H.N. Local and global exponential output synchronization of complex delayed dynamical networks. Nonlinear Dyn. 2012, 67, 497–504. [Google Scholar] [CrossRef]
  19. Stout, J.; Whiteway, M.; Ott, E.; Girvan, M.; Antonsen, T.M. Local synchronization in complex networks of coupled oscillators. Chaos 2011, 21, 025109. [Google Scholar] [CrossRef]
  20. Wang, J.; Zhang, H.; Wang, Z.; Wang, B. Local exponential synchronization in complex dynamical networks with time-varying delay and hybrid coupling. Appl. Math. Comput. 2013, 225, 16–32. [Google Scholar] [CrossRef]
  21. Wang, J.; Zhang, H.; Wang, Z.; Liang, H. Local stochastic synchronization for Markovian neutral-type complex networks with partial information on transition probabilities. Neurocomputing 2015, 167, 474–487. [Google Scholar] [CrossRef]
  22. Luo, Y.; Deng, F.; Ling, Z.; Cheng, Z. Local H synchronization of uncertain complex networks via non-fragile state feedback control. Math. Comput. Simul. 2019, 155, 335–346. [Google Scholar] [CrossRef]
  23. Zhao, Z.; Jian, J.; Wang, B. Global attracting sets for neutral-type BAM neural networks with time-varying and infinite distributed delays. Nonlinear Anal. Hybrid Syst. 2015, 15, 63–73. [Google Scholar] [CrossRef]
  24. Duan, L.; Jian, J.; Wang, B. Global exponential dissipativity of neutral-type BAM inertial neural networks with mixed time-varying delays. Neurocomputing 2020, 378, 399–412. [Google Scholar] [CrossRef]
  25. Xu, L.; Dai, Z.; Ge, S.S. Almost surely attractive sets of discrete-time Markov jump systems with stochastic disturbances via impulsive control. IET Control Theory Appl. 2019, 13, 78–86. [Google Scholar]
  26. Dai, Z.; Xu, L.; Ge, S.S. Attracting sets of discrete-time Markovian jump delay systems with stochastic disturbances via impulsive control. J. Franklin Inst. 2020, 357, 9781–9810. [Google Scholar]
  27. Chesi, G. Estimating the domain of attraction for uncertain polynomial systems. Automatica 2004, 40, 1981–1986. [Google Scholar] [CrossRef]
  28. Topcu, U.; Packard, A.K.; Seiler, P.; Balas, G.J. Robust region-of-attraction estimation. IEEE Trans. Autom. Control 2010, 55, 137–142. [Google Scholar] [CrossRef]
  29. Henrion, D.; Korda, M. Convex computation of the region of attraction of polynomial control systems. IEEE Trans. Autom. Control 2014, 59, 297–312. [Google Scholar]
  30. Melchor-Aguilar, D.; Niculescu, S.I. Estimates of the attraction region for a class of nonlinear time-delay systems. IMA J. Math. Control Inf. 2007, 24, 523–550. [Google Scholar]
  31. Gomez, M.A.; Egorov, A.V.; Mondié, S. Computation of the region of attraction for a class of nonlinear neutral type delay systems. IFAC-PapersOnLine 2017, 50, 11990–11995. [Google Scholar] [CrossRef]
  32. Alexandrova, I.V. On the robustness and estimation of the attraction region for a class of nonlinear time delay systems. Appl. Math. Lett. 2020, 106, 106374. [Google Scholar] [CrossRef]
  33. Villafuerte, R.; Mondié, S.; Niculescu, S.I. Stability analysis and estimate of the region of attraction of a human respiratory model. IMA J. Math. Control Inf. 2010, 27, 309–327. [Google Scholar] [CrossRef]
  34. Singh, M.; Mahia, R.N.; Fulwani, D.M. Towards characterization of driver nodes in complex network with actuator saturation. Neurocomputing 2016, 201, 104–111. [Google Scholar] [CrossRef]
  35. Mahia, R.N.; Singh, M.; Fulwani, D.M. Identification of optimal set of driver nodes in complex networked systems using region of attraction. Int. J. Control Autom. 2018, 16, 97–107. [Google Scholar] [CrossRef]
  36. Zou, M.; Guo, W. Analysing region of attraction of load balancing on complex network. J. Complex Netw. 2022, 10, 2551–2556. [Google Scholar] [CrossRef]
  37. Zhu, S.; Zhou, J.; Chen, G.; Lu, J.A. Estimating the region of attraction on a complex dynamical network. SIAM J. Control Optim. 2019, 57, 1189–1208. [Google Scholar] [CrossRef]
  38. Zhu, S.; Zhou, J.; Lu, J.A. Estimating the region of attraction on controlled complex networks with time-varying delay. IEEE Trans. Autom. Control 2023, 68, 516–523. [Google Scholar] [CrossRef]
  39. Liu, Y.; Wang, Z.; Liang, J.; Liu, X. Synchronization of coupled neutral-type neural networks with jumping-mode-dependent discrete and unbounded distributed delays. IEEE Trans. Cybern. 2012, 43, 102–114. [Google Scholar] [PubMed]
  40. Zhang, X.; Li, W.; Wang, K. The existence and global exponential stability of periodic solution for a neutral coupled system on networks with delays. Appl. Math. Comput. 2015, 264, 208–217. [Google Scholar] [CrossRef]
  41. Dai, A.; Zhou, W.; Xu, Y.; Xiao, C. Adaptive exponential synchronization in mean square for Markovian jumping neutral-type coupled neural networks with time-varying delays by pinning control. Neurocomputing 2016, 173, 809–818. [Google Scholar] [CrossRef]
  42. Wang, W.; Li, L.; Peng, H.; Wang, W.; Kurths, J.; Xiao, J.; Yang, Y. Anti-synchronization of coupled memristive neutral-type neural networks with mixed time-varying delays via randomly occurring control. Nonlinear Dyn. 2016, 83, 2143–2155. [Google Scholar] [CrossRef]
  43. Janković, S.; Randjelović, J.; Jovanović, M. Razumikhin-type exponential stability criteria of neutral stochastic functional differential equations. J. Math. Anal. Appl. 2009, 355, 811–820. [Google Scholar] [CrossRef]
  44. Zou, Z.; Song, Y.; Zhao, C. Razumikhin theorems on polynomial stability of neutral stochastic pantograph differential equations with Markovian switching. Mathematics 2022, 10, 3048. [Google Scholar] [CrossRef]
  45. Boyd, S.; El Ghaoui, L.; Feron, E.; Balakrishnan, V. Linear Matrix Inequalities in System and Control Theory; SIAM: Philadelphia, PA, USA, 1994. [Google Scholar]
Figure 1. Synchronization errors z i j ( i = 1 , 2 , , 10 ; j = 1 , 2 ) of system (47) without control input when the initial values ζ R 0 ( r 0 ) .
Figure 1. Synchronization errors z i j ( i = 1 , 2 , , 10 ; j = 1 , 2 ) of system (47) without control input when the initial values ζ R 0 ( r 0 ) .
Symmetry 16 00643 g001
Figure 2. Synchronization errors z i j ( i = 1 , 2 , , 10 ; j = 1 , 2 ) of system (47) with control input when the initial values ζ R 0 ( r 0 ) .
Figure 2. Synchronization errors z i j ( i = 1 , 2 , , 10 ; j = 1 , 2 ) of system (47) with control input when the initial values ζ R 0 ( r 0 ) .
Symmetry 16 00643 g002
Figure 3. Synchronization errors z i j ( i = 1 , 2 , , 10 ; j = 1 , 2 ) of system (48) without control input when the initial values ζ R 0 ( r 0 ) .
Figure 3. Synchronization errors z i j ( i = 1 , 2 , , 10 ; j = 1 , 2 ) of system (48) without control input when the initial values ζ R 0 ( r 0 ) .
Symmetry 16 00643 g003
Figure 4. Synchronization errors z i j ( i = 1 , 2 , , 10 ; j = 1 , 2 ) of system (48) with control input when the initial values ζ R 0 ( r 0 ) .
Figure 4. Synchronization errors z i j ( i = 1 , 2 , , 10 ; j = 1 , 2 ) of system (48) with control input when the initial values ζ R 0 ( r 0 ) .
Symmetry 16 00643 g004
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Yu, H.; Song, Y. Estimation of the Domain of Attraction on Controlled Nonlinear Neutral Complex Networks via Razumikhin Approach. Symmetry 2024, 16, 643. https://doi.org/10.3390/sym16060643

AMA Style

Yu H, Song Y. Estimation of the Domain of Attraction on Controlled Nonlinear Neutral Complex Networks via Razumikhin Approach. Symmetry. 2024; 16(6):643. https://doi.org/10.3390/sym16060643

Chicago/Turabian Style

Yu, Hong, and Yinfang Song. 2024. "Estimation of the Domain of Attraction on Controlled Nonlinear Neutral Complex Networks via Razumikhin Approach" Symmetry 16, no. 6: 643. https://doi.org/10.3390/sym16060643

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop