In this paper, we study a p-Laplacian (p>2) reaction-diffusion system based on weighted graphs that is used to describe a network mutualistic model of population ecology. After overcoming difficulties caused by the nonlinear p-Laplacian, we develop a new strong mutualistic condition, and the blow-up properties of the solution for any nontrivial initial data are proved under this condition. In this sense, we extend the blow-up results of models with a graph Laplacian (p=2) to a general graph p-Laplacian.
Citation: Ling Zhou, Zuhan Liu. Blow-up in a p-Laplacian mutualistic model based on graphs[J]. AIMS Mathematics, 2023, 8(12): 28210-28218. doi: 10.3934/math.20231444
[1] | Zhiqiang Li . The finite time blow-up for Caputo-Hadamard fractional diffusion equation involving nonlinear memory. AIMS Mathematics, 2022, 7(7): 12913-12934. doi: 10.3934/math.2022715 |
[2] | Mengyang Liang, Zhong Bo Fang, Su-Cheol Yi . Blow-up analysis for a reaction-diffusion equation with gradient absorption terms. AIMS Mathematics, 2021, 6(12): 13774-13796. doi: 10.3934/math.2021800 |
[3] | Khaled Zennir, Abderrahmane Beniani, Belhadji Bochra, Loay Alkhalifa . Destruction of solutions for class of wave p(x)−bi-Laplace equation with nonlinear dissipation. AIMS Mathematics, 2023, 8(1): 285-294. doi: 10.3934/math.2023013 |
[4] | Salim A. Messaoudi, Mohammad M. Al-Gharabli, Adel M. Al-Mahdi, Mohammed A. Al-Osta . A coupled system of Laplacian and bi-Laplacian equations with nonlinear dampings and source terms of variable-exponents nonlinearities: Existence, uniqueness, blow-up and a large-time asymptotic behavior. AIMS Mathematics, 2023, 8(4): 7933-7966. doi: 10.3934/math.2023400 |
[5] | Chien-Hong Cho, Ying-Jung Lu . On the numerical solutions for a parabolic system with blow-up. AIMS Mathematics, 2021, 6(11): 11749-11777. doi: 10.3934/math.2021683 |
[6] | Fugeng Zeng, Peng Shi, Min Jiang . Global existence and finite time blow-up for a class of fractional p-Laplacian Kirchhoff type equations with logarithmic nonlinearity. AIMS Mathematics, 2021, 6(3): 2559-2578. doi: 10.3934/math.2021155 |
[7] | José L. Díaz . Non-Lipschitz heterogeneous reaction with a p-Laplacian operator. AIMS Mathematics, 2022, 7(3): 3395-3417. doi: 10.3934/math.2022189 |
[8] | Sen Ming, Xiaodong Wang, Xiongmei Fan, Xiao Wu . Blow-up of solutions for coupled wave equations with damping terms and derivative nonlinearities. AIMS Mathematics, 2024, 9(10): 26854-26876. doi: 10.3934/math.20241307 |
[9] | Ahmed Himadan . Well defined extinction time of solutions for a class of weak-viscoelastic parabolic equation with positive initial energy. AIMS Mathematics, 2021, 6(5): 4331-4344. doi: 10.3934/math.2021257 |
[10] | Huafei Di, Yadong Shang . Blow-up phenomena for a class of metaparabolic equations with time dependent coeffcient. AIMS Mathematics, 2017, 2(4): 647-657. doi: 10.3934/Math.2017.4.647 |
In this paper, we study a p-Laplacian (p>2) reaction-diffusion system based on weighted graphs that is used to describe a network mutualistic model of population ecology. After overcoming difficulties caused by the nonlinear p-Laplacian, we develop a new strong mutualistic condition, and the blow-up properties of the solution for any nontrivial initial data are proved under this condition. In this sense, we extend the blow-up results of models with a graph Laplacian (p=2) to a general graph p-Laplacian.
In recent years, evolution problems on complex networks have been studied extensively, for example, in the field of epidemic processes or population ecology [1,2,3,4,5]. A network is mathematically described as a undirected graph T=(Ω,E), which contains a set Ω of vertices and a set E of edges (x,y) connecting vertex x and vertex y. If vertices x and y are connected by an edge (i.e., they are adjacent), we write x∼y. T is called a finite-dimensional graph if it has a finite number of edges and vertices. A graph is weighted if each adjacent x and y is assigned a weight function ω(x,y). Here ω:Ω×Ω→[0,+∞) satisfies that ω(x,y)=ω(y,x) and ω(x,y)>0 if and only if x∼y. Throughout this paper, T=(Ω,E) is assumed to be a weighted finite-dimensional graph with Ω={1,2,…,n}.
In order to describe our problem more conveniently, we first introduce the following discrete p-Laplacian operators defined on a network.
Definition 1.1. For a function v:Ω→R and p∈(2,+∞), the discrete p-Laplacian Δpω on Ω is defined by
Δpωv(x):=∑y∼x,y∈Ω|v(y)−v(x)|p−2(v(y)−v(x))ω(x,y). | (1.1) |
When p=2, it is called the discrete Laplacian Δω:=Δ2ω on Ω, which is defined by
Δωv(x):=∑y∼x,y∈Ω(v(y)−v(x))ω(x,y). | (1.2) |
Recently, the classical Laplacian Δ was substituted by the discrete Laplacian Δω in graph Laplacian problems, and various methods and techniques to study the existence and qualitative properties of solutions have been developed [2,5,6,7,8,9]. Here we should emphasize that the discrete p-Laplacian operator Δpω(p>2) is actually nonlinear, which is different from the classical Laplacian Δ or the discrete Laplacian Δω.
We are mainly interested in studying the blow-up properties of the solution of the following mutualistic model with a p-Laplacian (p>2) defined on the networks
{∂v1∂t−d1Δpωv1=v1(a1−b1v1+c1v2),x∈Ω,t∈(0,+∞),∂v2∂t−d2Δpωv2=v2(a2+c2v1−b2v2),x∈Ω,t∈(0,+∞),v1(x,0)=v01(x)≥(≢)0, v2(x,0)=v02(x)≥(≢)0,x∈Ω. | (1.3) |
Here vi represents the spatial density of the ith species at time t and di represents its respective diffusion rate. The nonnegative constant ai is the birth rate, bi is its respective intraspecific competition and the parameter ci denotes the interspecific cooperation of the ith species.
Under the condition that Δpω is replaced by the classical Laplacian in (1.3), the strong mutualistic (b1/c1<c2/b2) population-based dynamical system experiences blow-up if the intrinsic growth rates of the population are large or the initial data size is sufficiently large [10]. In the case that p=2 in (1.3), Liu et al. [1] proved that the solution blows up for all x∈Ω, min{v01(x),v02(x)}≢0, under the strong mutualistic condition b1/c1<c2/b2 and given min{a1/d1,a2/d2}≥1.
In this paper, when p>2, we can overcome the difficulties caused by the nonlinear operator p-Laplacian Δpω and study the blow-up properties for the solution of system (1.3). First, we prove the Green formula for the nonlinear operator Δpω and consider the eigenvalue problem Δpω. Second, with the help of the following important inequality (see Lemma 2.4)
|b−a|p−2(b−a)≤2p−2[|b|p−2b−|a|p−2a]with b≥a, |
the comparison principle of system (1.3) is constructed (see Theorem 2.5). Finally, we propose a new strong mutualistic condition
b1c1<(d1d2)1p−2<c2b2. | (1.4) |
When condition (1.4) holds, it is proved that the solution of (1.3) blows up for all x∈Ω, min{v01(x),v02(x)}≢0 (see Theorem 3.2).
Lemma 2.1. (Green formula for Δpω) For any functions u,v:Ω→R, the p-Laplacian Δpω satisfies that
2∑x∈Ωu(x)(−Δpω)v(x)=∑x,y∈Ω|v(y)−v(x)|p−2(v(y)−v(x))(u(y)−u(x))ω(x,y). | (2.1) |
Moreover, if u=v, we have
2∑x∈Ωv(x)(−Δpω)v(x)=∑x,y∈Ω|v(y)−v(x)|pω(x,y). | (2.2) |
Proof. Using (1.1), we get
∑x∈Ωu(x)(−Δpω)v(x)=−∑x∈Ωu(x)∑y∼x,y∈Ω|v(y)−v(x)|p−2(v(y)−v(x))ω(x,y)=−∑x,y∈Ωu(x)|v(y)−v(x)|p−2(v(y)−v(x))ω(x,y). | (2.3) |
Meanwhile, we also deduce that
∑x∈Ωu(x)(−Δpω)v(x)=−∑x,y∈Ωu(y)|v(y)−v(x)|p−2(v(x)−v(y))ω(x,y)=∑x,y∈Ωu(y)|v(y)−v(x)|p−2(v(y)−v(x))ω(x,y). | (2.4) |
Hence, using (2.3) and (2.4), we obtain
2∑x∈Ωv(x)(−Δpω)u(x)=∑x,y∈Ω|u(y)−u(x)|p−2(u(y)−u(x))(v(y)−v(x))ω(x,y), |
which completes the proof.
Lemma 2.2. Consider the following eigenvalue problem:
{−Δpωφ(x)=λφ(x),x∈Ω,∑x∈Ωφ(x)=1. | (2.5) |
There exists
λ1:=minϕ≢0∑x,y∈Ω|φ(y)−φ(x)|pω(x,y)2∑x∈Ωφ2for φ:Ω→R | (2.6) |
and Φ1(x)>0 in Ω satisfying the conditions of the above system (2.5), and they are called the first eigenvalue and eigenfunction of (2.5), respectively. Furthermore, we have that λ1=0.
Proof. Multiplying the first equation of (2.5) by φ and integrating with respect to Ω, we get
∑x∈Ωφ(x)(−Δpω)φ(x)=∑x∈Ωλφ2. |
By (2.2), we deduce that
λ=∑x,y∈Ω|φ(y)−φ(x)|pω(x,y)2∑x∈Ωφ2. |
Hence we obtain
λ1:=minφ≢0∑x,y∈Ω|φ(y)−φ(x)|pω(x,y)2∑x∈Ωφ2, |
where the minimum can be attained by taking Φ1=1n, where n is the number of vertices in Ω and Φ1 satisfies that ∑x∈ΩΦ1(x)=1. Therefore, by taking Φ1=1n, we can get that λ1=0; the proof is completed.
Definition 2.3. For any T>0, assume that for each x∈Ω, ˆv1(x,⋅),ˆv2(x,⋅)∈C([0,T]) are differentiable in the range of (0,T]. If (ˆv1,ˆv2) satisfies the following:
{∂ˆv1∂t−d1Δpωˆv1≤(≥)ˆv1(a1−b1ˆv1+c1ˆv2),x∈Ω,t∈(0,T],∂ˆv2∂t−d2Δpωˆv2≤(≥)ˆv2(a2+c2ˆv1−b2ˆv2),x∈Ω,t∈(0,T],ˆv1(x,0)≤(≥)v01(x), ˆv2(x,0)≤(≥)v02(x),x∈Ω, | (2.7) |
(ˆv1,ˆv2) is called a lower solution (an upper solution) of (1.3) on Ω×[0,T].
It is worth noting that the existence of the nonlinear operator Δpω(p>2) introduces difficulties when we construct the comparison principle of system (1.3). We introduce the following classical inequalities which will be used in the proof of the comparison principle. For the proofs the readers can refer to [11] (Section 10).
Lemma 2.4. (Lemma B.4 in [12]) For p>2, Jp(t):=|t|p−2t, we have
22−p|b−a|p≤(b−a)(Jp(b)−Jp(a)),a,b∈R. |
Moreover, if b≥a, we have
Jp(b−a)≤2p−2[Jp(b)−Jp(a)]. | (2.8) |
With the help of inequality (2.8), we propose the following important comparison principle.
Theorem 2.5. (Comparison principle) Suppose that (v1,v2) is a solution of system (1.3). If (ˆv1,ˆv2) is a lower solution of (1.3) on Ω×[0,T], then (v1,v2)≥(ˆv1,ˆv2) for Ω×[0,T].
Proof. Denote z1:=(v1−ˆv1)e−Kt and z2:=(v2−ˆv2)e−Kt, where K>0 will be determined later. Notice that Ω is finite and zi(x,t)(i=1,2) is continuous in the range of [0,T] for each x∈Ω; there exists (x0,t0)∈Ω×[0,T] such that
z1(x0,t0)=minx∈Ω,t∈[0,T]z1(x,t), | (2.9) |
which immediately implies that
z1(x0,t0)≤z1(y,t0) for any y∈Ω. |
This is equivalent to
v1(x0,t0)−ˆv1(x0,t0)≤v1(y,t0)−ˆv1(y,t0) for any y∈Ω, | (2.10) |
and
v1(y,t0)−v1(x0,t0)≥ˆu1(v,t0)−ˆu1(v0,t0) for any y∈Ω. | (2.11) |
Recalling the definition of Δpω, we have
Δpωz1(x0,t0)≥0. | (2.12) |
At the same time, due to the differentiability of z1(x,t) in the range of (0,T], we obtain
∂z1∂t(x0,t0)≤0. | (2.13) |
Note that
Δpωz1(x,t)=e−Kt(p−1)Δpω(v1−ˆv1)(x,t)= e−Kt(p−1)∑y∼x,y∈Ω|(v1(y,t)−ˆv1(y,t))−(v1(x,t)−ˆv1(x,t))|p−2[(v1(y,t)−ˆv1(y,t))−(v1(x,t)−ˆv1(x,t))]ω(x,y)= e−Kt(p−1)∑y∼x,y∈Ω|(v1(y,t)−v1(x,t))−(ˆv1(y,t)−ˆv1(x,t))|p−2[(v1(y,t)−v1(x,t))−(ˆv1(y,t)−ˆv1(x,t))]ω(x,y); | (2.14) |
we have
Δpω(v1−ˆv1)(x0,t0)=∑y∼x0,y∈Ω|(v1(y,t0)−v1(x0,t0))−(ˆv1(y,t0)−ˆv1(x0,t0))|p−2[(v1(y,t0)−v1(x0,t0))−(ˆv1(y,t0)−ˆv1(x0,t0))]ω(x0,y). | (2.15) |
Denote
by:=v1(y,t0)−v1(x0,t0), ay:=ˆv1(y,t0)−ˆv1(x0,t0)andJp(t):=|t|p−2t. |
In view of (2.11), we have that by≥ay for any y∼x0 and y∈Ω. Combining this with (2.8) in Lemma 2.4, we deduce that
|by−ay|p−2(by−ay)=Jp(by−ay)≤2p−2[Jp(by)−Jp(ay)]=2p−2[|by|p−2by−|ay|p−2ay], |
which implies that
Δpω(v1−ˆv1)(x0,t0)= ∑y∼x0,y∈Ω|by−ay|p−2(by−ay)ω(x0,y)≤ 2p−2∑y∼x0,y∈Ω[|by|p−2by−|ay|p−2ay]ω(x0,y)= 2p−2[∑y∼x0,y∈Ω|by|p−2byω(x0,y)−∑y∼x0,y∈Ω|ay|p−2ayω(x0,y)]= 2p−2[Δpωv1(x0,t0)−Δpωˆv1(x0,t0)]. | (2.16) |
Combining (2.16) with (2.14), we have
Δpωz1(x0,t0)≤2p−2e−Kt0(p−1)[Δpωv1(x0,t0)−Δpωˆv1(x0,t0)]. | (2.17) |
Note that (v1,v2) is a solution and (ˆv1,ˆv2) is a lower solution to system (1.3). That is, (v1,v2) and (ˆv1,ˆv2) respectively satisfy
∂v1∂t−d1Δpωv1=v1(a1−b1v1+c1v2) | (2.18) |
and
∂ˆv1∂t−d1Δpωˆv1≤ˆv1(a1−b1ˆv1+c1ˆv2). | (2.19) |
Recall that z1:=(v1−ˆv1)e−Kt; we have
∂z1∂t=−Kz1+e−Kt(∂v1∂t−∂ˆv1∂t). | (2.20) |
Combining (2.18)–(2.20), we obtain
∂z1∂t≥−Kz1+e−Kt(d1Δpωv1+v1(a1−b1v1+c1v2)−d1Δpωˆv1+ˆv1(a1−b1ˆv1−c1ˆv2))=d1e−Kt[Δpωv1−Δpωˆv1]+(−K+a1−b1(v1+ˆv1)+c1v2)z1+c1ˆv1z2. | (2.21) |
Combining (2.17) with (2.21), we deduce that
2p−2e−Kt0(p−2)∂z1∂t(x0,t0)−d1Δpωz1(x0,t0)≥2p−2e−Kt0(p−2)[(−K+b11)z1(x0,t0)+b12z2(x0,t0)], | (2.22) |
where
b11:=a1−b1(v1(x0,t0)+ˆv1(x0,t0))+c1v2(x0,t0),b12:=c1ˆv1(x0,t0). | (2.23) |
Substituting (2.12) and (2.13) into (2.22), we deduce that
((−K+b11)z1+b12z2)(x0,t0)≤0. | (2.24) |
Next, we will prove that z1(x0,t0)≥0 by contradiction. Alternatively, suppose that z1(x0,t0)=−δ<0. Choosing
K:=|z2(x0,t0)|δ|b12(x0,t0)|+|b11(x0,t0)|+1, |
we obtain that ((−K+b11)z1+b12z2)(x0,t0)>0, which contradicts (2.24). Hence we have that z1(x0,t0)≥0. In view of (2.9), it follows that z1(x,t)≥0 for x∈Ω,t∈[0,T]. By a similar argument to that for z2, we can also obtain that z2(x,t)≥0 for x∈Ω,t∈[0,T]. Thus, we obtain that vi≥ˆvi (i=1,2) for x∈Ω,t∈[0,T].
Theorem 3.1. Let U(x,t) be a solution of the following problem:
{∂U∂t−dΔpωU=U(α+βU),x∈Ω,t∈(0,+∞),U(x,0)≥(≢)0,x∈Ω, | (3.1) |
where d,α and β are constants satisfying that d>0 and β>0. We have the following blow-up properties:
(i) When α≥0, U(x,t) blows up for all nontrivial initial data.
(ii) When α<0, U(x,t) blows up for sufficiently large initial data.
Proof. Denote M(t):=∑x∈ΩΦ1(x)U(x,t), where Φ1(x) is defined in Lemma 2.2. Deriving M(t) with respect to t and using (3.1), we have
dM′(t)=∑x∈ΩΦ1(x)[dΔpωU+U(α+βU)]. |
Note that Φ1(x) is a constant; then, due to (2.1) in Lemma 2.1, we have
∑x∈ΩΦ1(x)ΔpωU=−12∑x,y∈Ω|U(y)−U(x)|p−2(U(y,t)−U(x,t))(Φ1(y)−Φ1(x))ω(x,y)=0. |
Hence, combining the above equation with ∑x∈ΩΦ1(x)=1 in Lemma 2.2, we deduce that
dM′(t)=∑x∈ΩΦ1(x)U(α+βU)=αM(t)+β∑x∈ΩΦ1(x)U2=αM(t)+β∑x∈ΩΦ1(x)U2∑x∈ΩΦ1(x)≥αM(t)+β(∑x∈ΩΦ1(x)U)2=αM(t)+βM2(t), | (3.2) |
where Hölder's inequality is used.
When α≥0, using (3.2), we immediately obtain the blow-up result.
When α<0, we choose a sufficiently large initial function U(x,0) which satisfies
M(0)=∑x∈ΩΦ1(x)U(x,0)>−αβ. |
It follows from (3.2) that U(x,t) blows up.
Theorem 3.2. If the strong mutualistic condition
b1c1<(d1d2)1p−2<c2b2 |
is satisfied, the solution (v1,v2) of (1.3) blows up for all x∈Ω, min{v01(x),v02(x)}≢0.
Proof. We define (ˆv1(x,t),ˆv2(x,t)):=(δ1U(x,t),δ2U(x,t)), where the constants δ1,δ2 and function U(x,t) will be determined later. In order to ensure that (ˆv1(x,t),ˆv2(x,t)) is a lower solution of (1.3), we need to prove that (ˆv1(x,t),ˆv2(x,t))≤(v01(x),v02(x)) and
{∂U∂t−d1δp−21ΔpωU≤U(a1−b1δ1U+c1δ2U),(x,t)∈Ω×(0,∞),∂U∂t−d2δp−22ΔpωU≤U(a2+c2δ1U−b2δ2U),(x,t)∈Ω×(0,∞). | (3.3) |
Since the parameters satisfy that b1c1<(d1d2)1p−2<c2b2, by calculation, we get
c1(d1d2)1p−2−b1>0 and c2−b2(d1d2)1p−2>0. | (3.4) |
Thus, for a sufficiently small positive constant ε, we choose δ1:=ε,δ2:=(d1d2)1p−2ε such that d1δp−21=d2δp−22,
−b1δ1+c1δ2=ε[c1(d1d2)1p−2−b1]>0 and c2δ1−b2δ2=ε[c2−b2(d1d2)1p−2]>0. | (3.5) |
Denote
d:=d1δp−21=d2δp−22, α:=min{a1,a2}≥0, β:=min{−b1δ1+c1δ2,c2δ1−b2δ2}. | (3.6) |
To prove (3.3), it suffices to show the following:
∂U∂t−dΔpωU≤U(α+βU),x∈Ω,t∈(0,T]. | (3.7) |
Hence (ˆv1(x,t),ˆv2(x,t)) is a lower solution of (1.3) provided that (ˆv1(x,0),ˆv2(x,0))≤(v01(x),v02(x)). Let w(x,0):=min{v01(x),v02(x)} and ε be small enough such that δ1,δ2<1. Thus, (ˆv1(x,0),ˆv2(x,0))≤(v01(x),v02(x)) holds.
Let U be a solution of the following problem:
{∂U∂t−dΔpωU=U(α+βU),x∈Ω,t∈(0,∞),U(x,0)≥(≢)0,x∈Ω. | (3.8) |
By applying Theorem 3.1 to U, we have that U(x,t) blows up, which implies that (ˆv1(x,t),ˆv2(x,t)) blows up. With the help of Lemma 2.2, the blow-up properties of the solution of system (1.3) are then obtained.
This research contributes to the blow-up properties of a p-Laplacian (p>2) reaction-diffusion system based on weighted graphs. The discrete p-Laplacian operator Δpω(p>2) is actually nonlinear, which is different from the classical Laplacian Δ or the discrete Laplacian Δω. To overcome the difficulties caused by the nonlinearity, we establish Green Formula and comparison principle for the p-Laplacian operator. Hence, we develop a new strong mutualistic condition and prove the blow-up properties of the solution for any nontrivial initial data. In this sense, we extend the blow-up results of models with a graph Laplacian (p=2) in [1] to a general graph p-Laplacian (p>2).
The authors declare that they have not used Artificial Intelligence tools in the creation of this article.
The authors would like to express their sincere thanks to the anonymous reviewers for their helpful comments. The work was partially supported by the National Natural Science Foundation of China (11771380) and Natural Science Foundation of Jiangsu Province (BK20191436).
The authors declare that there are no conflicts of interest.
[1] |
Z. Liu, J. Chen, C. Tian, Blow-up in a net work mutualistic model, Appl. Math. Lett., 106 (2020), 106402. https://doi.org/10.1016/j.aml.2020.106402 doi: 10.1016/j.aml.2020.106402
![]() |
[2] |
Z. Liu, C. Tian, S. Ruan, On a network model of two competitors with applications to the invasion and competition of Aedes albopictus and Aedes aegypti mosquitoes in the United States, SIAM J. Appl. Math., 80 (2020), 929–950. https://doi.org/10.1137/19M1257950 doi: 10.1137/19M1257950
![]() |
[3] |
R. Pastor-Satorras, C. Castellano, P. Van Mieghem, A. Vespignani, Epidemic processes in complex networks, Rev. Modern Phys., 87 (2015), 925–986. https://doi.org/10.1103/RevModPhys.87.925 doi: 10.1103/RevModPhys.87.925
![]() |
[4] | R. V. Solé, J. Bascompte, Self-Organization in Complex Ecosystems, Princeton: Princeton University Press, 2006. |
[5] |
C. Tian, Q. Zhang, L. Zhang, Global stability in a networked SIR epidemic model, Appl. Math. Lett., 107 (2020), 106444. https://doi.org/10.1016/j.aml.2020.106444 doi: 10.1016/j.aml.2020.106444
![]() |
[6] |
F. Bauer, P. Horn, Y. Lin, G. Lippner, D. Mangoubi, S. T. Yau, Li-Yau inequality on graphs, J. Differential Geom., 99 (2015), 359–405. https://doi.org/10.4310/jdg/1424880980 doi: 10.4310/jdg/1424880980
![]() |
[7] |
A. Grigoryan, Y. Lin, Y. Yang, Yamabe type equations on graphs, J. Differential Equ., 261 (2016), 4924–4943. https://doi.org/10.1016/j.jde.2016.07.011 doi: 10.1016/j.jde.2016.07.011
![]() |
[8] |
C. Tian, Global stability of a networked predator-prey model, Appl. Math. Lett., 143 (2023), 108685. https://doi.org/10.1016/j.aml.2023.108685 doi: 10.1016/j.aml.2023.108685
![]() |
[9] |
C. Tian, S. Ruan, Pattern formation and synchronism in an allelopathic plankton model with delay in a network, SIAM J. Appl. Dyn. Syst., 18 (2019), 531–557. https://doi.org/10.1137/18M1204966 doi: 10.1137/18M1204966
![]() |
[10] |
K. I. Kim, Z. Lin, Blow-up in a three-species cooperating model, Appl. Math. Lett., 17 (2004), 89–94. https://doi.org/10.1016/S0893-9659(04)90017-1 doi: 10.1016/S0893-9659(04)90017-1
![]() |
[11] | P. Lindqvist, Notes on the p-Laplace Equation, Jyvaskyla: University of Jyvaskyla, Department of Mathematics and Statistics, 2017. |
[12] |
L. Brasco, E. Parini, The second eigenvalue of the fractional p-Laplacian, Adv. Calc. Var., 9 (2016), 323–355. https://doi.org/10.1515/acv-2015-0007 doi: 10.1515/acv-2015-0007
![]() |