Professional Documents
Culture Documents
Biological N-System With Global Stability
Biological N-System With Global Stability
Linfan MAO
Chinese Academy of Mathematics and System Science, Beijing 100190, P.R.China and also
Academy of Mathematical Combinatorics & Applications, Colorado, USA
E-mail: maolinfan@163.com
L
can be mathematically characterized by action flow G of order n with surplus flows
xi fij , xj fji
on edge (vi , vj ), where fij , fji
are 2 variable functions for integers 1
X
X
x i = xi
fki
(xk , xi )
fil (xi , xl ) ,
vk N (vi )
1 i n,
vl N + (vi )
fki
(xk , xi ) =
vk N (vi )
fil (xi , xl ),
1in
vl N + (vi )
of equations may be solvable or not. However, even if it is non-solvable, it characterizes biological systems also if it can be classified into solvable subsystems. The
main purpose of this paper is to characterize the biological behavior of such systems with global stability by a combinatorial approach, i.e., establish the relationship
between solvable subsystems of a biological n-system with Eulerian subgraphs of la
L
beling bi-digraph of G , characterize n-system with linear growth rate and the global
stability on subgraphs, and interpret also the biological behavior of GL -solutions of
non-solvable equations, which opened a way for characterizing biological system with
species more than 3, i.e., mathematical combinatorics. As we know, nearly all papers
discussed biological system with species less or equal to 3 in the past decades.
Key Words: Food web, biological n-system, action flow, Klomogorov model,
non-solvable system, Eulerian graph, bi-digraph, Smarandache multispace,
mathematical combinatorics.
namics, Physical, Biological and Chemical Systems, December 9-11, 2016, India.
1. Introduction
There is a well-known biological law for living things in the natural world, i.e., the
survival of the fittest in the natural selection because of the limited resources of
foods. Thus, foods naturally result in connection with living things, i.e., food chain,
a linear network starting from producer organisms and ending at apex predator
species or decomposer species. And biologically, a food web is a natural interconnection of food chains, a resultant by a simple ruler ([28]), and generally a graphical
representation of what-eats-what in the ecological community such as those shown in
Fig.1 for 4 food chains: grassladybugfrogsnakeeagle, grassladybugfrog
egret, grassrabbit snakeeagle and grassrabbiteagle.
Fig.1
Actually, a food web is an interaction system in physics ([15]-[16], [25]) which
can be mathematically characterized by the strength of what action on what. For a
biological 2-system, let x, y be the two species with the action strength F (x y),
F (y x) of x to y and y to x on their growth rate, respectively ([21]). Then, such
a system can be quantitatively characterized by differential equations
(
x = F (y x)
y = F (x y)
x
u
(x, y)
y
v
Fig.2
L
the in and out-action must be conservative with the surplus on each vertex of G .
L
Thus, a food web is an action flow ([18]) further, i.e., a topological digraph G
labeled with surplus flows of growth rates x i of population on vertices vi , vector flow
(xi , xj ), initial and end operators Fij , Fij on edge (vi , vj ) for integers 1 i, j n,
where n 2 holding with a system of conservation equations
X
X
x i =
Fki (xk xi )
Fil (xi xl ), 1 i n
vk N (vi )
vl N + (vi )
and particularly,
x i = xi
vk N (vi )
fki
(xk , xi )
vl N + (vi )
fil (xi , xl ) , 1 i n
(1.1)
x = x (b x + (b + b a )x a x + b x )
2
2
11 1
12
62
31 2
32 3
61 4
(1.2)
x 1
x1 f5
(x4 , x1 )
x1 f1
x1 f2
(x1 , x2 )
x2 f1
x2 f6
x 2
x2 f3
(x1 , x3 )
?(x2, x3)
x4 f5 x f
4 6
x 4
x4 f4
(x4 , x2 )
(x3 , x4 )
x3 f2
x3 f4
x3 f3
x 3
Fig.3
where,
f1 (x1 , x2 ) = a11 x1 + a12 x2 , f1 (x1 , x2 ) = b11 x1 + b12 x2 ,
f2 (x1 , x3 ) = a21 x1 + a22 x3 , f2 (x1 , x3 ) = b21 x1 + b22 x3 ,
f3 (x2 , x3 ) = a31 x2 + a32 x3 , f3 (x2 , x3 ) = b31 x2 + b32 x3 ,
f4 (x3 , x4 ) = a41 x3 + a42 x4 , f4 (x3 , x4 ) = b41 x3 + b42 x4 ,
f5 (x4 , x1 ) = a51 x4 + a52 x1 , f5 (x4 , x1 ) = b51 x4 + b52 x1 ,
f6 (x4 , x2 ) = a61 x4 + a62 x2 , f6 (x4 , x2 ) = b61 x4 + b62 x2 .
.
L
to be a labeling subgraph of G if its vertices and edges are labeled by L|H , denoted
L
L
L
L
by H G and furthermore, if H = G
, such a labeling subgraph is said
V (H)
D
E
L
L
For example, the 2 labeling graphs G 1 , G 2 in Fig.4 are all labeling subgraphs
L
but only G 1 is an induced subgraph of the graph shown in Fig.3.
x 1
x1 f2
x1 f5
(x4 , x1 )
x4 f5
x 4
x f (x1 , x2 ) x2 f1
x 2
x 1 x1 f1
1 2
x2 f6
x2 f3
(x1 , x3 )
x4 f4
~(x1, x3)
?(x2, x3)
s3
x3 f2
(x3 , x4 ) x3 f4 x 3
L
G1
x4 f6
x 4
(x4 , x2 )
x3 f2
x3 f2
x 3
L
G2
Fig.4
L
Clearly, a labeling subgraph of G is also consisting of food chains but it maybe
not a food web if it is not an action flow again. Even it is, the sizes of species are
4
L
not the same as they in G because the conservative laws are completely changed.
L
For example, the system of conservation equations for the labeling subgraph G 1 is
x = x (b x a x + (b a )x )
4
41 3
52 1
42
51
G G
of a labeling digraph G is a labeling graph on G G with a la
S
S
S
b : V (
b : E
beling L
G G) L V (G) , L
G G L E G G
by
b : (u, v) {0, (x, y), yf }, (v, u) {xf, (x, y), 0} if L : (u, v) {xf, (x, y), yf }
L
(x, y)
x
u
xf (x, y) yf
0
u x
xf
y
v
yf
y v
0
(x, y)
Fig.5
edge of G .
L
of labeling bi-digraph G G
of G , characterize conditions of an n-system
with linear growth rate become distinct and global stability, and interpret also the
biological behavior of GL -solutions of non-solvable equations, which opened a way
5
for characterizing biological system with species more than 3, i.e., mathematical
combinatorics, or differential equations over graphs.
For terminologies and notations not mentioned here, we follow references [1] for
mechanics, [25] for interaction particles, [2] and [20] for biological mathematics, [3]
for differential equations with stability, [6]-[7] for topological graphs, digraphs and
combinatorial geometry, [7] and [26] for Smarandache multispaces.
2. Geometry Over Equilibrium Points
2.1 Equilibrium Sets
We consider the generalized Kolmogorov model on biological n-system ([2], [20]),
i.e., the system (1.1) of differential equations
!
P
P
x 1 = x1
fk1
(xk , x1 )
f1l (x1 , xl )
vk N (v1 )
vl N + (v1 )
P
P
x = x
fk2
(xk , x2 )
f2l (x2 , xl )
2
2
vk N (v2 )
vl N + (v2 )
P
P
fkn
(xk , xn )
fnl (xn , xl )
x n = xn
vl N + (vn )
vk N (vn )
vk N (vi )
fki
6=
xi (x0 ,x0)
k
vl N + (vi )
vl N + (vi )
vk N (vi )
but
fki
(x0k , x0i ) =
fki
(xk , xi )
fil
.
xi (x0 ,x0 )
vl N + (vi )
vk N (vi )
fil (xi , xl ).
Fi
=
xi (x0 ,x0 ,,x0n )
1
vk N (vi )
fki
vl N + (vi )
fil
6= 0.
xi (x0 ,x0 ,,x0n )
1
P
P
x01
fk1
(x0k , x01 )
f1l (x01 , x0l ) = 0
+
vk N (v1 )
vl N (v1 )
P
P
x02
fk2
(x0k , x02 )
f2l (x02 , x0l ) = 0
vk N (v2 )
vl N + (v2 )
P
P
fkn
(x0k , x0n )
fnl (x0n , x0l ) = 0
xn
+
vk N (vn )
(2.1)
vl N (vn )
Clearly, only those solutions x0i 0, 1 i n of system (2.1) have the biological meaning, and (0, 0, , 0) Rn is an obvious equilibrium point. We classify all
equilibrium points of system (2.1) into 3 categories following:
(C1) Only (0, 0, , 0) Rn hold with system (2.1), i.e., the system
P
P
fk1
(x0k , x01 ) =
f1l (x01 , x0l )
+
vk N (v1 )
vl N (v1 )
P
P
0
0
fk2 (xk , x2 ) =
f2l (x02 , x0l )
vk N (v2 )
vl N + (v2 )
vk N (vn )
vl N (vn )
P
P
fkn
(x0k , x0n ) =
fnl (x0n , x0l )
is non-solvable in Rn .
(2.2)
P
P
0
0
f
(x
,
x
)
=
fi1 l (x0i1 , x0l )
i
ki
k
1
1
(v )
+ (v )
v
N
v
N
i1
i1
k
l
P
P
0
0
f
(x
,
x
)
=
fis l (x0is , x0l )
i
ki
k
s
s
vk N (vis )
vl N + (vis )
P
P
0
0
fkj (xk , xj )
=
fjl (x0j , x0l )
(2.3)
vl N + (vj )
vk N (vj )
is non-solvable in Rn .
(C3) There are (K1 , K2 , , Kn ) Rn hold system (2.1) with Ki > 0 for
integers 1 i n.
2.2 Geometry Over Equations
Usually, one applies differential equations to characterize the reality of things by
their solutions. But can this notion describes the all behavior of things? Certainly
not ([8]-[19]), particularly in biology follows by the discussion following.
For an integer n 1, let u : Rn Rn be differentiable mapping. Its ndimensional graph [u] is defined by the ordered pairs
[u] = {((x1 , , xn ) , u (x1 , , xn ))) |(x1 , , xn )}
in Rn+1 . Clearly, the assumption on fij , fij , 1 i, j n concludes that the solution
manifold SFi is nothing else but a graph [Fi ] in Rn .
Geometrically, the system
F1 (x1 , x2 , , xn ) = 0
F (x , x , , x ) = 0
2 1
2
n
.....................
Fn (x1 , x2 , , xn ) = 0
n
T
(2.4)
i=1
n
T
i=1
SFi 6= or
i=1
n
T
F1 (x1 , x2 , , xn ) = 0
F (x , x , , x ) = 0
2 1
2
n
.....................
Fn (x1 , x2 , , xn ) = 0
n
T
n
\
SFi = or 6= .
i=1
i=1
(2.4). However, this is a wrong understanding on things because all things are
in contradiction in the nature even for human ourselves, and further on different
species. This fact also concludes that characterizing things by solvable system (2.4)
of equations is only part, not the global, and with no conclusion if it is non-solvable
in classical meaning.
Philosophically, things T1 , T2 , , Tn consist of a group, or a union set
n
S
Ti , and
i=1
i=1
x+y
x+y
(LES4N )
xy
xy
following
=
= 1
= 1
=
1
9
x=y
x+y =2
(LES4S )
x=1
y=1
A
D
x=1
x
O
B
C x+y =1
x y = 1
x y = 1 x + y = 1
y=1
x+y = 2
x
(LES4N )
x=y
(LES4S )
Fig.6
SF j .
Example 2.3 The -solutions of (LES4N ) and (LES4S ) are respectively labeling
graphs C4L and K4L shown in Fig.7 following.
10
L1,1,1
L1,0,1
L1,1,1
P
D
L1,1,1
L1,1,0
L1,1,2
L1,1,1
C4L
P
K4L
L0,1,1
Fig.7
Theorem 2.4 A system (2.4) of equations is -solvable if Fi C1 and Fi |(x0 ,x0 ,,x0n )
1 2
Fi
= 0 but
6= 0 for any integer i, 1 i n.
xi (x0 ,x0 ,,x0n )
1
definition.
L
Theorem 2.5 A system (1.1) of differential equations on food web G is uniquely
-solvable if fij , fij C1 for integers 1 i, j n and (x1 (0), x2 (0), , xn (0)) =
(x01 , x02 , , x0n ) Rn .
Proof Applying the existence and uniqueness theorem on the Cauchy problem
of differential equations,
x i = xi
fk1
(xk , xi )
vl N + (vi )
vk N (vi )
f1l (xi , xl )
with (x1 (0), x2 (0), , xn (0)) = (x01 , x02 , , x0n ) Rn , it is uniquely solvable for any
integer 1 i n. Consequently, the system (1.1) is uniquely -solvable in Rn by
definition.
*
Snake
Eagle
Rabbit
Fig.8
For example, the eagle can lives respectively on the rabbit, on the snake or on
the both via its food chains snakeeagle or rabbiteagle with interactions in Fig.1,
i.e., although the eagle preys on the snake and the rabbit but it is also dependent
on the 2 populations such as those shown in Fig.8, and its living web should be
consisted of circuits eaglesnakeeagle, eaglerabbiteagle or eaglesnake and
rabbiteagle, Eulerian subgraphs.
Generally, a predator P preys on a living thing T , i.e., P action on T and there
are also T reacts on P at the same time, which implies the interaction between
living things, the in and out action exist together. We therefore know a biological
fact following.
Fact 3.1 A living thing must live in an Eulerian subgraph of bi-digraph of a food
L
web G .
13
The following result characterizes action flows on Eulerian subgraphs with that
of solvable subsystems of equations (1.1).
L
Theorem 3.2 Let G be a food web with solvable or non-solvable conservative
L
equations (1.1) on initial value (x1 (0), x2 (0), , xn (0)) = (x01 , x02 , , x0n ) and H
L S Lb
G
G , a food web containing species T with solvable conservation equations
x i0 = xi0
fki
(xk , xi0 )
0
vl N + (vi0 )
vk N (vi0 )
(3.2)
L
H is an action flow with conservation laws at each vertex.
or 6= for integers 1 6= j s. If G =
H i , they are called a subgraph multii=1
Eulerian multi-decomposition of the graph on the left is shown on the right in Fig.9.
v1
v3
v4
:
3 ?s
YI
?k
3
v5
v2
v2
Fig.9
14
v1
v1
v1
v3
?Y
3
v2
v4
? } v5
3
v2
T
Particularly, if E H i
E H j = for integers 1 i 6= j s, such a decompo
L
Theorem 3.3 If there are Eulerian subgraphs H i , 1 i s with solvable consers
Lb L
L
vative equations, i.e., food webs such that G =
H i with
i=1
if v
l
T
i0 =1
b:v
L
v V ( G )
x vi ,
i=1
L
V ( H i0 ) with L(v) = x vi in H i0 and
b : (u, v)
L
if (u, v)
l
X
s
T
j0 =1
s
X
l=1
s
X
l=1
L
Fil (v u) , (u, v) E( G )
Lb
E( H j0 ), then G is also a food web, i.e., an action flow.
Lb
Proof Clearly, G is a labeling graph holding with conservative law on each
L
vertex v V ( G ), i.e., an action flow.
4. Global Stability and Extinction
In biology, the generation is the necessary condition for the continuation of species
in a food web constraint on the interaction, i.e., the stability in dynamics with small
perturbations on initial values. Usually, the dynamical behavior is characterized by
differential equations, which maybe solvable or not and can not immediately apply
L
to the stability of food web G for n 3 by Theorems 3.2 and 3.3. Generalizing
the classical stability enables one to define the stability of food web following.
L0
Definition 4.1 A food web G with initial value G , where L(v) = x v , L0 (v) = x 0v
L
for v V ( G ) is globally stable or asymptotically stable for any initial value G 0 ,
L
where L0 (v) = y v0 for v V ( G ) and a number v > 0, there is always a number
v > 0 such that if |yv0 x0v | < v exists for all t 0, then
|yv (t) xv (t)| < v ,
15
L
v V ( G ),
or furthermore,
lim |yv (t) xv (t)| = 0,
t0
L
v V ( G ).
Certainly, we need new criterions on the classic for discussing the stability of
species in biology.
L0
Theorem 4.2 A food web G with initial value G is globally stable or asymptotically stable if and only if there is an Eulerian multi-decomposition
s
[ Lb M
L
G
G
=
Hi
i=1
L0
Proof The necessary is obvious because if G with initial value G is globally
S Lb
L
G
G
=
Hi
i=1
S Lb
on labeling bi-digraph G G
with stable or asymptotically stable conservative
L
equations on labeling Eulerian subgraphs H i , i.e., for any number v > 0, there is
a number v > 0 such that if |yv0 x0v | < v exists for all t 0, then
|yv (t) xv (t)| < v ,
or furthermore,
lim |yv (t) xv (t)| = 0,
t0
L
v V ( H i ),
L
v V ( H i )
L
for integers 1 i s, let v be the multiple of vertex v V ( G ) appeared in
L
subgraphs H i , 1 i s, we then know that
|yv (t) xv (t)| < iv
L
for v V ( H i ) if |yv0 x0v | < vi for integers 1 i v .
Define
v = min{vi , 1 i v }
and
16
v = max{iv , 1 i v }.
L
i.e., the species on vertex v is stable if the conservative equations of H i are stable
L
for integers 1 i v and G is globally stable.
Now if furthermore, xv is asymptotically stable, i.e.,
lim |yv (t) xv (t)| = 0
t0
L
in food web H i , 1 i v , it is clear that
lim |yv (t) xv (t)| = 0
t0
L
in G also, i.e., G is globally asymptotically stable. This completes the proof.
L0
Corollary 4.3 A food web G with initial value G is globally stable or asymptotically stable if there is an Eulerian decomposition
s
[ Lb M
L
G
G
=
Hi
i=1
decomposition
G
G=
(u,v)E( G )
(u, v)
[
(v, u) .
L0
Corollary 4.4 A food web G with initial value G is globally stable or asympS
b
totically stable if it is parallel stable or asymptotically stable, i.e., ((u, v) (v, u))L
L
is an action flow for (u, v) E( G ).
L0
For an equilibrium point G of (2.1), we can also linearize F (v, u), F (v, u) at
L
(x0 , y0 ) for (v, u) E( G ) and know the stable behavior of G in neighborhood
L0
of G by applying the following well-known result.
Theorem 4.5([3]) If an n-dimensional system X = F (X) has an equilibrium point
X0 that is hyperbolic, i.e., all of the eigenvalues of DFX0 have nonzero real parts,
17
then the nonlinear flow is conjugate to the flow of the linearized system in a neighborhood of X0 .
The next result on the stability of food webs is an immediate application of
Theorem 4.5.
L0
Theorem 4.6 A food web G with initial value G is globally asymptotically stable
if there is an Eulerian multi-decomposition
s
[ Lb M
L
Hk
G
G
=
k=1
with solvable conservative equations such that Rei < 0 for characteristic roots i
of Av in the linearization Av Xv = 0hv hv of conservative equations at an equilib
L0
L
rium point H k in H k for integers 1 i hv and v V ( H k ), where V ( H k ) =
{v1 , v2 , , vhv },
v
v
v
Av =
a
a
a
2hv
21 22
avh1 avh2 avhhv
hv
X
ci i (t)ei t ,
i=1
t11
t11 t + t12
t21
t21 t + t22
1 (t) =
, 2 (t) = ,
thv 1
tn1 t + thv 2
,
t
11
tk1 1 + (k1t12
tk1 2 + + t1k1
(k 1)!
2)!
1t21 k1 1
(k 1)! t
+ (k1t22
tk1 2 + + t2k1
2)!
1
k1 (t) =
thv 1 k1 1
t v 2 k1 2
t
+ (k1h2)!
t
+ + thv k1
(k1 1)!
18
t1(k1 +1)
t11 t + t12
t2(k1 +1)
t21 t + t22
, k +2 (t) =
,
k1 +1 (t) =
1
thv (k1 +1)
tn1 t + thv 2
,
t1(h k +1)
t
v
s
s +2) ks 2
tks 1 + 1(h(kvsk
t
+ + t1hv
(ks 1)!
2)!
t2(hv ks +1) ks 1 t2(hv ks +2) ks 2
(k 1)! t
+ (ks 2)! t
+ + t2hv
s
hv (t) =
thv (hv ks +1) ks 1
t
(ks 1)!
+ + thv hv
with each tij a real number for 1 i, j hv such that det([tij ]hv hv ) 6= 0,
1 ,
,
2
i =
s ,
if 1 i k1 ;
if k1 + 1 i k2 ;
;
if k1 + k2 + + ks1 + 1 i hv .
L
for vertex v E( H k ), i.e., each linearized conservative equation Av Xv = 0hv hv is
L
stable for 1 k s. Applying Theorems 4.2 and 4.5, we therefore know that G
is globally asymptotically stable.
L0
Corollary 4.7 A species T is unstable in a food web G with initial value G if
and only if the subgraph containing T in all Eulerian multi-decompositions
s
[ Lb M
L
G
G
=
Hi
i=1
L
of G is unstable.
A unstable behavior of species T will causes the redistribution of flows and
L
makes for a stable situation on the food web G . If it established, the food web
19
works in order again. Otherwise, a few species will evolve finally to extinction, i.e.,
L
ceases to exist in that area. If all species in a food web G vanished on that area,
there must be a series of species x1 , x2 , , xs successively died out on the time, the
stability of the web is repeatedly broken, established and broken, and finally, all
L
species become extinct. In this case there must be vertices v1 , v2 , , vs V ( G )
and a series of action flows
L
L
G G v1 G v1 v2 G {v1 , v2 , , vs }
L
such that there are no flows in G {v1 , v2 , , vs }, i.e., G {v1 , v2 , , vs } K l ,
where l = | G | s.
Notice that if species x is extinct, there must be lim x(t) = 0. Let f (t) be
t+
2 2
n
t + + tn + ,
2!
n!
we are easily know that there is a constant A > 0 such that |f (t)| Atn for any
integer n 1. In this case, f is said to be -declined and x a species extinct in
rate .
The results following characterize the extinct behavior of species in a food web.
L
Theorem 4.8 Let G be a food web hold with labeling L : vi x i on vertices vi ,
L
L : (vi , vj ) {Fij , (xi , xj ), Fij } on edges for integers 1 i, j n, V V ( G ). If
X
X
X
V (t) =
Fv v (v v)
Fvv (v v )
vV
v N + (v)
v N (v)
vV
Fv v (xv xv )
v N + (v)
v N (v)
20
Fvv (xv xv )
and
d
X =
xv
vV
X
vV
dt
x v
vV
Fv v (v v)
v N + (v)
v N (v)
Fvv (v v ) .
X
X
X
A
A
X =
Fv v (v v)
Fvv (v v ) = V (t) .
t
t
+
vV
v N (v)
v N (v)
Consequently,
|X|
Z+
A
dt = A
t
Z+
1
A
dt =
= O(t+1 ).
t
( 1)t1
Therefore, all species X in V is extinct in at least rates 1 on t, and particularly, it holds with the case of V = {v}.
L
Theorem 4.9 Let G be a food web hold with labeling L : vi x i on vertices vi ,
L
L : (vi , vj ) {Fij , (xi , xj ), Fij } on edges for integers 1 i, j n, and V V ( G )
L
a cut set with components C1 , C2 , , Cl in G \ V , where l 2. If
X
X
fv (t) =
Fv v (v v)
Fvv (v v )
v N + (v)
v N (v)
L
L
L
(1) G turns to l food webs C 1 , C 2 , , C l finally;
P
(2) the species XV =
xv , particularly, xv is extinct in at least rates 1
vV
on t for v V .
L
F (v u) = 0 and F (u v) = 0 for v V and u V ( G ) \ V . Therefore, the
conservative laws
x u =
Fvu
(xu xv )
vN + (u)
vN (u)
21
Fuv (xu xv )
L
in G turns to
x u =
vN (u)
Fvu
(xv xu )
vN + (u)
V (Ci )
Fuv (xu xv ),
V (Ci )
L
i.e., it holds also with vertex u in C i for integers 1 i l, the assertion (1).
For (2), by the proof of Theorem 4.8 there is a number A > 0 such that
Z+
Z+
X
L A
L A
xv (t)
( G ) dt
( G ) dt XV (t) =
t
t
vV
0
L
by definition, where ( G ) is the connectivity of G . Whence, XV (t) = O(t+1 ),
and particularly, xv (t) = O(t+1 ) for v V .
Finally, there are indeed the case of extinction of species in rate . For example,
the proof of Theorem 4.6 implies the case of extinction in rate on t following.
L
Theorem 4.10 Let G be food web with an Eulerian multi-decomposition
s
[ Lb M
L
G
G
=
Hk
k=1
L
and all conservative equations on H k are solvable for integers 1 k l. For
L
L
L
a vertex v V ( G ) including repeatedly in H i1 , H i2 , , H il , if Rei < 0 for
characteristic roots i of Ak in the linearization
Ak Xk = 0hk hk
L0
L
of conservative equation at an equilibrium point H k , v V ( H k ) for integers
1 i hk , then the species xv is simultaneously extinct in rate on time t
L
and asymptotically stable, where V ( H k ) = {v1 , v2 , , vhk }, Ak and Xk are as the
same in Theorem 4.6 for integers 1 k l.
Proof By the proof of Theorem 4.6, we know that xv (t) is asymptotically stable
with
xv (t) =
hk
X
ci i (t)ei t .
i=1
5. Algorithm
Let G = {C1 , C2 , , Cm } be solvable Eulerian multi-decompositions of bi-digraph
S
b
L
( G G )L of a food web G with conservation equations (1.1) solvable or not, where
L
C1 and Cm are respectively a parallel decomposition, G itself of G . Theorems
L
4.2 and 4.6 conclude the following algorithm on the global stability of G .
L
Algorithm 5.1 The stability of a food web G can be determined by programming
following:
STEP 1. Input Xi = Ci and i = 1, 2, , m;
STEP 2. Determine Eulerian circuits in Xi is globally stable or not;
STEP 3. If Xi is globally stable, go to STEP 6; Otherwise, go to STEP 4;
STEP 4. Replace Xi by Xi+1 , return to STEP 2;
STEP 5. If Xi+1 is globally stable, go to STEP 6; Otherwise, go to STEP 4 if
i < m, or go to STEP 7 if i = m;
L
STEP 6. G is globally stable, the algorithm is terminated;
L
STEP 7. G is globally non-stable, the algorithm is terminated.
This algorithm certainly enables one to determine the stability of a food web
L
G regardless of whether its conservation equations solvable or not, and get stability
of food webs with more species than 3 by conclusions on 2 or 3 species.
L
Example 5.2 Determine the stability of a biological 5-system G shown in Fig.10,
x 5 x5 f51
(x5 , x1 )
x1 f51
x1 f21
(x2 , x1 )
x2 f21
x 2
x 1
x 4
x4 f41
(x4 , x1 )
x1 f41
x1 f31
(x3 , x1 )
x3 f31
Fig.10
23
x 3
f21
(x2 , x1 ) = 1 x1 2 x2 ,
f31 (x3 , x1 ) = 1 x3 1 x1 ,
f31
(x3 , x1 ) = 1 x1 3 x3 ,
f41 (x4 , x1 ) = 1 x4 1 x1 ,
f41
(x4 , x1 ) = 1 x1 4 x4 ,
f51 (x5 , x1 ) = 1 x5 1 x1 ,
f51
(x5 , x1 ) = 1 x1 5 x5
x 1 = x1 (4 4x1 2 x2 3 x3 4 x4 5 x5 )
x 2 = x2 (1 x2 1 x1 )
x 3 = x3 (1 x3 1 x1 )
x 4 = x4 (1 x4 1 x1 )
x = x (1 x x )
5
(5.1)
1 1
Let (x01 , x02 , x03 , x04 , x05 ) be an equilibrium point of (5.1). Calculation shows the
linearization of (5.1) is
0
0
0
x 2 = 1 x2 x1 + (1 + 2x2 + 1 x1 ) x2
x 3 = 1 x03 x1 + (1 + 2x03 + 1 x01 ) x3
x = x0 x + (1 + 2x0 + x0 ) x
5
1 5 1
1 1
5
5
(5.2)
0
x 4 x4 f41
(x5 , x1 )
(x5 , x1 )
:(x4, x1)
(x4 , x1 ))
(x2 , x1 )
x1 f51
0
x1 f41
x1 f21
x 1
0 0
x1 f31
x 2
(x2 , x1 )
x2 f21
(x3 , x1 )
(x3 .x1 )
Fig.11
24
x3 f31
x 3
As usual, we can hold on the stability of system (5.2) of linear equations and
then, the stability of (5.1) by Theorem 4.6 on equilibrium points with tedious calculation. However, we apply Algorithm 5.1 for the objective.
S
b
L
Notice that bi-digraph ( G G )L of G in Fig.11 has a parallel decomposition
such as those shown in Fig.12,
x 1
(x2 , x1 )
?(x , x ) 6
2
(x3 , x1 )
x1 f31
(x3 , x1 )
x2 f21
x 1
x 1
x1 f21
(x4 , x1 )
x1 f51
?(x , x )
5
(x5 , x1 )
x5 f51
x 4
x 3
x 2
?(x , x ) 6
x4 f41
x3 f31
x 1
0
x1 f41
0
x 5
Fig.12
and the conservation equations on these parallel edges are respectively
(
x 1 = x1 (1 x1 2 x2 )
x 2 = x2 (1 x2 1 x1 )
(
(
(
x 1 = x1 (1 x1 3 x3 )
x 3 = x3 (1 x3 1 x1 )
x 1 = x1 (1 x1 4 x4 )
x 4 = x4 (1 x4 1 x1 )
x 1 = x1 (1 x1 5 x5 )
x 5 = x5 (1 x5 1 x1 )
(5.3)
(5.4)
(5.5)
(5.6)
1 1
i 1
(4) the equilibrium point
,
is asymptotically stable if 1 > 1
1 i 1 1 i 1
and i > 1 for equations (5.3)-(5.6), where i = 2, 3, 4, 5.
26
[3] Morris W.Hirsch, Stephen Smale and Robert L.Devaney, Differential Equations, Dynamical Systems & An introduction to Chaos (2nd Edition), Elsevier
(Singapore) Pte Ltd, 2006.
[4] Y.Lou, Some reaction diffusion models in spatial ecology (in Chinese), Sci.Sin.
Math., Vol.45(2015), 1619-1634.
[5] Linfan Mao, Combinatorial speculation and combinatorial conjecture for mathematics, International J.Math. Combin. Vol.1(2007), No.1, 1-19.
[6] Linfan Mao, Geometrical theory on combinatorial manifolds, JP J.Geometry
and Topology, Vol.7, No.1(2007),65-114.
[7] Linfan Mao, Combinatorial Geometry with Applications to Field Theory, The
Education Publisher Inc., USA, 2011.
[8] Linfan Mao, Non-solvable spaces of linear equation systems, International J.Math.
Combin., Vol.2(2012), 9-23.
[9] Linfan Mao, Global stability of non-solvable ordinary differential equations with
applications, International J.Math. Combin., Vol.1 (2013), 1-37.
[10] Linfan Mao, Non-solvable equation systems with graphs embedded in Rn , Proceedings of the First International Conference on Smarandache Multispace and
Multistructure, The Education Publisher Inc. July, 2013
[11] Linfan Mao, Geometry on GL -systems of homogenous polynomials, International J.Contemp. Math. Sciences, Vol.9 (2014), No.6, 287-308.
[12] Linfan Mao, Mathematics on non-mathematics - A combinatorial contribution,
International J.Math. Combin., Vol.3(2014), 1-34.
[13] Linfan Mao, Cauchy problem on non-solvable system of first order partial differential equations with applications, Methods and Applications of Analysis,
Vol.22, 2(2015), 171-200.
[14] Linfan Mao, Extended Banach G -flow spaces on differential equations with
applications, Electronic J.Mathematical Analysis and Applications, Vol.3, No.2
(2015), 59-91.
[15] Linfan Mao, A new understanding of particles by G -flow interpretation of differential equation, Progress in Physics, Vol.11(2015), 193-201.
[16] Linfan Mao, A review on natural reality with physical equation, Progress in
Physics, Vol.11(2015), 276-282.
[17] Linfan Mao, Mathematics after CC conjecture combinatorial notions and
27
28