The global-stability problem of equilibria was investigated for coupled systems of differential equations on networks for many years [1-6]. For example, Li and Shuai developed a systematic approach that allowed one to construct global Lyapunov functions for large-scale coupled systems from building blocks of individual vertex systems by using results from graph theory. The approach was applied to several classes of coupled systems in engineering, ecology and epidemiology. Although there exist many results about stability of coupled systems on networks (CSNs), most efforts have been devoted to CSNs whose nodes are constructed by integer-order differential equations. In fact, it is more valuable and practical to investigate coupled system of fractional-order differential equations on network. Recently, Li [7] investigated the global Mittag-Leffler stability of the following coupled system of fractional-order differential equations on network (CSFDEN)
where $D$ denoted Caputo fractional derivative, $\alpha\in (0, 1)$. $t_{0}$ was the inial time, $n$ ($n\geq 2$) denoted the number of vertices in the network. $(x(t))^{T}=(x_{1}(t), x_{2}(t), \cdots, x_{n}(t))^{T}$ denoted the state variable of the system where $x_{i}(t)\in R$. $\alpha_{i} $ was positive constant. Constant $\beta^{x}_{ij}$ represented the influence of vertex $j$ on vertex $i$ with $\beta^{x}_{ii}=0, \beta^{x}_{ij}=-\beta^{x}_{ji}, $ if $i\neq j$. Function $f_{i}$ was Lipschitz continuous. Several sufficient conditions were obtained to ensure the Mittag-Leffler stability of CSFDEN by using graph theory and the Lyapunov method.
Furthermore, Li [8] investigated a coupled system of fractional-order differential equations on network with feedback controls (CSFDENFCs). By using the contraction mapping principle, Lyapunov method, graph theoretic approach and inequality techniques, some sufficient conditions were derived to ensure the existence, uniqueness and global Mittag-Leffler stability of the equilibrium point of CSFDENFCs.
As far as we know, most of researchers are interested in CSNs constructed by only one fractional-order differential equation for every vertex. To the best of authors' knowledge, there are less results about CSNs constructed by two or many fractional-order differential equations for every vertex. In this paper, the coupled model (1.1) is generalized to the more complicated model. The vertex's dynamical character is presented by the two-dimensional system. The coupled relationship is constructed by two components of the vertex. The coupled system of fractional differential equations on network is studied. Sufficient conditions that the coexistence equilibrium of the coupling model is globally Mittag-Leffler stable in $R^{2n}$ are derived by using the method of constructing Lyapunov functions based on graph-theoretical approach for coupled systems.
Remark 1.1 The generalization of model (1.1) is important and meanful. Because a lot of ecological model can be seen as high-dimensional coupled system. Every node is constructed by two or many differential equations in integer-order systems. For example, predator-prey models with patches and dispersal are studied by a lot of researchers [1-6].
This paper is organized as follows. Preliminary results are introduced in Section 2. In Section 3, main results are obtained. In the sequel, an example is presented in Section 4. Finally, the conclusions and outlooks are drawn in Section 5.
In this section, we will list some definitions and theorems which will be used in the later sections.
A directed graph or digraph $G=(V, E)$ contains a set $V=\{1, 2, \cdots, n\}$ of vertices and a set $E$ of arcs $(i, j)$ leading from initial vertex $i$ to terminal vertex $j$. A subgraph $H$ of $G$ is said to be spanning if $H$ and $G$ have the same vertex set. A digraph $G$ is weighted if each arc $(j, i)$ is assigned a positive weight. $a_{ij} > 0$ if and only if there exists an arc from vertex $j$ to $i$ in $G$.
The weight $w(H)$ of a subgraph $H$ is the product of the weights on all its arcs. A directed path $P$ in $G$ is a subgraph with distinct vertices ${i_{1}, i_{2}, \cdots, i_{m}}$ such that its set of arcs is $\{(i_{k}, i_{k+1}):k =1, 2, \cdots, m\}$. If $i_{m}=i_{1}$, we call $P$ a directed cycle.
A connected subgraph $T$ is a tree if it contains no cycles, directed or undirected.
A tree $T$ is rooted at vertex $i$, called the root, if $i$ is not a terminal vertex of any arcs, and each of the remaining vertices is a terminal vertex of exactly one arc. A subgraph $Q$ is unicyclic if it is a disjoint union of rooted trees whose roots form a directed cycle.
Given a weighted digraph $G$ with $n$ vertices, the weight matrix $A=(a_{ij})_{n\times n}$ can be defined by their entry $a_{ij}$ equals the weight of arc $(j, i)$ if it exists, and 0 otherwise. For our purpose, we denote a weighted digraph as $(G, A)$. A digraph $G$ is strongly connected if, for any pair of distinct vertices, there exists a directed path from one to the other. A weighted digraph $(G, A)$ is strongly connected if and only if the weight matrix $A$ is irreducible.
The Laplacian matrix of $(G, A)$ is denoted by $L$. Let $c_{i}$ denote the cofactor of the $i$-th diagonal element of $L$. The following results are listed.
Lemma 2.1 [6] Assume $n\geq 2$. Then
where $T_{i}$ is the set of all spanning trees ${\bf{T}}$ of $(G, A)$ that are rooted at vertex $i$, and $w(T)$ is the weight of $T$. In particular, if $(G, A)$ is strongly connected, then $c_{i} > 0 $ for $1\leq i\leq n$.
Lemma 2.2 [6] Assume $n\geq 2$. Let $c_{i}$ be given in Lemma 2.1. Then the following identity holds
here $F_{ij}(x_{i}, x_{j}), 1\leq i, j\leq n$, are arbitrary functions, ${\text{Q}}$ is the set of all spanning unicyclic graphs of $(G, A)$, $w(Q)$ is the weight of $Q$, and $C_{\text{Q}}$ denotes the directed cycle of ${\text{Q}}$.
If $(G, A)$ is balanced, then
Definition 2.3 [9] The Caputo fractional derivative of order $\alpha\in (n-1, n)$ for a continuous function $f:R^{+}\rightarrow R$ is given by
A coupled system of fractional differential equations on network is constructed as follows
here $D$ denotes Caputo fractional derivative, $\alpha\in (0, 1)$, $t_{0}$ is the inial time, $n$ ($n\geq 2$) denotes the number of vertices in the network. $z(t)=(x(t), y(t))^{T}=(x_{1}(t), x_{2}(t), \cdots, x_{n}(t), $ $y_{1}(t), y_{2}(t), \cdots, y_{n}(t))^{T}$ denotes the state variable of the system where $x_{i}(t)\in R$ and $y_{i}(t)\in R$. $\alpha_{i}, \beta_{i}, \theta_{i}=\varepsilon_{i}=l$ are all positive constants. Constant $\beta^{x}_{ij}$ represents the influence of $x_{j}$ on $x_{i}$ with $\beta^{x}_{ii}=0, \beta^{x}_{ij}=-\beta^{x}_{ji}, $ if $i\neq j$. Constant $\beta^{y}_{ij}$ represents the influence of $y_{j}$ on $y_{i}$ with $\beta^{y}_{ii}=0, \beta^{y}_{ij}=-\beta^{y}_{ji}, $ if $i\neq j$. The following assumptions are given for system (3.1).
(H1) Function $f_{i}, g_{i}$ are Lipschtiz-continuous on $R$ with Lipschitz constant $L^{x}_{i} > 0, L^{y}_{i} > 0$, respectively, i.e.,
for all $u, v \in R.$
(H2) There exists a constant $\lambda$ such that
A mathematical description of a network is a directed graph consisting of vertices and directed arcs connecting them. At each vertex, the local dynamics are given by a system of differential equations called the vertex system. The directed arcs indicate inter-connections and interactions among vertex systems.
Let $\beta_{ij}$ represent the influence of vertex $j$ on vertex $i$ with
Let $A=(|\beta_{ij}|)_{n\times n}, A^{x}=(|\beta^{x}_{ij}|)_{n\times n}, A^{y}=(|\beta^{y}_{ij}|)_{n\times n}$.
A digraph $(G, A)$ with $n$ vertices for system (3.1) can be constructed as follows. Each vertex represents a patch and $(j, i)\in E(G)$ if and only if $\beta^{x}_{ij}\neq 0 $ or $\beta^{y}_{ij}\neq 0$. Here $E(G)$ denotes the set of arcs $(i, j)$ leading from inial vertex $i$ to terminal vertex $j$. At each vertex of $G$, the vertex dynamics are described by the following system (3.2),
The coupling among system (3.1) is provided by the network. The $G$ is strongly connected if and only if the matrix $A=(|\beta_{ij}|)_{n\times n}$ is irreducible.
In this section, the coupled system of fractional differential equations on network is studied. By using the method of constructing Lyapunov functions based on graph-theoretical approach for coupled systems, sufficient conditions that the coexistence equilibrium of the coupling model (3.1) is globally Mittag-Leffler stable in $R^{2n}$ are derived.
We obtain main theorem as follows.
Theorem 3.1 Assume the following conditions hold
1. diagraph $(G, A)$ is balanced;
2. $A^{x}=(|\beta^{x}_{ij}|)_{n\times n}, A^{y}=(|\beta^{y}_{ij}|)_{n\times n}$ are irreducible;
3. condition (H1) and (H2) hold;
4. there exists constant $p\geq 0$ such that $\beta^{y}_{ij}=p\beta^{x}_{ij}$ for $i, j=1, 2, \cdots, n$.
Then system (3.1) is globally Mittag-Leffler stable.
Proof Let $E^{*}=(x^{*}, y^{*})^{T}=(x_{1}^{*}, x_{2}^{*}, \cdots, x_{n}^{*}, y_{1}^{*}, y_{2}^{*}, \cdots, y_{n}^{*})^{T}$ be an equilibrium of (3.1). Assume that $e^{x}_{i}(t)=x_{i}(t)-x_{i}^{*}, e^{y}_{i}(t)=y_{i}(t)-y_{i}^{*}$ ($i=1, 2, \cdots, n$). After calculating, we obtain that
Let $e(t)=(e^{x}_{1}(t), e^{y}_{1}(t), e^{x}_{2}(t), e^{y}_{2}(t), \cdots, e^{x}_{n}(t), e^{y}_{n}(t))$ and
Two case will be discussed about $p$.
Case Ⅰ $0\leq p \leq 1$.
Case Ⅱ $p > 1.$
For Case Ⅰ, It is easy to obtain that $|\beta^{y}_{ij}|\leq |\beta^{x}_{ij}|.$ Therefore, $A=A^{x}.$ From the condition of theorem, we obtain $A^{x}$ is irreducible. Furthermore, $(G, A)$ is strongly connected. Let $c_{i}$ denote the cofactor of the $i$th diagonal element of Laplacian matrix of $(G, A)$. Then we have $c_{i} > 0.$ Let
Calculating the fractional-order derivative of $V(t, e(t))$ along the solution of system (3.1), we have
here $a_{ij}=|\beta_{ij}|=|\beta_{ij}^{x}|$ and $F_{ij}(t, x, y)={\rm {\rm sgn}}(\beta_{ij})xy$. Using the $(G, A)$'s balanced and strongly connected character, we obtain that
Furthermore, we obtain that
In the sequel, we have
Let $_{t_0}D_{t}^{\alpha}V(t, e(t))+M(t)= -\lambda V(t, e(t)).$ Using Laplace transform for the equation above [10, 11], we have
where $w(s)$, $M(s)$ are the Laplace transform of $V(t, e(t))$ and $M(t)$, respectively. Using the inverse Laplace transform for the formula above, we have
By the definition of $V(t, e(t))$, we obtain that system (3.1) is globally Mittag-Leffler stable.
With the similar arguments to Case Ⅰ, we can prove system (3.1) is globally Mittag-Leffler stable for Case Ⅱ. Then the proof is completed.
By Theorem 3.1, we obtain that the following corollary naturally.
Corollary 3.2 Consider the model
Assume that $(G, A)$ is balanced and $A=A^{x}=(|\beta^{x}_{ij}|)_{n\times n}$ is irreducible, condition (H1) and (H2)* hold. Then system (3.3) is globally Mittag-Leffler stable. Here, condition (H2)* is denoted as follows.
(H2)* There is a constant $\lambda$ such that
In this section, a numerical example is presented to illustrate the Theorem 3.1.
Consider the following system of fractional equations on network
where
Therefore, we have
Then we obtain that $c_{1}=c_{2}=6.$ Obviously, $(G, A)$ is strongly connected and balanced. It is easy to obtain that condition (H1), (H2) hold. According to Theorem 3.1, system (4.1) has an equilibrium point $(0, 0, 0, 0)$ which is globally Mittag-Leffler stable.
In this paper, the new coupled model constructed by two fractional-order differential equations for every vertex is studied. The coupled relationship is constructed by two components of the vertex. By using the method of constructing Lyapunov functions based on graph-theoretical approach for coupled systems, sufficient conditions that the coexistence equilibrium of the coupling model is globally Mittag-Leffler stable in $R^{2n}$ are derived. Finally, an example is given to illustrate the applications of main results.
Further studies on this subject are being carried out by the presenting authors in the two aspects: one is to study the model with time delay; the other is to discuss the method to design control terms.