Next Article in Journal
Tsallis Entropy for the Past Lifetime Distribution with Application
Previous Article in Journal
Enhancing Contractor Selection Process by a New Interval-Valued Fuzzy Decision-Making Model Based on SWARA and CoCoSo Methods
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Passivity Analysis and Complete Synchronization of Fractional Order for Both Delayed and Non-Delayed Complex Dynamical Networks with Couplings in the Derivative

1
Center for Computational Modeling, Chennai Institute of Technology, Chennai 600069, India
2
Ramanujan Centre for Higher Mathematics, Alagappa University, Karaikudi 630004, India
3
Department of Computer Science and Mathematics, Lebanese American University, Beirut P.O. Box 13-5053, Lebanon
4
Department of Mathematics and Sciences, Prince Sultan University, Riyadh 11586, Saudi Arabia
5
Department of Industrial Engineering, OSTİM Technical University, Ankara 06374, Turkey
6
Department of Mathematics, Maejo University, Chiang Mai 50290, Thailand
7
Department of Mathematics, Texas A & M University-Kingsville, Kingsville, TX 78363, USA
*
Authors to whom correspondence should be addressed.
Axioms 2023, 12(8), 730; https://doi.org/10.3390/axioms12080730
Submission received: 13 May 2023 / Revised: 18 July 2023 / Accepted: 25 July 2023 / Published: 27 July 2023
(This article belongs to the Section Mathematical Analysis)

Abstract

:
This manuscript explores the analysis of passivity and synchronization criteria for a complex fractional-order dynamical network model with derivative couplings and time-varying delays. The passivity problem of the proposed network model is deduced using various inequality methods and presented as a linear matrix inequality. To ensure complete synchronization for a fractional-order complex dynamical network with derivative couplings (CDNMDC), we derive suitable criteria using an adaptive feedback control method. Additionally, we investigate the synchronization criterion of these complex networks while accounting for parameter uncertainties. Finally, we provide an example to demonstrate the effectiveness of the proposed solutions.

1. Introduction

In the sciences and engineering, complex network research is extremely important. A complex network is a significant collection of nodes that are all connected to one another, with each node often being a nonlinear system. Access to the virtual in many forms, including social, biological, and technical networks, has been used to simulate many real-world systems. An extensive network of interconnected neurons, for instance, makes up the brain. The result of intricate interactions between genes, proteins, and other molecules is the structure and operation of the cell. Graphs depicting the interactions of individuals can be used to illustrate social systems. In food webs, the interconnectedness of the species that make up eco-systems may be seen. In science and engineering, synchronized behavior is crucial and has multiple uses in a wide range of disciplines, including mechanics, electronics, physics, chemistry, biology, and even economics. In addition, synchronization occurs constantly in both nature and human existence. The literature [1,2,3] provides some instances of synchronous motion that are seen in real-world systems. In the literature, authors have studied a number of synchronization types, including complete synchronization [4], lag synchronization [5], asymptotic synchronization [6], projective synchronization [7], etc.
In reality, nodes frequently are unable to achieve synchronization on their own because of their complex design, network topology, circumstances around CDNs, and connection quality. The main goal of control is to provide the designers of engineering systems with the concepts and strategies that they need to safeguard visually pleasing execution by naturally adjusting to environmental changes. By weighing the assessment of plant work and a chosen direction reference, the self-controller might choose how to adjust the available control factors (controlled data sources) such that the system reacts appropriately regardless of whether the state over the plant changes unexpectedly. This is a fundamental aspect of engineering systems because they have to work effectively and dependably in a range of environments, incorporating pinning control, non-fragile control, adaptive control, state feed-back control, and control. Due to the finite switching speeds of amplifiers and traffic congestion, temporal delays frequently occur in the process of information storage and transmission in complex dynamic systems in biological and physical systems. However, the utilization of complex networks is impacted by several unanticipated performance factors and features brought about by the presence of periodic delays, such as instability, oscillation, bifurcation, and chaos. For the dynamic analysis of complex systems, it is crucial to research the impacts of temporal delays. The literature [8,9,10,11,12,13,14] has provided a large amount of data on the passivity analysis of dynamic systems with time delays.
The basic claim of passivity theory is that a system’s passive characteristics can maintain the system’s internal stability. Passivity was initially introduced in the context of circuit analysis from an energy perspective. In most cases, passivity is a useful technique in assessing the stability of complicated dynamic systems. The passivity problem has also found success in a few domains, including stability, chaotic control and synchronization, signal processing, complexity, and fuzzy control. There is a wealth of literature available examining the dynamic features of practical systems, and recent years have seen a resurgence in interest in the passivity difficulties for several practical systems.
Each dynamical node in the earlier research on complex networks with coupling delays is determined by the derivatives of the present state variables of every node. However, in some circumstances, the more accurate network model should also include historical data on the rates of change of the network’s state variables. Examples of such networks include the stock market, the population ecological system, the biological system, and the ecosystem, where the current and historical data on rate fluctuations define each node’s state. Investigating fractional-order complex dynamical networks brings numerous advantages. By incorporating fractional derivatives and integrals, these networks offer enhanced modeling accuracy, capturing intricate behaviors and phenomena beyond traditional integer-order models. They exhibit flexibility in capturing complex dynamics, including memory effects, nonlocal interactions, and anomalous diffusion, prevalent in various fields. Fractional-order networks demonstrate resilience to noise and disturbances, improved stability analysis, and the uncovering of emergent properties, shedding light on collective phenomena and self-organization. They provide a realistic representation of real-world systems, enabling efficient control and optimization strategies.
As a result, an increasing number of authors have investigated the dynamical behaviors of complex dynamical networks, including passivity. In [15], the authors investigated the finite time passivity analysis of complex dynamical networks with multi-weights in different dimensional nodes. In [16], the authors studied the synchronization of coupled reaction diffusion neural networks with multiple derivative couplings and its passivity. The authors investigated fractional-order neural networks with interval uncertainties and analyzed their passivity in [17]. In [18], the authors studied coupled reaction–diffusion neural networks by considering state and diffusion couplings with proportional derivative control and studied the passivity. Moreover, in [19], they investigated the passivity analysis of fractional-order neural networks using a matrix polytope approach. Meanwhile, in [20], the authors examined the passivity analysis of complex dynamical networks with spatial diffusive couplings using pinning controllers. In [21], based on passivity theory, the authors studied the synchronization of complex dynamical networks incorporating the uncertainty parameter in the inner couplings. Moreover, most of the results based on passivity and synchronization with derivative couplings are mainly focused only on integer-order cases. However, some authors have investigated fractional-order cases, but without considering any type of delay or uncertainty. Very recently, authors studied and analyzed the passivity of fractional-order neural networks with multiple derivative couplings in [22]. In [23], the authors studied H-infinity-based mixed stability for genetic regulatory networks considering variable delays. Additionally, authors investigated Markovian switching complex dynamical networks considering multiple time-varying delays with stochastic perturbation and analyzed the passivity in [24]. To date, there are no results noted for fractional-order delayed complex dynamical networks with derivative couplings including parameter uncertainty, as well as passivity and synchronization analysis. Motivated by the above discussion, the main contributions of the paper are given as follows.
  • We have constructed general fractional-order complex dynamical networks with coupling delays including parameter uncertainty and performed a passivity analysis.
  • We have analyzed the complete synchronization of the fractional-order complex dynamical networks with derivative couplings including the parameter uncertainty for the first time in the literature.
  • Using Lyapnouv stability theory and fractional-order inequalities, we have given some sufficient conditions to prove the passivity and synchronization analysis in terms of linear matrix inequalities using an adaptive controller.
  • The conditions of the complete synchronization have been derived in terms of LMI, and the viability of obtaining results using the LMI MATLAB control toolbox has been checked. Finally, numerical simulations have been given.

2. Preliminaries and Lemmas

The following definitions, lemmas, and properties are very useful to prove our results effectively.
Definition 1 
([25]). Let us define a function Z ( t ) C n ( [ t 0 , + ) ) of fractional order ς with the Caputo derivative given by
D ς Z ( t ) = 1 Γ ( n ς ) t 0 t Z n ( ϕ ) ( t ϕ ) ς n + 1 d ϕ ,
Here, t t 0 and n is the non-negative integer such that n 1 < ς < n . Specifically, in this paper, we consider ς ( 0 , 1 ) , which can be given by
D ς Z ( t ) = 1 Γ ( 1 ς ) 0 t Z ( ϕ ) ( t ϕ ) ς d ϕ .
Definition 2 
([25]). The fractional integral of order ς > 0 for a function y ( t ) is given by
I ς y ( t ) = 1 Γ ( 1 ς ) t o t y ( ϕ ) ( t ϕ ) 1 ς d ϕ .
Definition 3. 
For a function f ( t ) C n ( [ 0 , + ) ) , we define the Caputo fractional derivative by
( c D 0 + ς f ) ( t ) = ( I 0 + n ς D n f ) ( t ) , where ( I 0 + ς f ) ( t ) = 1 Γ ( ς ) 0 t ( t s ) ς 1 f ( s ) d s ,
where ς > 0 with n 1 < ς n , n N and Γ denotes the usual gamma function.
For notational convenience, we set D ς for c D 0 + ς .
Definition 4 
([22]). Let V ( t ) be the non-negative function; then, the system is said to be
  • Passive if
    D ς V ( t ) π T ( t ) W ρ ( t ) , t 0 .
  • Strictly input-passive if
    D ς V ( t ) π T ( t ) W ρ ( t ) ρ T ( t ) W 1 ρ ( t ) , t 0 .
  • Strictly output-passive if
    D ς V ( t ) π ( t ) W ρ ( t ) π T ( t ) W 2 ρ ( t ) , t 0 .
where ς ( 0 , 1 ) , W R k × n , 0 < W 1 R n × n , 0 < W 2 R k × k , ρ ( t ) and π ( t ) are the output and input of the system, respectively.
Lemma 1 
([22]). Let ξ ( t ) be a continuous and differentiable vector-valued function and P R n × n be a positive definite matrix; then, we have
D ς [ ξ T ( t ) P ξ ( t ) ] 2 ξ T ( t ) P D ς ξ ( t ) .
Lemma 2 
([26]). If ϑ > 0 , as a given positive scalar, and A , C R n and matrix B with suitable dimension, then
2 A T B C = ϑ 1 A T B B T A + ϑ C T C .
Lemma 3 
([26]). Let M = M 11 M 12 M 22 be a given matrix with M 11 = M 11 T   a n d   M 22 = M 22 T , and the following conditions are equivalent:
1. 
M < 0 ,
2. 
M 11 < 0 , M 22 M 12 T M 11 1 M 12 < 0 ,
3. 
M 22 < 0 , M 11 M 12 M 22 1 M 12 T < 0 .

3. Problem Formulation

Consider fractional-order delayed and non-delayed complex dynamical networks composed of N numbers of nodes, where the n-dimensional subsystem can be given by
D ς μ u ( t ) = A μ u ( t ) + B F ( μ u ( t ) ) + C F ( μ u ( t κ ) ) + a 1 v = 1 K g u v Δ 1 μ v ( t ) + a 2 v = 1 K h u v Δ 2 μ v ( t κ ) + E ρ u ( t ) .
where D ς denotes the Caputo derivative operator. ς ( 0 , 1 ) . μ u ( t ) = { μ u 1 ( t ) , μ u 2 ( t ) , ,   μ u n ( t ) } R n represents the state vector of the u t h node. A, B and C denote the weight connection matrices of the state vector. F ( μ u ( t ) = { F 1 ( μ u 1 ( t ) ) , F 2 ( μ u 2 ( t ) ) , , F n ( μ u n ( t ) ) } and F ( μ u ( t κ ) = { F 1 ( μ u 1 ( t κ ) ) , F 2 ( μ u 2 ( t κ ) ) , , F n ( μ u n ( t κ ) ) } denotes the non-linear function, which describes the dynamical behavior of the network, and it satisfies the Lipschitz condition. a 1 and a 2 represent the coupling strength of the delayed and non-delayed connection matrices. Δ 1 and Δ 2 denote the inner coupling matrices. ρ ( t ) denotes the external input vector. The outer coupling matrix can be represented by
g u v = g u v > 0 , if t h e r e a l i n k b e t w e e n n o d e u a n d v ; m = 1 , m u K g u m , if u = v 0 , otherwise .
h u v = h u v > 0 , if t h e r e a l i n k b e t w e e n n o d e u a n d v ; m = 1 , m u K h u m , if u = v 0 , otherwise .
Now, let μ ¯ ( t ) = 1 K m = 1 K D ς μ m ( t )
D ς μ ¯ ( t ) = 1 K m = 1 K D ς μ m ( t ) = 1 K m = 1 K A μ u ( t ) + 1 K m = 1 K B F ( μ m ( t ) ) + 1 K m = 1 K C F ( μ m ( t κ ) ) + 1 K v = 1 K a 1 ( m = 1 K g m v ) Δ 1 μ v ( t ) + 1 K v = 1 K a 2 ( m = 1 K h m v ) Δ 2 μ v ( t κ ) + 1 K m = 1 K E ρ m ( t )
D ς μ ¯ ( t ) = 1 K m = 1 K A μ u ( t ) + 1 K m = 1 K B F ( μ m ( t ) ) + 1 K m = 1 K C F ( μ m ( t κ ) ) + 1 K m = 1 K E ρ m ( t ) .
Consider the error vector as ξ u ( t ) = { ξ u 1 ( t ) , ξ u 2 ( t ) , , ξ u n ( t ) } R n , and ξ u ( t ) = μ u ( t ) μ ¯ ( t ) ; then, we can write the error system as
D ς ξ u ( t ) = A ξ u ( t ) + B F ( μ u ( t ) ) 1 K m = 1 K B F ( μ m ( t ) ) + C F ( μ u ( t κ ) ) 1 K m = 1 K C F ( μ m ( t κ ) ) + E ρ u ( t ) 1 K m = 1 K E ρ m ( t ) + a 1 v = 1 K g u v Δ 1 ξ v ( t ) + a 2 v = 1 K h u v Δ 2 ξ v ( t κ ) .
where
ϕ ( ξ u ( t ) ) = F ( μ u ( t ) ) 1 K m = 1 K F ( μ m ( t ) ) ψ ( ξ u ( t κ ) ) = F ( μ u ( t κ ) ) 1 K m = 1 K F ( μ m ( t κ ) ) .
Then, the above equation can be written as
D ς ξ u ( t ) = A ξ u ( t ) + B ϕ ( ξ u ( t ) ) + C ψ ( ξ u ( t κ ) ) + E ρ u ( t ) 1 K m = 1 K E ρ m ( t ) + a 1 v = 1 K g u v Δ 1 ξ v ( t ) + a 2 v = 1 K h u v Δ 2 ξ v ( t κ ) .
Let π u ( t ) R s , ( 1 s < n ) , where Z 1 , Z 2 , Z 3 R s × n are the output vectors for the considered system, and it is in the form given by
π u ( t ) = Z 1 ξ u ( t ) + Z 2 ξ u ( t κ ) + Z 3 ρ u ( t ) .
Let us denote
ξ ( t ) = ( ξ 1 T ( t ) , ξ 2 T ( t ) , , ξ K T ( t ) ) ξ ( t κ ) = ( ξ 1 T ( t κ , ξ 2 T ( t κ ) , , ξ K T ( t κ ) π ( t ) = ( π 1 T ( t ) , π 2 T ( t ) , , π K T ( t ) ) ρ ( t ) = ( ρ 1 T ( t ) , ρ 2 T ( t ) , , ρ K T ( t ) )
By using the Kronecker product, the following error system (2) can be written in vector form as
D ς ξ ( t ) = ( I k A ) ξ ( t ) + ( I k B ) ϕ ( ξ ( t ) ) + ( I k C ) ψ ( ξ ( t κ ) ) + ( I k E ) ρ ( t ) 1 K ( I k E ) m = 1 K ρ m ( t ) + a 1 ( G Δ 1 ) ξ ( t ) + a 2 ( H Δ 2 ) ξ ( t κ ) .
The upcoming assumptions are very useful to prove our theoretical results.
Hypothesis 1. 
Let us assume that there exists a constant N > 0 , for a nonlinear function ξ ( μ ( t ) ) , such that, for μ 1 and μ 2 ,
| ξ ( μ 1 ( t ) ) ξ ( μ 2 ( t ) ) | N | μ 1 ( t ) μ 2 ( t ) | .

4. Passivity Analysis of Fractional-Order Complex Dynamical Networks

In this section, we investigate the passivity analysis for FOCDN and some sufficient conditions are derived.
Theorem 1. 
Let Assumption H1 hold. If there exists a positive definite matrix 0 < P R n × n , W R s K × n K , such that
Ω 1 Ω 2 Π 1 Ω 2 T Ω 3 Π 2 Π 1 T Π 2 T Ω 4 0 ,
where  Ω 1 = I K ( P A + A P ) + I K ( P B J 1 1 B T P ) + ( I K N 1 J 1 N 1 ) + I K ( P C J 2 1 C T P ) + a 1 ( G P Δ 1 ) + a 1 ( G T P Δ 1 T ) : Ω 2 = a 2 [ H P Δ 2 ] ; Ω 3 = ( I K N 2 J 2 N 2 ) Ω 4 = ( I N Z 3 T ) W + W T ( I K Z 3 ) 2 ; Π 1 = ( I k P E ) 1 2 ( I K Z 1 ) W ; Π 2 = 1 2 ( I K Z 2 ) W , then the FOCDN (4) is passive.
Proof. 
Let us define the Lyapunov function by
V ( t ) = ξ T ( t ) ( I K P ) ξ ( t ) .
Now, by using Lemma (1) in system (7) along with system (4), we obtain
D ς V ( t ) = 2 ξ T ( t ) ( I K P ) D ς ξ ( t )
D ς V ( t ) = 2 ξ T ( t ) ( I K P ) [ ( I k A ) ξ ( t ) + ( I k B ) ϕ ( ξ ( t ) ) + ( I k C ) ψ ( ξ ( t κ ) ) + ( I k E ) ρ ( t ) 1 K ( I k E ) m = 1 K ρ m ( t ) + a 1 ( G Δ 1 ) ξ ( t ) + a 2 ( H Δ 2 ) ξ ( t κ ) ] .
We know that
u = 1 K ξ u ( t ) = u = 1 K ( μ u ( t ) 1 K m = 1 K μ m ( t ) ) = u = 1 K μ u ( t ) m = 1 K μ m ( t ) = 0 .
Therefore,
u = 1 K ξ u T ( t ) ( I K P ) ( 1 K ( I k E ) m = 1 K ρ m ( t ) ) = 0
D ς V ( t ) = 2 ξ ( t ) ( I K P ) { ( I k A ) ξ ( t ) + ( I k B ) ϕ ( ξ ( t ) ) + ( I k C ) ψ ( ξ ( t κ ) ) + ( I k E ) ρ ( t ) + a 1 ( G Δ 1 ) ξ ( t ) + a 2 ( H Δ 2 ) ξ ( t κ ) } = 2 ξ T ( t ) ( I K P A ) ξ ( t ) + 2 ξ T ( t ) ( I k P B ) ϕ ( ξ ( t ) ) + 2 ξ T ( t ) ( I k C ) ψ ( ξ ( t κ ) ) + 2 ξ T ( t ) ( I k P E ) ρ ( t ) + 2 ξ T ( t ) a 1 ( G ( P Δ 1 ) ) ξ ( t ) + 2 ξ T ( t ) a 2 ( H ( P Δ 2 ) ) ξ ( t κ ) .
By applying Assumption H1 and Lemma (2), the following equation can be deduced:
2 ξ T ( t ) ( I k P B ) ϕ ( ξ ( t ) ) ξ T ( t ) ( I K ( P B ) ) ( I K J 1 ) 1 ( I K ( P B ) T ) ξ ( t ) + ϕ T ( ξ ( t ) ) ( I K J 1 ) ϕ ( ξ ( t ) ) = ξ T ( t ) { I K ( P B J 1 1 B T P ) + ( I K N 1 J 1 N 1 ) } ξ ( t ) 2 ξ T ( t ) ( I k P C ) ψ ( ξ ( t κ ) ) ξ T ( t ) ( I K ( P C ) ) ( I K J 2 ) 1 ( I K ( P C ) T ) ξ ( t ) + ψ T ( ξ ( t κ ) ) × ( I K J 2 ) ψ ( ξ ( t κ ) )
2 ξ T ( t ) ( I k P C ) ψ ( ξ ( t κ ) ) ξ T ( t ) { I K ( P C J 2 1 C T P ) } + ξ T ( t κ ) { I K ( N 2 J 2 N 2 ) } ξ ( t κ ) .
Combining the above Equations (8) and (9), we have
D ς V ( t ) = ξ T ( t ) { I K ( P A + A P ) + I K ( P B J 1 1 B T P ) + ( I K N 1 J 1 N 1 ) + I K ( P C J 2 1 C T P ) + a 1 ( G P Δ 1 ) + a 1 ( G T P Δ 1 T ) } + ξ T ( t κ ) ( I K N 2 J 2 N 2 ) ξ ( t κ ) + a 2 ξ T ( t ) [ H P Δ 2 ] ξ ( t κ ) + a 2 ξ T ( t κ ) [ H T Δ 2 T P ] ξ ( t ) + 2 ξ T ( t ) ( I k P E ) ρ ( t ) .
Now, by Definition 4, we can write
D ς V ( t ) π ( t ) W ρ ( t ) ξ T ( t ) { I K ( P A + A P ) + I K ( P B J 1 1 B T P ) + ( I K N 1 J 1 N 1 ) + I K ( P C J 2 1 C T P ) + a 1 ( G P Δ 1 ) + a 1 ( G T P Δ 1 T ) } + ξ T ( t κ ) ( I K N 2 J 2 N 2 ) ξ ( t κ ) + a 2 ξ T ( t ) [ H P Δ 2 ] ξ ( t κ ) + a 2 ξ T ( t κ ) × [ H T Δ 2 T P ] ξ ( t ) + 2 ξ T ( t ) ( I k P E ) ρ ( t ) Z 1 ξ u ( t ) + Z 2 ξ u ( t κ ) + Z 3 ρ u ( t ) W ρ ( t ) = ξ T ( t ) { I K ( P A + A P ) + I K ( P B J 1 1 B T P ) + ( I K N 1 J 1 N 1 ) + I K ( P C J 2 1 C T P ) + a 1 ( G P Δ 1 ) + a 1 ( G T P Δ 1 T ) } + ξ T ( t κ ) ( I K N 2 J 2 N 2 ) ξ ( t κ ) + a 2 ξ T ( t ) [ H P Δ 2 ] ξ ( t κ ) + a 2 ξ T ( t κ ) × [ H T Δ 2 T P ] ξ ( t ) + 2 ξ T ( t ) ( I k P E ) ρ ( t ) ( I K Z 1 ) ξ u ( t ) T W ρ ( t ) ( I K Z 2 ) ξ u T ( t κ ) W ρ ( t ) ( I K Z 3 ) ρ u T ( t ) W ρ ( t )
D ς V ( t ) π ( t ) W ρ ( t ) = ξ T ( t ) { I K ( P A + A P ) + I K ( P B J 1 1 B T P ) + ( I K N 1 J 1 N 1 ) + I K ( P C J 2 1 C T P ) + a 1 ( G P Δ 1 ) + a 1 ( G T P Δ 1 T ) } + ξ T ( t κ ) ( I K N 2 J 2 N 2 ) ξ ( t κ ) + a 2 ξ T ( t ) [ H P Δ 2 ] ξ ( t κ ) + a 2 ξ T ( t κ ) [ H T Δ 2 T P ] ξ ( t ) + 2 ξ T ( t ) ( I k P E ) ρ ( t ) 1 2 ( I K Z 1 ) ξ ( t ) T W ρ ( t ) 1 2 ( I K Z 1 ) ρ ( t ) T W ξ ( t ) 1 2 ( I K Z 2 ) ξ T ( t κ ) W ρ ( t ) 1 2 ( I K Z 2 ) ρ T W ξ ( t κ ) ρ T ( t ) ( I N Z 3 T ) W + W T ( I K Z 3 ) 2 ρ ( t )
D ς V ( t ) π ( t ) W ρ ( t ) = ζ T ( t ) Ω 1 Ω 2 Π 1 Ω 2 T Ω 3 Π 2 Π 1 T Π 2 T Ω 4 ζ T ( t ) .
By inequality (6) and by Definition 4, we can conclude that
π ( t ) W ρ ( t ) D ς V ( t ) .
Therefore, we conclude that the FOCDN (4) is passive. □
Remark 1. 
Previous work on the passivity of complex networks mainly deals with scenarios in which the input and output vectors have equal dimensions, whereas real-world problems often feature different dimensional vector values. Some of the existing works consider passivity in complex dynamical systems with different input and output dimensions, such as [16,17,18,22,23]. In this work, we analyze the passivity of a fractional-order complex dynamical network with different input and output dimensions with internal and constant coupling delays for the first time in the literature. In the upcoming theorems, we show that the fractional-order complex dynamical network is strictly input- and strictly output-passive.
Theorem 2. 
Let Assumption H1 hold. If there exists a positive definite matrix 0 < P R n × n , W R s K × n K W 1 R n K × n K such that
Ω 5 Ω 6 Π 3 Ω 6 T Ω 7 Π 4 Π 3 T Π 4 T Ω 8 0 ,
where Ω 5 = I K ( P A + A P ) + I K ( P B J 1 1 B T P ) + ( I K N 1 J 1 N 1 ) + I K ( P C J 2 1 C T P ) + a 1 ( G P Δ 1 ) + a 1 ( G T P Δ 1 T ) : Ω 6 = a 2 [ H P Δ 2 ] ; Ω 7 = ( I K N 2 J 2 N 2 ) Ω 8 = W 1 ( I N Z 3 T ) W + W T ( I K Z 3 ) 2 ; Π 3 = ( I k P E ) 1 2 ( I K Z 1 ) W ; Π 4 = 1 2 ( I K Z 2 ) W , then the FOCDN (4) is input strictly passive (ISP).
Proof. 
By (10), one obtains
D ς V ( t ) π ( t ) W ρ ( t ) + ρ T ( t ) W 1 ρ ( t ) ξ T ( t ) { I K ( P A + A P ) + I K ( P B J 1 1 B T P ) + ( I K N 1 J 1 N 1 ) + I K ( P C J 2 1 C T P ) + a 1 ( G P Δ 1 ) + a 1 ( G T P Δ 1 T ) } + ξ T ( t κ ) ( I K N 2 J 2 N 2 ) ξ ( t κ ) + a 2 ξ T ( t ) [ H P Δ 2 ] ξ ( t κ ) + a 2 ξ T ( t κ ) × [ H T Δ 2 T P ] ξ ( t ) + 2 ξ T ( t ) ( I k P E ) ρ ( t ) { Z 1 ξ u ( t ) + Z 2 ξ u ( t κ ) + Z 3 ρ u ( t ) } W ρ ( t ) + ρ T ( t ) W 1 ρ ( t )
D ς V ( t ) π ( t ) W ρ ( t ) + ρ T ( t ) W 1 ρ ( t ) ξ T ( t ) { I K ( P A + A P ) + I K ( P B J 1 1 B T P ) + ( I K N 1 J 1 N 1 ) + I K ( P C J 2 1 C T P ) + a 1 ( G P Δ 1 ) + a 1 ( G T P Δ 1 T ) } + ξ T ( t κ ) ( I K N 2 J 2 N 2 ) ξ ( t κ ) + a 2 ξ T ( t ) [ H P Δ 2 ] ξ ( t κ ) + a 2 ξ T ( t κ ) [ H T Δ 2 T P ] ξ ( t ) + 2 ξ T ( t ) ( I k P E ) ρ ( t ) 1 2 ( I K Z 1 ) ξ ( t ) T W ρ ( t ) 1 2 ( I K Z 1 ) ρ ( t ) T W ξ ( t ) 1 2 ( I K Z 2 ) ξ T ( t κ ) W ρ ( t ) 1 2 ( I K Z 2 ) ρ T W ξ ( t κ ) ρ T ( t ) ( I N Z 3 T ) W + W T ( I K Z 3 ) 2 ρ ( t ) + ρ T ( t ) W 1 ρ ( t )
D ς V ( t ) π ( t ) W ρ ( t ) + ρ T ( t ) W 1 ρ ( t ) = ζ T ( t ) Ω 5 Ω 6 Π 3 Ω 6 T Ω 7 Π 4 Π 3 T Π 4 T Ω 8 ζ T ( t ) .
By inequality (12) and by Definition 4, one has
π ( t ) W ρ ( t ) ρ T ( t ) W 1 ρ ( t ) D ς V ( t ) .
Therefore, we conclude that the FOCDN (4) is input strictly passive (ISP). □
Theorem 3. 
The FOCDN (4) is said to be output strictly passive (OSP) if there exists a positive definite matrix 0 < P R n × n , W 2 R s K × s K , such that
Ω 9 Ω 10 Π 5 Ω 10 T Ω 11 Π 6 Π 5 T Π 6 T Ω 12 0 ,
where  Ω 9 = I K ( P A + A P ) + I K ( P B J 1 1 B T P ) + ( I K N 1 J 1 N 1 ) + I K ( P C J 2 1 C T P ) + a 1 ( G P Δ 1 ) + a 1 ( G T P Δ 1 T ) + [ I K Z 1 T ] W 2 [ I K Z 1 ] : Ω 10 = a 2 [ H P Δ 2 ] + [ I K Z 1 T ] W 2 [ I K Z 2 ] ; Ω 11 = ( I K N 2 J 2 N 2 ) + [ I K Z 2 T ] W 2 [ I K Z 2 ] ; Ω 12 = ( I N Z 3 T ) W + W T ( I K Z 3 ) 2 + [ I K Z 3 T ] W 2 [ I K Z 3 ] ; π 5 = ( I k P E ) 1 2 ( I K Z 1 ) W + [ I K Z 1 T ] W 2 [ I K Z 3 ] ; Π 6 = 1 2 ( I K Z 2 ) W + [ I K Z 2 T ] W 2 [ I K Z 3 ] .
Proof. 
By (10), one obtains
D ς V ( t ) π T ( t ) W ρ ( t ) + π T ( t ) W 2 π ( t ) ξ T ( t ) { I K ( P A + A P ) + I K ( P B J 1 1 B T P ) + ( I K N 1 J 1 N 1 ) + I K ( P C J 2 1 C T P ) + a 1 ( G P Δ 1 ) + a 1 ( G T P Δ 1 T ) } + ξ T ( t κ ) ( I K N 2 J 2 N 2 ) ξ ( t κ ) + a 2 ξ T ( t ) [ H P Δ 2 ] ξ ( t κ ) + a 2 ξ T ( t κ ) [ H T Δ 2 T P ] ξ ( t ) + 2 ξ T ( t ) ( I k P E ) ρ ( t ) { Z 1 ξ u ( t ) + Z 2 ξ u ( t κ ) + Z 3 ρ u ( t ) } W ρ ( t ) + π T ( t ) W 2 π ( t )
D ς V ( t ) π T ( t ) W ρ ( t ) + π T ( t ) W 2 π ( t )
ξ T ( t ) { I K ( P A + A P ) + I K ( P B J 1 1 B T P ) + ( I K N 1 J 1 N 1 ) + I K ( P C J 2 1 C T P ) + a 1 ( G P Δ 1 ) + a 1 ( G T P Δ 1 T ) } + ξ T ( t κ ) ( I K N 2 J 2 N 2 ) ξ ( t κ ) + a 2 ξ T ( t ) [ H P Δ 2 ] ξ ( t κ ) + a 2 ξ T ( t κ ) [ H T Δ 2 T P ] ξ ( t ) + 2 ξ T ( t ) ( I k P E ) ρ ( t ) 1 2 ( I K Z 1 ) ξ ( t ) T W ρ ( t ) 1 2 ( I K Z 1 ) ρ ( t ) T W ξ ( t ) 1 2 ( I K Z 2 ) ξ T ( t κ ) W ρ ( t ) 1 2 ( I K Z 2 ) ρ T W ξ ( t κ ) ρ T ( t ) ( I N Z 3 T ) W + W T ( I K Z 3 ) 2 ρ ( t ) + ξ T ( t ) [ I K Z 1 T ] W 2 [ I K Z 1 ] ξ ( t ) + ξ T ( t ) [ I K Z 1 T ] W 2 [ I K Z 2 ] ξ ( t κ ) + ξ T ( t ) [ I K Z 1 T ] W 2 [ I K Z 3 ] ρ ( t ) + ξ T ( t κ ) [ I K Z 2 T ] W 2 [ I K Z 1 ] ξ ( t ) + ξ T ( t κ ) [ I K Z 2 T ] W 2 [ I K Z 2 ] ξ ( t κ ) + ξ T ( t κ ) [ I K Z 2 T ] × W 2 [ I K Z 3 ] ρ ( t ) + ρ T ( t ) [ I K Z 3 T ] W 2 [ I K Z 1 ] ξ ( t ) + ρ T ( t ) [ I K Z 3 T ] W 2 [ I K Z 2 ] ξ ( t κ ) + ρ T ( t ) [ I K Z 3 T ] W 2 [ I K Z 3 ] ρ ( t )
D ς V ( t ) π ( t ) W ρ ( t ) + ρ T ( t ) W 1 ρ ( t ) = ζ T ( t ) Ω 9 Ω 10 Π 5 Ω 10 T Ω 11 Π 6 Π 5 T Π 6 T Ω 12 ζ T ( t ) .
By inequality (14) and by Definition 4, we can write
π ( t ) W ρ ( t ) π T ( t ) W 2 ρ ( t ) D ς V ( t ) .
Therefore, we conclude that the FOCDN (4) is output strictly passive (OSP). □

5. Asymptotic Synchronization Analysis of Fractional-Order Complex Dynamical Networks with Derivative Couplings and Parameter Uncertainties

In this section, we study and discuss the asymptotic synchronization for fractional-order complex dynamical networks with time-varying delays via a state feedback controller, letting ρ ( t ) = 0 . Consider the fractional-order delayed and non-delayed complex dynamical networks with derivative couplings composed of N numbers of nodes, where the n-dimensional subsystem can be given by
D ς μ u ( t ) = A μ u ( t ) + B F ( μ u ( t ) ) + C F ( μ u ( t κ ) ) + a 1 v = 1 K g u v Δ 1 D ς μ v ( t ) + a 2 v = 1 K h u v Δ 2 D ς μ v ( t κ ) + E ρ u ( t ) .
Letting ρ ( t ) = 0 , we have μ ¯ ( t ) = 1 K m = 1 K D ς μ m ( t )
D ς μ ¯ ( t ) = 1 K m = 1 K D ς μ m ( t ) = 1 K m = 1 K A μ u ( t ) + 1 K m = 1 K B F ( μ m ( t ) ) + 1 K m = 1 K C F ( μ m ( t κ ) ) + 1 K v = 1 K a 1 ( m = 1 K g m v ) Δ 1 D ς μ v ( t ) + 1 K v = 1 K a 2 ( m = 1 K h m v ) Δ 2 D ς μ v ( t κ ) .
Consider the error vector as ξ u ( t ) = { ξ u 1 ( t ) , ξ u 2 ( t ) , , ξ u n ( t ) } R n , and ξ u ( t ) = μ u ( t ) μ ¯ ( t ) , and we can write the error system as
D ς ξ u ( t ) = A ξ u ( t ) + B ϕ ( ξ u ( t ) ) + C ψ ( ξ u ( t κ ) ) + a 1 v = 1 K g u v Δ 1 D ς ξ v ( t ) + a 2 v = 1 K h u v Δ 2 D ς ξ v ( t κ ) .
Then, the controlled error system can be given by
D ς ξ u ( t ) = A ξ u ( t ) + B ϕ ( ξ u ( t ) ) + C ψ ( ξ u ( t κ ) ) + a 1 v = 1 K g u v Δ 1 D ς ξ v ( t ) + a 2 v = 1 K h u v Δ 2 D ς ξ v ( t κ ) + U u ( t ) .
The above equation can be written in vector form as
D ς ξ ( t ) = ( I k A ) ξ ( t ) + ( I k B ) ϕ ( ξ ( t ) ) + ( I k C ) ψ ( ξ ( t κ ) ) + a 1 ( G Δ 1 ) D ς ξ ( t ) + a 2 ( H Δ 2 ) D ς ξ ( t κ ) + U ( t ) .
The time-varying uncertainty parameter can be described in the form Δ A ( t ) , Δ B ( t ) , Δ C ( t ) , satisfying the following conditions:
Δ A ( t ) = T a Q ( t ) S a , Δ B ( t ) = T b Q ( t ) S b , Δ C ( t ) = T c Q ( t ) S c .
where T, S a S b S c are known matrices, and Q ( t ) is an unknown time-varying matrix, satisfying Q T ( t ) Q ( t ) I .
Now, the system can be written after injecting the time-varying parameter uncertainties, and we obtain
D ς ξ ( t ) = ( I k A ) ξ ( t ) + ( I k Δ A ) ξ ( t ) + ( I k B ) ϕ ( ξ ( t ) ) + ( I k Δ B ) ϕ ( ξ ( t ) ) + ( I k C ) ψ ( ξ ( t κ ) ) + ( I k Δ C ) ψ ( ξ ( t κ ) ) + a 1 ( G Ξ 1 ) D ς ξ ( t ) + a 2 ( H Ξ 2 ) D ς ξ ( t κ ) + U ( t ) .
Theorem 4. 
If Assumption 1 holds, suppose that there exist positive definite matrices Φ and N and scalars ϑ 1 , ϑ 2 , α 1 , α 2 and α 3 and positive constant k * > 0 such that the following conditions are satisfied:
U ( t ) = K ^ ξ ( t ) a 2 ( H Ξ 2 ) D ς ξ ( t κ ) Ψ 1 = Ψ 2 + ϑ 1 1 + ( I K ( Φ B B T Φ T ) ) + ϑ 2 1 ( I K ( Φ C C T Φ T ) ) + α 1 1 ( I k Φ T 1 T 1 T Φ 1 T ) + α 2 1 ( I k Φ T 2 T 2 T Φ T ) + α 3 1 ( I k Φ T 3 T 3 T Φ T ) < 0 ,
where D ς K ^ = r 1 ξ T ( t ) ξ ( t ) , Ψ 2 = I K ( Φ A + Φ A ) ) + ϑ 1 ( I k N T N ) + α 1 ( I k S 1 T S 1 ) + α 2 ( I k N T S 2 T S 2 N ) 2 ( I k K * ) . Then, the error dynamical system (19) is globally completely synchronized based on the adaptive controller and laws.
Proof. 
According to the error system (19), the Lyapunov function be chosen as
V ( t ) = ξ T ( t ) ( I K Φ ) ξ ( t ) + 1 Γ ( ς ) t κ 0 ( t κ χ ) ξ T ( s ) ( I K N ) ξ ( s ) d s + 1 r 1 ( K ^ K * ) 2 ( I K Φ ) a 1 ( G Ξ 1 ) ( I K Φ ) ξ T ( t ) ξ ( t ) .
Taking the Lyapnouv derivative for (20), we obtain
D ς V ( t ) = 2 ξ T ( t ) ( I K Φ ) D ς ξ ( t ) + ξ T ( t κ ) ( I k N ) ξ ( t κ ) + 2 r 1 ( K ^ K * ) ( I K Φ ) D ς K ^ 2 a 1 ( G Ξ 1 Φ ) ξ T ( t ) D ς ξ ( t )
D ς V ( t ) = 2 ξ T ( t ) ( I K Φ ) { ( I k A ) ξ ( t ) + ( I k Δ A ) ξ ( t ) + ( I k B ) ϕ ( ξ ( t ) ) + ( I k Δ B ) ϕ ( ξ ( t ) ) + ( I k C ) ψ ( ξ ( t κ ) ) + ( I k Δ C ) ψ ( ξ ( t κ ) ) + a 1 ( G Ξ 1 ) D ς ξ ( t ) + a 2 ( H Ξ 2 ) D ς ξ ( t κ ) + U ( t ) } + 2 r 1 ( K ^ K * ) ( I K Φ ) D ς K ^ 2 a 1 ( G Ξ 1 Φ ) ξ T ( t ) D ς ξ ( t ) ξ T ( t κ ) ( I k N ) ξ ( t κ ) D ς V ( t ) = 2 ξ T ( t ) ( I K Φ ) { ( ( I k A ) ξ ( t ) + ( I k Δ A ) ξ ( t ) + ( I k B ) ϕ ( ξ ( t ) ) + ( I k Δ B ) ϕ ( ξ ( t ) ) + ( I k C ) ψ ( ξ ( t κ ) ) + ( I k Δ C ) ψ ( ξ ( t κ ) ) + a 1 ( G Ξ 1 ) D ς ξ ( t ) + a 2 ( H Ξ 2 ) D ς ξ ( t κ ) K ^ ξ ( t ) a 2 ( H Ξ 2 ) D ς ξ ( t κ ) } + 2 r 1 ( K ^ K * ) ( I K Φ ) D ς K ^ 2 a 1 ( G Ξ 1 Φ ) ξ T ( t ) D ς ξ ( t ) ξ T ( t κ ) ( I k N ) ξ ( t κ )
D ς V ( t ) = 2 ξ T ( t ) ( I K Φ ) { ( ( ( I k A ) ξ ( t ) + ( I k Δ A ) ξ ( t ) + ( I k B ) ϕ ( ξ ( t ) ) + ( I k Δ B ) ϕ ( ξ ( t ) ) + ( I k C ) ψ ( ξ ( t κ ) ) + ( I k Δ C ) ψ ( ξ ( t κ ) ) + a 1 ( G Ξ 1 ) D ς ξ ( t ) K ^ ξ ( t ) } + 2 r 1 ( K ^ K * ) ( I K Φ ) D ς K ^ 2 a 1 ( G Ξ 1 Φ ) ξ T ( t ) D ς ξ ( t ) ξ T ( t κ ) ( I k N ) ξ ( t κ ) D ς V ( t ) = 2 ξ T ( t ) ( I K Φ A ) ξ ( t ) + 2 ξ T ( t ) ( I K Φ Δ A ) + 2 ξ T ( t ) ( I k Φ B ) ϕ ( ξ ( t ) ) + 2 ξ T ( t ) ( I k Φ Δ B ) ϕ ( ξ ( t ) ) + 2 ξ T ( t ) ( I k Φ C ) ψ ( ξ ( t κ ) ) + 2 ξ T ( t ) ( I k Φ Δ C ) ψ ( ξ ( t κ ) + 2 ξ T ( t ) a 1 ( G Ξ 1 Φ ) D ς ξ ( t ) + 2 ξ T ( t ) a 2 ( H Ξ 2 Φ ) D ς ξ ( t κ ) 2 K ^ ξ T ( t ) ξ ( t ) 2 ξ T ( t ) a 2 ( H Ξ 2 Φ ) D ς ξ ( t κ ) + 2 r 1 ( K ^ K * ) ( I K Φ ) D ς K ^ 2 a 1 ( G Ξ 1 Φ ) ξ T ( t ) D ς ξ ( t ) ξ T ( t κ ) ( I k N ) ξ ( t κ )
D ς V ( t ) = 2 ξ T ( t ) ( I K Φ A ) ξ ( t ) + 2 ξ T ( t ) ( I K Φ Δ A ) ξ ( t ) + 2 ξ T ( t ) ( I k Φ B ) ϕ ( ξ ( t ) ) + 2 ξ T ( t ) ( I k Φ Δ B ) ϕ ( ξ ( t ) ) + 2 ξ T ( t ) ( I k Φ C ) ψ ( ξ ( t κ ) ) + 2 ξ T ( t ) ( I k Φ Δ C ) ψ ( ξ ( t κ ) 2 ( I k K * ) ξ T ( t ) ξ ( t ) ξ T ( t κ ) ( I k N ) ξ ( t κ ) .
By applying Assumption (5) and Lemma (2), we have
2 ξ ( t ) ( I K Φ B ) ϕ ( ξ ( t ) ) = ϑ 1 1 ξ T ( t ) { I K ( Φ B B T Φ T ) } + ϑ 1 ξ T ( t ) { ( I k N T N ) } ξ ( t )
2 ξ T ( t ) ( I k Φ C ) ψ ( ξ ( t κ ) ) ϑ 2 1 ξ T ( t ) { I K ( Φ C C T Φ T ) } ξ ( t ) + ξ T ( t κ ) { I k N T N } ξ ( t κ )
2 ξ T ( t ) ( I K Φ Δ A ) ξ ( t ) 2 ξ T ( t ) ( I k T 1 Q ( t ) S 1 ) ξ ( t ) = α 1 1 ( I k Φ T 1 T 1 T Φ 1 T ) ξ ( t ) + α 1 ξ T ( t ) ( I k S 1 T S 1 ) ξ ( t )
2 ξ T ( t ) ( I k Φ Δ B ) ϕ ( ξ ( t ) ) 2 ξ T ( t ) ( I k Φ T 2 Q ( t ) S 2 ) ϕ ( ξ ( t ) ) = α 2 1 ( I k Φ T 2 T 2 T Φ T ) ξ ( t ) + α 2 ξ T ( t ) ( I k N T S 2 T S 2 N ) ξ ( t )
2 ξ T ( t ) ( I k Φ Δ C ) ψ ( ξ ( t κ ) ) 2 ξ T ( t ) ( I k Φ T 3 Q ( t ) S 3 ) ψ ( ξ ( t κ ) ) = α 3 1 ( I k Φ T 3 T 3 T Φ T ) ξ ( t ) + α 3 ξ T ( t κ ) ( I k N T S 3 T S 3 N ) ξ ( t κ ) .
Combining Equations (21)–(26), we obtain
D ς V ( t ) ξ T ( t ) ( I K ( Φ A + Φ A ) ) ξ ( t ) + ϑ 1 1 ξ T ( t ) { I K ( Φ B B T Φ T ) + ϑ 1 ( I k N T N ) } ξ ( t ) + ϑ 2 1 ξ T ( t ) { I K ( Φ C C T Φ T ) } ξ ( t ) + ξ T ( t κ ) { I k N T N } ξ ( t κ ) + α 1 1 ( I k Φ T 1 T 1 T Φ 1 T ) ξ ( t ) + α 1 ξ T ( t ) ( I k S 1 T S 1 ) ξ ( t ) + α 2 1 ( I k Φ T 2 T 2 T Φ T ) ξ ( t ) + α 2 ξ T ( t ) ( I k N T S 2 T S 2 N ) ξ ( t ) + α 3 1 ( I k Φ T 3 T 3 T Φ T ) ξ ( t ) + α 3 ξ T ( t κ ) ( I k N T S 3 T S 3 N ) ξ ( t κ ) 2 ( I k K * ) ξ T ( t ) ξ ( t ) ξ T ( t κ ) ( I k N ) ξ ( t κ )
D ς V ( t ) ξ T ( t ) ( I K ( Φ A + Φ A ) ) ξ ( t ) + ϑ 1 1 ξ T ( t ) { I K ( Φ B B T Φ T ) + ϑ 1 ( I k N T N ) } ξ ( t ) + ϑ 2 1 ξ T ( t ) { I K ( Φ C C T Φ T ) } ξ ( t ) + α 1 1 ( I k Φ T 1 T 1 T Φ 1 T ) ξ ( t ) + α 1 ξ T ( t ) ( I k S 1 T S 1 ) ξ ( t ) + α 2 1 ( I k Φ T 2 T 2 T Φ T ) ξ ( t ) + α 2 ξ T ( t ) ( I k N T S 2 T S 2 N ) ξ ( t ) + α 3 1 ( I k Φ T 3 T 3 T Φ T ) ξ ( t ) 2 ( I k K * ) ξ T ( t ) ξ ( t ) + α 3 ξ T ( t κ ) ( I k N T S 3 T S 3 N ) ξ ( t κ ) + ξ T ( t κ ) { I k N T N } ξ ( t κ ) ξ T ( t κ ) ( I k N ) ξ ( t κ )
D ς V ( t ) ξ T ( t ) { ( I K ( Φ A + Φ A ) ) + ϑ 1 1 + ( I K ( Φ B B T Φ T ) ) + ϑ 1 ( I k N T N ) + ϑ 2 1 ( I K ( Φ C C T Φ T ) ) + α 1 1 ( I k Φ T 1 T 1 T Φ 1 T ) + α 1 ( I k S 1 T S 1 ) + α 2 1 ( I k Φ T 2 T 2 T Φ T ) + α 2 ( I k N T S 2 T S 2 N ) + α 3 1 ( I k Φ T 3 T 3 T Φ T ) 2 ( I k K * ) } ξ ( t ) + α 3 ξ T ( t κ ) ( I k N T S 3 T S 3 N ) ξ ( t κ ) + ξ T ( t κ ) { I k N T N } ξ ( t κ ) ξ T ( t κ ) ( I k N ) ξ ( t κ )
D ς V ( t ) ξ T ( t ) Ψ 1 ξ ( t ) + ξ T ( t κ ) α 3 ( I k N T S 3 T S 3 N ) + ( I k N T N ) N ) ξ ( t κ ) .
Now, letting N = α 3 ( I k N T S 3 T S 3 N ) + ( I k N T N ), the following equation becomes
D ς V ( t ) ξ T ( t ) Ψ 1 ξ ( t )
where
Ψ 1 = I K ( Φ A + Φ A ) ) + ϑ 1 1 + ( I K ( Φ B B T Φ T ) ) + ϑ 1 ( I k N T N ) + ϑ 2 1 ( I K ( Φ C C T Φ T ) ) + α 1 1 ( I k Φ T 1 T 1 T Φ 1 T ) + α 1 ( I k S 1 T S 1 ) + α 2 1 ( I k Φ T 2 T 2 T Φ T ) + α 2 ( I k N T S 2 T S 2 N ) + α 3 1 ( I k Φ T 3 T 3 T Φ T ) 2 ( I k K * )
The above inequality can be written as
Ψ 1 = Ψ 2 + ϑ 1 1 + ( I K ( Φ B B T Φ T ) ) + ϑ 2 1 ( I K ( Φ C C T Φ T ) ) + α 1 1 ( I k Φ T 1 T 1 T Φ 1 T ) + α 2 1 ( I k Φ T 2 T 2 T Φ T ) + α 3 1 ( I k Φ T 3 T 3 T Φ T ) .
where Ψ 2 = I K ( Φ A + Φ A ) ) + ϑ 1 ( I k N T N ) + α 1 ( I k S 1 T S 1 ) + α 2 ( I k N T S 2 T S 2 N ) 2 ( I k K * ) . By virtue of Lemma (3), the above inequality can be written in LMI form as
Ψ 1 Φ B Φ C Φ T 1 Φ T 2 Φ T 3 ϑ 1 I 0 0 0 0 0 ϑ 2 I 0 0 0 0 0 α 1 I 0 0 0 0 0 α 2 I 0 0 0 0 0 α 3 I < 0 .
Based on the above inequality and Lyapunov stability theory, the fractional-order complex dynamical network with derivative couplings is synchronized asymptotically when the LMI condition (28) holds under the adaptive controller and laws. This completes the proof. □

6. Numerical Simulation

In this section, to validate our theoretical results, we provide numerical simulations with uncertainty. Consider the following complex dynamical network with derivative couplings given by
D ς μ u ( t ) = ( A + Δ A ) μ u ( t ) + ( B + Δ B ) F ( μ u ( t ) ) + ( C + Δ C ) F ( μ u ( t κ ) ) + a 1 v = 1 K g u v Δ 1 D ς μ v ( t ) + a 2 v = 1 K h u v Δ 2 D ς μ v ( t κ ) + E ρ u ( t ) .
Here, u = 1 , 2 , 3 . ς = 0.98 a 1 = 0.02 , a 2 = 0.03 ; F ( μ u ( t ) ) = t a n h ( μ u ( t ) ) , κ = 0.52 . The state matrices A, B and C are given by
A = 40.830 0 35.12 B = 13.45 0 0 13.54 C = 10.53 0 0 15.15
The inner and outer coupling matrices are given by
G = 1 1 0 1 2 1 0 1 1 H = 2 1 1 1 3 4 1 4 3 Δ 1 = 0.35 0 0.35 Δ 2 = 0.45 0 0.45
T1 = [0.25 0; 0 0.25]; T2 = [0.35 0; 0 0.35]; T3 = [0.5 0; 0 0.5]; S1 = [0.13 0; 0 0.13]; S2 = [0.21 0; 0 0.21];
T 1 = 0.25 0 0 0.25 T 2 = 0.35 0 0 0.35 T 3 = 0.50 0 0 0.50
S 1 = 0.15 0 0 0.15 S 2 = 0.30 0 0 0.30 S 3 = 0.45 0 0 0.45
Let us choose the output vector π u ( t ) as follows:
π u ( t ) = Z 1 ξ u ( t ) + Z 2 ξ u ( t κ ) + Z 3 ρ u ( t )
where
Z 1 = 0.1 0.5 0.2 0.1 0.3 0.2 Z 2 = 0.3 0.4 0.1 0.3 0.2 0.1 Z 3 = 0.1 0.2 0.5 0.7 0.2 0.4
By using the toolbox for optimization in MATLAB, we obtain the following positive definite matrices, which satisfy Theorem 1, i.e., the network is passive.
P = 0.3514 0.2485 0.2485 6.1742 N 1 = 1.4902 0.0103 0.0103 1.4634 N 2 = 2.3881 0.3110 0.3110 3.2058 W = I 3 1.9933 0.1216 2.0113 1.3109 0.4135 1.3464
By using the toolbox for optimization in MATLAB, we obtain the following positive definite matrices, which satisfy Theorem 2, i.e., the network is input strictly passive.
P = 0.0267 0.2485 0.0228 0.5905 N 1 = 1.3540 0.0035 0.0035 1.0196 N 2 = 3.0297 0.9838 0.9838 2.4894 W = I 3 3.5234 1.1643 2.1222 0.4623 1.0132 3.1321 W 1 = I 3 2.3140 0.9208 1.5350 1.5350 0.2120 1.1342
According to Theorem 3, the network is output strictly passive for the following positive definite matrices:
P = 0.0982 0.0603 0.0603 1.8075 N 1 = 3.7641 0.0018 0.0018 2.9692 N 2 = 7.6926 3.5428 3.5428 8.8839 W = I 3 4.1098 2.7040 1.6606 1.5610 0.1019 3.8012 W 2 = I 3 0.8713 0.2699 1.9610 2.1093 3.0181 2.3583
According to Theorem 4, the complex dynamical network achieves complete synchronization for the following positive definite matrices and parameters
Φ = 0.1124 1.1257 0.0451 0.0095
and we have a feasible solution t m i n = 0.0091 with the following parameters: ϑ 1 = 0.4761 , ϑ 2 = 0.2942 , α 1 = 1.0295 , α 2 = 0.4778 and α 3 = 0.2492 and positive constant k * = 3.2700 . The simulation results in Figure 1 and Figure 2 represent the state trajectories of μ 11 synchronized with μ ¯ ( t ) with and without a controller. Moreover, the state trajectories of μ 12 , μ 22 , μ 31 , μ 32 synchronized with μ ¯ ( t ) with and without adaptive state feedback controllers are depicted in Figure 3, Figure 4, Figure 5, Figure 6, Figure 7, Figure 8, Figure 9, Figure 10, Figure 11 and Figure 12. In Figure 13 and Figure 14, we depict the error trajectories, which completely converge to zero in a short time using the adaptive state feedback controller.

7. Conclusions

We investigated the passivity analysis and synchronization criteria of a fractional-order complex dynamical network model with derivative connections and time-varying delays in this paper. We deduced the passivity problem for the proposed network model in terms of a linear matrix inequality using different inequality methods. Furthermore, using an adaptive feedback control technique, some adequate criteria to ensure complete synchronization for a fractional-order complex dynamical network with derivative couplings (CDNMDC) were obtained. We also examined the synchronization criterion of these complex networks, which included accounting for parameter uncertainty. The passivity analysis of fractional-order complex dynamical networks with derivative coupling holds significant real-life application value in various fields. Its utilization spans electrical engineering, control systems, communication networks, biomedical engineering, social networks, economics, and finance. This analysis enables an understanding of the stability, performance, and dynamics of complex interconnected systems, leading to advancements in system design, control strategies, information flow, and optimization in diverse domains. Finally, we provide an example to demonstrate that the proposed methods work. In the future, we will attempt to investigate these complex dynamical networks by incorporating impulsive perturbations and synchronization analysis.

Author Contributions

Conceptualization, S.A., R.R., G.R. and R.P.A.; methodology, S.A., R.R., G.R.; validation, R.P.A.; formal analysis, S.A., R.R., J.A. and G.R.; investigation, R.R., J.A. and R.P.A.; resources, J.A.; writing—original draft preparation, S.A. and G.R.; writing—review and editing, R.P.A.; visualization, R.R.; supervision, R.R. and G.R.; project administration, J.A. and R.P.A.; funding acquisition, J.A. and G.R. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Data sharing is not applicable to this article as no new data were created or analyzed in this study.

Acknowledgments

This article has been written with the financial support of the National Research Council of Thailand (Talented Mid-Career Researchers), Grant Number N42A650250, and with the partial financial support of RUSA Phase 2.0, Grant No. F 24–51/2014-U, Policy (TN Multi-Gen), DST (FIST—level I) 657876570, Grant No. SR/FIST/MS-I/ 2018/17, DST-PURSE 2nd Phase programme vide letter No. SR/ PURSE Phase 2/38(G). J. Alzabut would like to thank Prince Sultan University, Saudi Arabia and OSTİM Technical University, Turkey.

Conflicts of Interest

The authors declare that they have no conflict of interest.

References

  1. Wang, Z.; Xi, K.; Cheng, A.; Lin, H.X.; Ran, A.C.; van Schuppen, J.H.; Zhang, C. Synchronization of power systems under stochastic disturbances. Automatica 2023, 151, 110884. [Google Scholar] [CrossRef]
  2. Chen, J.; Cao, J.; Huang, W. Traffic-driven explosive synchronization with adaptive local routing in complex networks. Chaos Solitons Fractals 2023, 168, 113142. [Google Scholar] [CrossRef]
  3. Arellano-Delgado, A.; Lopez-Gutiérrez, R.; Mendez-Ramirez, R.; Cardoza-Avendano, L.; Cruz-Hernandez, C. Dynamic coupling in small world outer synchronization of chaotic networks. Phys. D Nonlinear Phenom. 2021, 423, 132928. [Google Scholar] [CrossRef]
  4. Wang, G.; Lu, S.; Liu, W.; Ma, R. Adaptive complete synchronization of two complex networks with uncertain parameters, structures, and disturbances. J. Comput. Sci. 2021, 54, 101436. [Google Scholar] [CrossRef]
  5. Qiu, X.; Zhu, G.; Ding, Y.; Li, K. Successive lag synchronization on complex dynamical networks via delay-dependent impulsive control. Phys. A Stat. Mech. Appl. 2019, 531, 121753. [Google Scholar] [CrossRef]
  6. Lu, J.; Chen, J.; Chen, W. Global asymptotical synchronization of delayed complex dynamical networks with switching topology. IFAC Proc. Vol. 2013, 46, 206–211. [Google Scholar] [CrossRef]
  7. Du, H.; Shi, P.; Lu, N. Function projective synchronization in complex dynamical networks with time delay via hybrid feedback control. Nonlinear Anal. Real World Appl. 2013, 14, 1182–1190. [Google Scholar] [CrossRef]
  8. Xiao-Xiao, Z.; Jin-Liang, W.; Yan-Li, H.; Shun-Yan, R. Passivity analysis of multi-weighted complex dynamical networks with fixed and switching topologies. In Proceedings of the 2017 36th Chinese Control Conference (CCC), Dalian, China, 26–28 July 2017; pp. 7695–7700. [Google Scholar]
  9. Zhao, Y. Passivity analysis of complex dynamical networks with general topology. In Proceedings of the Proceedings of the 30th Chinese Control Conference, Yantai, China, 22–24 July 2011; pp. 47–52. [Google Scholar]
  10. Wan, P.; Jian, J. Passivity analysis of memristor-based impulsive inertial neural networks with time-varying delays. ISA Trans. 2018, 74, 88–98. [Google Scholar] [CrossRef]
  11. Fang, T.; Jiao, S.; Fu, D.; Su, L. Passivity-based synchronization for Markov switched neural networks with time delays and the inertial term. Appl. Math. Comput. 2021, 394, 125786. [Google Scholar] [CrossRef]
  12. Zambrano-Serrano, E.; Munoz-Pacheco, J.M.; Serrano, F.E.; Sánchez-Gaspariano, L.A.; Volos, C. Experimental verification of the multi-scroll chaotic attractors synchronization in PWL arbitrary-order systems using direct coupling and passivity-based control. Integration 2021, 81, 56–70. [Google Scholar] [CrossRef]
  13. Lin, F.; Zhang, Z. Global Asymptotic Synchronization of a Class of BAM Neural Networks with Time Delays via Integrating Inequality Techniques. J. Syst. Sci. Complex. 2020, 33, 366–382. [Google Scholar] [CrossRef]
  14. Muhammadhaji, A.; Teng, Z. General Decay Synchronization for Recurrent Neural Networks with Mixed Time Delays. J. Syst. Sci. Complex. 2020, 33, 672–684. [Google Scholar] [CrossRef]
  15. Huang, Y.L.; Chen, W.Z.; Wang, J.M. Finite-time passivity of delayed multi-weighted complex dynamical networks with different dimensional nodes. Neurocomputing 2018, 312, 74–89. [Google Scholar] [CrossRef]
  16. Wang, L.; Wang, J.L. Analysis and pinning control for passivity and synchronization of multiple derivative coupled reaction diffusion neural networks. J. Frankl. Inst. 2020, 357, 1221–1252. [Google Scholar] [CrossRef]
  17. Qiu, H.; Cao, J.; Liu, H. Passivity of fractional-order coupled neural networks with interval uncertainties. Math. Comput. Simul. 2023, 205, 845–860. [Google Scholar] [CrossRef]
  18. Liang, R.G.; Wang, J.L. PD control for passivity of coupled reaction-diffusion neural networks with multiple state couplings or spatial diffusion couplings. Neurocomputing 2022, 489, 558–569. [Google Scholar] [CrossRef]
  19. Xiao, S.; Wang, Z.; Wang, C. Passivity analysis of fractional-order neural networks with interval parameter uncertainties via an interval matrix polytope approach. Neurocomputing 2022, 477, 96–103. [Google Scholar] [CrossRef]
  20. Ren, S.Y.; Wu, J.; Xu, B.B. Passivity and pinning passivity of complex dynamical networks with spatial diffusion coupling. Neurocomputing 2017, 227, 3–9. [Google Scholar] [CrossRef]
  21. Kaviarasan, B.; Sakthivel, R.; Lim, Y. Synchronization of complex dynamical networks with uncertain inner coupling and successive delays based on passivity theory. Neurocomputing 2016, 186, 127–138. [Google Scholar] [CrossRef]
  22. Liu, C.G.; Wang, J.L. Passivity of fractional-order coupled neural networks with multiple state/derivative couplings. Neurocomputing 2021, 455, 379–389. [Google Scholar] [CrossRef]
  23. Padmaja, N.; Balasubramaniam, P. Mixed passivity based stability analysis of fractional-order gene regulatory networks with variable delays. Math. Comput. Simul. 2022, 192, 167–181. [Google Scholar] [CrossRef]
  24. Ye, Z.; Ji, H.; Zhang, H. Passivity analysis of Markovian switching complex dynamic networks with multiple time-varying delays and stochastic perturbations. Chaos Solitons Fractals 2016, 83, 147–157. [Google Scholar] [CrossRef]
  25. Podlubny, I. Fractional Derivatives and Integrals; Chapter 2; Elsevier: Amsterdam, The Netherlands, 1999; Volume 198, pp. 41–119. [Google Scholar]
  26. Pratap, A.; Raja, R.; Agarwal, R.P.; Cao, J. Stability analysis and robust synchronization of fractional-order competitive neural networks with different time scales and impulsive perturbations. Int. J. Adapt. Control. Signal Process. 2019, 33, 1635–1660. [Google Scholar] [CrossRef]
Figure 1. Evolution of synchronization states of μ 11 and μ ¯ ( t ) without controller.
Figure 1. Evolution of synchronization states of μ 11 and μ ¯ ( t ) without controller.
Axioms 12 00730 g001
Figure 2. Evolution of synchronization states of μ 11 and μ ¯ ( t ) with controller.
Figure 2. Evolution of synchronization states of μ 11 and μ ¯ ( t ) with controller.
Axioms 12 00730 g002
Figure 3. Evolution of synchronization states of μ 12 and μ ¯ ( t ) without controller.
Figure 3. Evolution of synchronization states of μ 12 and μ ¯ ( t ) without controller.
Axioms 12 00730 g003
Figure 4. Evolution of synchronization states of μ 12 and μ ¯ ( t ) with controller.
Figure 4. Evolution of synchronization states of μ 12 and μ ¯ ( t ) with controller.
Axioms 12 00730 g004
Figure 5. Evolution of synchronization states of μ 21 and μ ¯ ( t ) without controller.
Figure 5. Evolution of synchronization states of μ 21 and μ ¯ ( t ) without controller.
Axioms 12 00730 g005
Figure 6. Evolution of synchronization states of μ 21 and μ ¯ ( t ) with controller.
Figure 6. Evolution of synchronization states of μ 21 and μ ¯ ( t ) with controller.
Axioms 12 00730 g006
Figure 7. Evolution of synchronization states of μ 22 and μ ¯ ( t ) without controller.
Figure 7. Evolution of synchronization states of μ 22 and μ ¯ ( t ) without controller.
Axioms 12 00730 g007
Figure 8. Evolution of synchronization states of μ 22 and μ ¯ ( t ) with controller.
Figure 8. Evolution of synchronization states of μ 22 and μ ¯ ( t ) with controller.
Axioms 12 00730 g008
Figure 9. Evolution of synchronization states of μ 31 and μ ¯ ( t ) without controller.
Figure 9. Evolution of synchronization states of μ 31 and μ ¯ ( t ) without controller.
Axioms 12 00730 g009
Figure 10. Evolution of synchronization states of μ 31 and μ ¯ ( t ) with controller.
Figure 10. Evolution of synchronization states of μ 31 and μ ¯ ( t ) with controller.
Axioms 12 00730 g010
Figure 11. Evolution of synchronization states of μ 32 and μ ¯ ( t ) without controller.
Figure 11. Evolution of synchronization states of μ 32 and μ ¯ ( t ) without controller.
Axioms 12 00730 g011
Figure 12. Evolution of synchronization states of μ 32 and μ ¯ ( t ) with controller.
Figure 12. Evolution of synchronization states of μ 32 and μ ¯ ( t ) with controller.
Axioms 12 00730 g012
Figure 13. Evolution of synchronization error ξ ( t ) without controller.
Figure 13. Evolution of synchronization error ξ ( t ) without controller.
Axioms 12 00730 g013
Figure 14. Evolution of synchronization error ξ ( t ) with controller.
Figure 14. Evolution of synchronization error ξ ( t ) with controller.
Axioms 12 00730 g014
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

Aadhithiyan, S.; Raja, R.; Alzabut, J.; Rajchakit, G.; Agarwal, R.P. Passivity Analysis and Complete Synchronization of Fractional Order for Both Delayed and Non-Delayed Complex Dynamical Networks with Couplings in the Derivative. Axioms 2023, 12, 730. https://doi.org/10.3390/axioms12080730

AMA Style

Aadhithiyan S, Raja R, Alzabut J, Rajchakit G, Agarwal RP. Passivity Analysis and Complete Synchronization of Fractional Order for Both Delayed and Non-Delayed Complex Dynamical Networks with Couplings in the Derivative. Axioms. 2023; 12(8):730. https://doi.org/10.3390/axioms12080730

Chicago/Turabian Style

Aadhithiyan, S., R. Raja, Jehad Alzabut, G. Rajchakit, and Ravi P. Agarwal. 2023. "Passivity Analysis and Complete Synchronization of Fractional Order for Both Delayed and Non-Delayed Complex Dynamical Networks with Couplings in the Derivative" Axioms 12, no. 8: 730. https://doi.org/10.3390/axioms12080730

APA Style

Aadhithiyan, S., Raja, R., Alzabut, J., Rajchakit, G., & Agarwal, R. P. (2023). Passivity Analysis and Complete Synchronization of Fractional Order for Both Delayed and Non-Delayed Complex Dynamical Networks with Couplings in the Derivative. Axioms, 12(8), 730. https://doi.org/10.3390/axioms12080730

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