With the growth of online networks, understanding the intricate structure of communities has become vital. Traditional community detection algorithms, while effective to an extent, often fall short in complex systems. This study introduced a meta-heuristic approach for community detection that leveraged a memetic algorithm, combining genetic algorithms (GA) with the stochastic hill climbing (SHC) algorithm as a local optimization method to enhance modularity scores, which was a measure of the strength of community structure within a network. We conducted comprehensive experiments on five social network datasets (Zachary's Karate Club, Dolphin Social Network, Books About U.S. Politics, American College Football, and the Jazz Club Dataset). Also, we executed an ablation study based on modularity and convergence speed to determine the efficiency of local search. Our method outperformed other GA-based community detection methods, delivering higher maximum and average modularity scores, indicative of a superior detection of community structures. The effectiveness of local search was notable in its ability to accelerate convergence toward the global optimum. Our results not only demonstrated the algorithm's robustness across different network complexities but also underscored the significance of local search in achieving consistent and reliable modularity scores in community detection.
Citation: Dongwon Lee, Jingeun Kim, Yourim Yoon. Improving modularity score of community detection using memetic algorithms[J]. AIMS Mathematics, 2024, 9(8): 20516-20538. doi: 10.3934/math.2024997
[1] | Bertrand Haut, Georges Bastin . A second order model of road junctions in fluid models of traffic networks. Networks and Heterogeneous Media, 2007, 2(2): 227-253. doi: 10.3934/nhm.2007.2.227 |
[2] | Mohamed Benyahia, Massimiliano D. Rosini . A macroscopic traffic model with phase transitions and local point constraints on the flow. Networks and Heterogeneous Media, 2017, 12(2): 297-317. doi: 10.3934/nhm.2017013 |
[3] | Caterina Balzotti, Maya Briani . Estimate of traffic emissions through multiscale second order models with heterogeneous data. Networks and Heterogeneous Media, 2022, 17(6): 863-892. doi: 10.3934/nhm.2022030 |
[4] | Emiliano Cristiani, Smita Sahu . On the micro-to-macro limit for first-order traffic flow models on networks. Networks and Heterogeneous Media, 2016, 11(3): 395-413. doi: 10.3934/nhm.2016002 |
[5] | Maya Briani, Emiliano Cristiani . An easy-to-use algorithm for simulating traffic flow on networks: Theoretical study. Networks and Heterogeneous Media, 2014, 9(3): 519-552. doi: 10.3934/nhm.2014.9.519 |
[6] | Alberto Bressan, Khai T. Nguyen . Conservation law models for traffic flow on a network of roads. Networks and Heterogeneous Media, 2015, 10(2): 255-293. doi: 10.3934/nhm.2015.10.255 |
[7] | Simone Göttlich, Camill Harter . A weakly coupled model of differential equations for thief tracking. Networks and Heterogeneous Media, 2016, 11(3): 447-469. doi: 10.3934/nhm.2016004 |
[8] | Paola Goatin . Traffic flow models with phase transitions on road networks. Networks and Heterogeneous Media, 2009, 4(2): 287-301. doi: 10.3934/nhm.2009.4.287 |
[9] | Michael Herty, Adrian Fazekas, Giuseppe Visconti . A two-dimensional data-driven model for traffic flow on highways. Networks and Heterogeneous Media, 2018, 13(2): 217-240. doi: 10.3934/nhm.2018010 |
[10] | Alberto Bressan, Ke Han . Existence of optima and equilibria for traffic flow on networks. Networks and Heterogeneous Media, 2013, 8(3): 627-648. doi: 10.3934/nhm.2013.8.627 |
With the growth of online networks, understanding the intricate structure of communities has become vital. Traditional community detection algorithms, while effective to an extent, often fall short in complex systems. This study introduced a meta-heuristic approach for community detection that leveraged a memetic algorithm, combining genetic algorithms (GA) with the stochastic hill climbing (SHC) algorithm as a local optimization method to enhance modularity scores, which was a measure of the strength of community structure within a network. We conducted comprehensive experiments on five social network datasets (Zachary's Karate Club, Dolphin Social Network, Books About U.S. Politics, American College Football, and the Jazz Club Dataset). Also, we executed an ablation study based on modularity and convergence speed to determine the efficiency of local search. Our method outperformed other GA-based community detection methods, delivering higher maximum and average modularity scores, indicative of a superior detection of community structures. The effectiveness of local search was notable in its ability to accelerate convergence toward the global optimum. Our results not only demonstrated the algorithm's robustness across different network complexities but also underscored the significance of local search in achieving consistent and reliable modularity scores in community detection.
A taxis is the movement of an organism in response to a stimulus such as chemical signal or the presence of food. Taxes can be classified based on the types of stimulus, such as chemotaxis, prey-taxis, galvanotaxis, phototaxis and so on. According to the direction of movements, the taxis is said to be attractive (resp. repulsive) if the organism moves towards (resp. away from) the stimulus. In the ecosystem, a widespread phenomenon is the prey-taxis, where predators move up the prey density gradient, which is often referred to as the direct prey-taxis. However some predators may approach the prey by tracking the chemical signals released by the prey, such as the smell of blood or specific odo, and such movement is called indirect prey-taxis (cf. [1]). Since the pioneering modeling work by Kareiva and Odell [2], prey-taxis models have been widely studied in recent years (cf. [3,4,5,6,7,8,9,10,11,12]), followed by numerous extensions, such as three-species prey-taxis models (cf. [13,14,15]) and predator-taxis models (cf. [16,17]). The indirect prey-taxis models have also been well studied (cf. [18,19,20]).
Recently, a predator-prey model with attraction-repulsion taxis mechanisms was proposed by Bell and Haskell in [21] to describe the interaction between direct prey-taxis and indirect chemotaxis, where the direct prey-taxis describes the predator's directional movement towards the prey density gradient, while the indirect chemotaxis models a defense mechanism in which the prey repels the predator by releasing odour chemicals (like a fox breaking wind in order to escape from hunting dogs). The model reads as
{ut=dΔu+u(a1−a2u−a3v),x∈Ω, t>0,vt=∇⋅(∇v+χv∇w−ξv∇u)+ρv(1−v)+ea3uv,x∈Ω, t>0,wt=ηΔw+ru−γw,x∈Ω, t>0,∇u⋅ν=∇v⋅ν=∇w⋅ν=0,x∈∂Ω,t>0,(u,v,w)(x,0)=(u0,v0,w0)(x),x∈Ω, | (1.1) |
where the unknown functions u(x,t), v(x,t) and w(x,t) denote the densities of the prey, predator and prey-derived chemical repellent, respectively, at position x∈Ω and time t>0. Here, Ω⊂Rn is a bounded domain (habitat of species) with smooth boundary ∂Ω, and ν is the unit outer normal vector of ∂Ω. The parameters d, η, χ, ξ, a1, a2, a3, e, ρ, r, γ are all positive, where χ>0 and ξ>0 denote the (attractive) prey-taxis and (repulsive) chemotaxis coefficients, respectively. The predator v is assumed to be a generalist, so that it has a logistic growth term ρv(1−v) with intrinsic growth rate ρ>0. More modeling details with biological interpretations are referred to in [21]. We remark that the predator-prey model with attraction-repulsion taxes has some similar structures to the so-called attraction-repulsion chemotaxis model proposed originally in [22], where the species elicit both attractive and repulsive chemicals (see [23,24,25,26] and references therein for some mathematical studies).
The initial data satisfy the following conditions:
v0∈C0(¯Ω),u0,w0∈W1,∞(Ω), and u0, v0, w0≩0 in ¯Ω. | (1.2) |
In [21], the global existence of strong solutions to (1.1) was established in one dimension (n=1), and the existence of nontrivial steady state solutions alongside pattern formation was studied by the bifurcation theory. The main purpose of this paper is to study the global dynamics of (1.1) in higher dimensional spaces, which are usually more physical in the real world. Specifically, we shall show the existence of global classical solutions in all dimensions and explore the global stability of constant steady states, by which we may see how parameter values play roles in determining these dynamical properties of solutions.
The first main result is concerned with the global existence and boundedness of solutions to (1.1). For the convenience of presentation, we let
K1=max{a1a2,‖u0‖L∞(Ω)}, K2=max{a1K1+a2K21,a3K1} | (1.3) |
and
K3(z)=23z−12zdz(n+2(z−1)K22z+1)z+12((z−1)(4z2+n)K21)z−12+23zz2d1z((z−1)ξ2z+1)z+1z((4z2+n)K21)1z. | (1.4) |
Then, the result on the global boundedness of solutions to (1.1) is stated as follows.
Theorem 1.1 (Global existence). Let Ω⊂Rn(n⩾1) be a bounded domain with smooth boundary and parameters d, η, χ, ξ, a1, a2, a3, e, ρ, r, γ be positive. If
ρ{>0,n⩽2,⩾2K3([n2]+1)[n2]+1,n>2, |
where K3(p) is defined in (1.4), then for any initial data (u0,v0,w0) satisfying (1.2), the system (1.1) admits a unique classicalsolution (u,v,w) satisfying
u, v,w∈C0(¯Ω×[0,+∞))∩C2,1(¯Ω×(0,+∞)), |
and u,v,w>0 in Ω×(0,+∞). Moreover, there exists a constant C>0 independent of t such that
‖u(⋅,t)‖W1,∞(Ω)+‖v(⋅,t)‖L∞(Ω)+‖w(⋅,t)‖W1,∞(Ω)⩽Cfor all t>0. |
Our next goal is to explore the large-time behavior of solutions to (1.1). Simple calculations show the system (1.1) has four possible homogeneous equilibria as classified below:
{(0,0,0), (0,1,0), (a1a2,0,ra1γa2),if a1⩽a3,(0,0,0), (0,1,0), (a1a2,0,ra1γa2),(u∗,v∗,w∗),if a1>a3, |
with
u∗=ρ(a1−a3)ρa2+ea23,v∗=ea1a3+ρa2ρa2+ea23,w∗=rρ(a1−a3)γ(ρa2+ea23) | (1.5) |
where the trivial equilibrium (0,0,0) is called the extinction steady state, (0,1,0) is the predator-only steady state, and (u∗,v∗,w∗) is the coexistence steady state. We shall show that if a1>a3, then the coexistence steady state is globally asymptotically stable with exponential convergence rate, provided that ξ and χ are suitably small, while if a1⩽a3, the predator-only steady state is globally asymptotically stable with exponential or algebraic convergence rate when ξ and χ are suitably small. To state our results, we denote
Γ=4dρ(a1−a3)K21(ea1a3+ρa2),Φ=2a2ρa23+e,Ψ=γηa23K21(ρa2+ea23)dρ2r2(a1−a3) | (1.6) |
and
A=ξ24d,B=ea2a1,D=16ηγa1r2, | (1.7) |
where K1 is defined in (1.3). Then, the global stability result is stated in the following theorem.
Theorem 1.2 (Global stability). Let the assumptions in Theorem 1.1 hold. Then, the following results hold.
(1) Let a1>a3. If ξ and χ satisfy
ξ2<Γ(Φ+√Φ2−e2) and χ2<Ψmaxy∈[a,b](Γy−ξ2)(−y2+2Φy−e2)y, |
where a=max{ξ2Γ,Φ−√Φ2−e2},b=Φ+√Φ2−e2, then there exist some constants T∗, C, α>0 such that the solution (u,v,w) obtained in Theorem 1.1 satisfies for all t⩾T∗
‖u(⋅,t)−u∗‖L∞(Ω)+‖v(⋅,t)−v∗‖L∞(Ω)+‖w(⋅,t)−w∗‖L∞(Ω)⩽Ce−αt. |
(2) Let a1⩽a3, If ξ and χ satisfy
ξ2<4dea2a1andχ2<D(A+B−2√AB), |
then there exist some constants T∗, C, β>0 such that the solution (u,v,w) obtained in Theorem 1.1 satisfies, for all t⩾T∗,
‖u(⋅,t)‖L∞(Ω)+‖v(⋅,t)−1‖L∞(Ω)+‖w(⋅,t)‖L∞(Ω)⩽{Ce−βt if a1<a3,C(t+1)−1 if a1=a3. |
Remark 1.1. In the biological view, the relative sizes of a1 and a2 determine the coexistence of the system. The results indicated that a large a1a2 facilitates the coexistence of the species.
The rest of this paper is organized as follows. In Section 2, we state the local existence of solutions to (1.1) with extensibility conditions. Then, we deduce some a priori estimates and prove Theorem 1.1 in Section 3. Finally, we show the global convergence to the constant steady states and prove Theorem 1.2 in Section 4.
For convenience, in what follows we shall use Ci(i=1,2,⋯) to denote a generic positive constant which may vary from line to line. For simplicity, we abbreviate ∫t0∫Ωf(⋅,s)dxds and ∫Ωf(⋅,t)dx as ∫t0∫Ωf and ∫Ωf, respectively. The local existence and extensibility result of problem (1.1) can be directly established by the well-known Amman's theory for triangular parabolic systems (cf. [27,28]). Below, we shall present the local existence theorem without proof for brevity, and we refer to [21] for the proof in one dimension as a reference.
Lemma 2.1 (Local existence and extensibility). Let Ω⊂Rn be a bounded domain with smooth boundary. The parameters d, η, χ, ξ, a1, a2, a3, e, ρ, r, γ are positive. Then, for the initial data (u0,v0,w0) satisfying (1.2), there exists Tmax∈(0,∞] such that the system (1.1) admits a unique classicalsolution (u,v,w) satisfying
u, v, w∈C0(¯Ω×[0,Tmax))∩C2,1(¯Ω×(0,Tmax)), |
and u,v,w>0 in Ω×(0,Tmax). Moreover, we have
either Tmax=+∞ or lim supt↗Tmax(‖u(⋅,t)‖W1,∞(Ω)+‖v(⋅,t)‖L∞(Ω)+‖w(⋅,t)‖W1,∞(Ω))=+∞. |
We recall some well-known results which will be used later frequently. The first one is an uniform Grönwall inequality [29].
Lemma 2.2. Let Tmax>0, τ∈(0,Tmax). Suppose that c1, c2, y are three positive locally integrable functions on (0,Tmax) such that y′ is locally integrable on (0,Tmax) and satisfies
y′(t)⩽c1(t)y(t)+c2(t)for all t∈(0,Tmax). |
If
∫t+τtc1⩽C1,∫t+τtc2⩽C2, ∫t+τty⩽C3for all t∈[0,Tmax−τ), |
where Ci(i=1,2,3) are positive constants, then
y(t)⩽(C3τ+C2)eC1for all t∈[τ,Tmax). |
Next, we recall a basic inequality [30].
Lemma 2.3. Let p∈[1,∞). Then, the following inequality holds:
∫Ω|∇u|2(p+1)⩽2(4p2+n)‖u‖2L∞(Ω)∫Ω|∇u|2(p−1)|D2u|2 |
for any u∈C2(ˉΩ) satisfying ∂u∂ν=0 on ∂Ω, where D2u denotes the Hessian of u.
The last one is a Gagliardo-Nirenberg type inequality shown in [31,Lemma 2.5].
Lemma 2.4. Let Ω be a bounded domain in R2 with smooth boundary. Then, for any φ∈W2,2(Ω) satisfying ∂φ∂ν|∂Ω=0, there exists a positive constant C depending only on Ω such that
‖∇φ‖L4(Ω)≤C(‖Δφ‖12L2(Ω)‖∇φ‖12L2(Ω)+‖∇φ‖L2(Ω)). | (2.1) |
In this section, we establish the global boundedness of solutions to the system (1.1). To this end, we will proceed with several steps to derive a priori estimates for the solution of the system (1.1). The first one is the uniform-in-time L∞(Ω) boundedness of u.
Lemma 3.1. Let (u,v,w) be the solution of (1.1) and K1 be as defined in (1.3). Then, we have
‖u‖L∞(Ω)⩽K1for all t∈(0,Tmax). |
Furthermore, there is a constant C>0 such that for any 0<τ<min{Tmax,1}, it follows that
∫t+τt|∇u|2≤C for all t∈(0,Tmax−τ). |
Proof. The result is a direct consequence of the maximum principle applied to the first equation in (1.1). Indeed, if we let ˉu=max{a1a2,‖u0‖L∞(Ω)}, then ˉu satisfies
{ˉut⩾dΔˉu+ˉu(a1−a2ˉu−a3v),x∈Ω,t>0,∇ˉu⋅ν=0,x∈∂Ω,t>0,ˉu(x,0)⩾u0(x),x∈Ω. |
Apparently, the comparison principle of parabolic equations gives u⩽ˉu on Ω×(0,Tmax).
Next, we multiply the first equation of (1.1) by u and integrate the result to get
ddt∫Ωu2+d∫Ω|∇u|2=a1∫Ωu2−∫Ωu(a2u+a3v)≤a1K21|Ω|. |
Then, the integration of the above inequality with respect to t over (t,t+τ) completes the proof by noting that ∫Ωu20 is bounded.
Having at hand the uniform-in-time L∞(Ω) boundedness of u, the a priori estimate of w follows immediately.
Lemma 3.2. Let (u,v,w) be the solution of (1.1). We can find a constant C>0 satisfying
‖w‖W1,∞(Ω)⩽Cfor all t∈(0,Tmax). |
Proof. Noting the boundedness of ‖u‖L∞(Ω) from Lemma 3.1, we get the desired result from the third equation of (1.1) and the regularity theorem [32,Lemma 1].
Now, the a priori estimate of v can be obtained as below.
Lemma 3.3. Let (u,v,w) be the solution of (1.1). Then, there exists a constant C>0 such that
∫Ωv⩽Cfor all t∈(0,Tmax), | (3.1) |
and
∫t+τt∫Ωv2⩽Cfor all t∈(0,Tmax−τ), | (3.2) |
where τ is a constant such that 0<τ<min{Tmax,1}.
Proof. Integrating the second equation of (1.1) over Ω by parts, using Young's inequality and Lemma 3.1, we find some constant C1>0 such that
ddt∫Ωv=ρ∫Ωv−ρ∫Ωv2+ea3∫Ωuv⩽(ρ+ea3supt∈(0,Tmax)‖u‖L∞(Ω))∫Ωv−ρ∫Ωv2⩽−∫Ωv−ρ2∫Ωv2+C1for all t∈(0,Tmax). | (3.3) |
Hence, (3.1) is obtained by the Grönwall inequality. Integrating (3.3) over (t,t+τ), we get (3.2) immediately.
Due to the estimates of u and v obtained in Lemmas 3.1 and 3.3 respectively, we have the following improved uniform-in-time L2(Ω) boundedness of ∇u and the space-time L2 boundedness of Δu when n=2.
Lemma 3.4. Let (u,v,w) be the solution of (1.1). If n=2, then we can find a constant C>0 such that
∫Ω|∇u|2⩽Cfor all t∈(0,Tmax) | (3.4) |
and
∫t+τt∫Ω|Δu|2⩽Cfor all t∈(0,Tmax−τ), | (3.5) |
where τ is defined in Lemma 3.3.
Proof. Integrating the first equation of (1.1) by parts and using Lemma 3.1, we find a constant C1>0 such that
ddt∫Ω|∇u|2=2∫Ω∇u⋅∇ut=−2∫ΩutΔu=−2∫ΩΔu(dΔu+a1u−a2u2−a3uv)⩽−2d∫Ω|Δu|2+C1∫Ω(v+1)|Δu|for all t∈(0,Tmax). | (3.6) |
The Gagliardo-Nirenberg inequality in Lemma 2.4, Young's inequality and Lemma 3.1 yield some constants C2,C3>0 satisfying
∫Ω|∇u|2=‖∇u‖2L2(Ω)⩽C2(‖Δu‖L2(Ω)‖u‖L2(Ω)+‖u‖2L∞(Ω))⩽d2∫Ω|Δu|2+C3 |
and
C1∫Ω(v+1)|Δu|⩽d2∫Ω|Δu|2+C3∫Ωv2+C3for all t∈(0,Tmax), |
which along with (3.6) imply
ddt∫Ω|∇u|2+∫Ω|∇u|2+d∫Ω|Δu|2⩽C3∫Ωv2+2C3for all t∈(0,Tmax). | (3.7) |
Then, applications of Lemma 2.2, 3.1 and 3.3 give (3.4). Finally, (3.5) can be obtained by integrating (3.7) over (t,t+τ).
Now, the uniform-in-time boundedness of v in L2(Ω) can be established when n=2.
Lemma 3.5. Let (u,v,w) be the solution of (1.1). If n=2, then there exists a constant C>0 such that
∫Ωv2⩽Cfor all t∈(0,Tmax). |
Proof. Multiplying the second equation of (1.1) by v, integrating the result by parts and using Young's inequality, we have
ddt∫Ωv2+2∫Ω|∇v|2=−2χ∫Ωv∇v⋅∇w+2ξ∫Ωv∇u⋅∇v+2ρ∫Ωv2−2ρ∫Ωv3+2ea3∫Ωuv2⩽∫Ω|∇v|2+2χ2‖∇w‖2L∞(Ω)∫Ωv2+2ξ2∫Ωv2|∇u|2+2ρ∫Ωv2−2ρ∫Ωv3+2ea3‖u‖L∞(Ω)∫Ωv2, |
which along with Lemma 3.1 and Lemma 3.2 gives some constant C1>0 such that
ddt∫Ωv2+∫Ω|∇v|2⩽2ξ2∫Ωv2|∇u|2+C1∫Ωv2−2ρ∫Ωv3for all t∈(0,Tmax). | (3.8) |
Using Lemmas 3.1 and 3.3, Hölder's inequality, Lemma 2.4 and Young's inequality, we find some constants C2,C3,C4>0 such that
2ξ∫Ωv2|∇u|2⩽2ξ‖v‖2L4(Ω)‖∇u‖2L4(Ω)⩽C2(‖∇v‖12L2(Ω)‖v‖12L2(Ω)+‖v‖L2(Ω))2(‖Δu‖12L2(Ω)‖u‖12L∞(Ω)+‖u‖L∞(Ω))2⩽C3(‖∇v‖L2(Ω)‖v‖L2(Ω)‖Δu‖L2(Ω)+‖∇v‖L2(Ω)‖v‖L2(Ω)+‖Δu‖L2(Ω)‖v‖2L2(Ω)+‖v‖2L2(Ω))⩽‖∇v‖2L2(Ω)+C4(1+‖Δu‖2L2(Ω))‖v‖2L2(Ω)for all t∈(0,Tmax). | (3.9) |
Furthermore, Young's inequality yields some constant C5>0 such that
C1∫Ωv2−2ρ∫Ωv3⩽C5for all t∈(0,Tmax). | (3.10) |
Substituting (3.9) and (3.10) into (3.8), we get
ddt∫Ωv2⩽C4(1+‖Δu‖2L2(Ω))‖v‖2L2(Ω)+C5for all t∈(0,Tmax), |
which alongside Lemma 2.2, Lemma 3.3 and Lemma 3.4 completes the proof.
To get the global existence of solutions in any dimensions, we derive the following functional inequality which gives an a priori estimate on ∇u.
Lemma 3.6. Let (u,v,w) be the solution of (1.1) and q⩾2. If n⩾1, then there exists a constant C>0 such that
ddt∫Ω|∇u|2q+dq∫Ω|∇u|2(q−1)|D2u|2⩽q(n+2(q−1))K22d∫Ω(v2+1)|∇u|2(q−1)+Cfor all t∈(0,Tmax), |
where K2 is defined in (1.3).
Proof. From the first equation of (1.1) and the fact 2∇u⋅∇Δu=Δ|∇u|2−2|D2u|2, it follows that
ddt∫Ω|∇u|2q=2q∫Ω|∇u|2(q−1)∇u⋅∇ut=2q∫Ω|∇u|2(q−1)∇u⋅∇(dΔu+a1u−a2u2−a3uv)=dq∫Ω|∇u|2(q−1)Δ|∇u|2−2dq∫Ω|∇u|2(q−1)|D2u|2+2q∫Ω|∇u|2(q−1)∇u⋅∇(a1u−a2u2−a3uv) |
which implies
ddt∫Ω|∇u|2q+2dq∫Ω|∇u|2(q−1)|D2u|2=dq∫Ω|∇u|2(q−1)Δ|∇u|2+2q∫Ω|∇u|2(q−1)∇u⋅∇(a1u−a2u2−a3uv)=:I1+I2for all t∈(0,Tmax). | (3.11) |
Now, we estimate the right hand side of (3.11). Choosing s∈(0,12) and
θ=12−s+12n−q12−1n−q∈(0,1), |
we get
12−s+12n=θ(12−1n)+(1−θ)q, |
which, along with the Gagliardo-Nirenberg inequality, Young's inequality and the embedding
Ws+12,2(Ω)⊂Ws,2(∂Ω)⊂L2(∂Ω), |
gives some constants C1, C2, C3, C4>0 such that
∫∂Ω|∇u|2(q−1)∂|∇u|2∂ν⩽C1∫∂Ω|∇u|2q=C1‖|∇u|q‖2L2(∂Ω)⩽C2‖|∇u|q‖2Ws+12,2(Ω)⩽C3‖∇|∇u|q‖2θL2(Ω)‖|∇u|q‖2(1−θ)L1q(Ω)+C3‖|∇u|q‖2L1q(Ω)⩽2(q−1)q2‖∇|∇u|q‖2L2(Ω)+C4for all t∈(0,Tmax). |
Therefore, it holds that
I1=dq∫∂Ω|∇u|2(q−1)∂|∇u|2∂ν−dq∫Ω∇|∇u|2(q−1)⋅∇|∇u|2⩽2d(q−1)q∫Ω|∇|∇u|q|2+C4dq−4d(q−1)q∫Ω|∇|∇u|q|2⩽−2d(q−1)q∫Ω|∇|∇u|q|2+C4dqfor all t∈(0,Tmax). |
Owning to the fact |Δu|⩽√n|D2u|, Young's inequality and Lemma 3.1, we have
I2=−2q(q−1)∫Ω(a1u−a2u2−a3uv)|∇u|2(q−2)∇|∇u|2⋅∇u−2q∫Ω(a1u−a2u2−a3uv)|∇u|2(q−1)Δu⩽2q(q−1)K2∫Ω(v+1)|∇u|2(q−2)|∇|∇u|2||∇u|+2q√nK2∫Ω(v+1)|∇u|2(q−1)|D2u|⩽qd(q−1)2∫Ω|∇u|2(q−2)|∇|∇u|2|2+2q(q−1)K22d∫Ω(v2+1)|∇u|2(q−1)+dq∫Ω|∇u|2(q−1)|D2u|2+qnK22d∫Ω(v2+1)|∇u|2(q−1)=2d(q−1)q∫Ω|∇|∇u|q|2+dq∫Ω|∇u|2(q−1)|D2u|2+q(n+2(q−1))K22d∫Ω(v2+1)|∇u|2(q−1)for all t∈(0,Tmax), |
where K2 is defined in (1.3). Hence, substituting the estimates I1 and I2 into (3.11), we finish the proof of the lemma.
Now, we show the following functional inequality to derive the a priori estimate on v in any dimensions.
Lemma 3.7. Let (u,v,w) be the solution of (1.1) and q⩾2. If n⩾1, we can find a constant C>0 such that
ddt∫Ωvq+2(q−1)q∫Ω|∇vq2|2+ρq∫Ωvq+1⩽q(q−1)ξ2∫Ωvq|∇u|2+C∫Ωvq |
for all t∈(0,Tmax).
Proof. Utilizing the second equation of (1.1) and integration by parts, we get
ddt∫Ωvq=q∫Ωvq−1vt=q∫Ωvq−1(∇⋅(∇v+χv∇w−ξv∇u)+v(ρ(1−v)+ea3u))=−q(q−1)∫Ωvq−2|∇v|2−χq(q−1)∫Ωvq−1∇w⋅∇v+ξq(q−1)∫Ωvq−1∇u⋅∇v+ρq∫Ωvq−ρq∫Ωvq+1+ea3q∫Ωuvq. | (3.12) |
Now, we estimate the right hand side of (3.12). An application of Young's inequality and Lemma 3.2 yields some constant C1>0 such that
−χq(q−1)∫Ωvq−1∇w⋅∇v⩽χq(q−1)supt∈(0,Tmax)‖∇w‖L∞(Ω)∫Ωvq−1|∇v|⩽q(q−1)4∫Ωvq−2|∇v|2+C1∫Ωvq |
and
ξq(q−1)∫Ωvq−1∇u⋅∇v⩽q(q−1)4∫Ωvq−2|∇v|2+q(q−1)ξ2∫Ωvq|∇u|2, |
which along with (3.12), Lemma 3.1 and the fact
vq−2|∇v|2=4q2|∇vq2|2 |
gives a constant C2>0 such that
ddt∫Ωvq+2(q−1)q∫Ω|∇vq2|2⩽q(q−1)ξ2∫Ωvq|∇u|2+(ρq+C1)∫Ωvq−ρq∫Ωvq+1+ea3q∫Ωuvq⩽q(q−1)ξ2∫Ωvq|∇u|2−ρq∫Ωvq+1+C2∫Ωvqfor all t∈(0,Tmax). |
Hence, we finish the proof of the lemma.
Combining Lemmas 3.6 and 3.7, we have the following inequality which can help us to achieve the global existence of solutions in any dimensions.
Lemma 3.8. Let (u,v,w) be the solution of (1.1) and p⩾2. If n⩾1, we can find a constant C>0 such that
ddt(∫Ω|∇u|2p+∫Ωvp)+2(p−1)p∫Ω|∇vp2|2+∫Ω|∇u|2p+∫Ωvp⩽(K3(p)−ρp2)∫Ωvp+1+Cfor all t∈(0,Tmax), |
where K3(p) is defined in (1.4).
Proof. Combining Lemmas 3.6 and 3.7, we see for any p=q⩾2 there exists a constant C1>0 such that for all t∈(0,Tmax)
ddt(∫Ω|∇u|2p+∫Ωvp)+2(p−1)p∫Ω|∇vp2|2+dp∫Ω|∇u|2(p−1)|D2u|2+ρp∫Ωvp+1⩽p(n+2(p−1))K22d∫Ωv2|∇u|2(p−1)+p(p−1)ξ2∫Ωvp|∇u|2+C1∫Ω|∇u|2(p−1)+C1∫Ωvp+C1. | (3.13) |
Now, we estimate the right hand side of the above inequality. Indeed, owing to Lemma 2.3 and Young's inequality, for all t∈(0,Tmax), we have
p(n+2(p−1))K22d∫Ωv2|∇u|2(p−1)⩽dp8(4p2+n)‖u‖2L∞(Ω)∫Ω|∇u|2(p+1)+2p+1(dp(p+1)8(p−1)(4p2+n)‖u‖2L∞(Ω))−p−12(p(n+2(p−1))K22d)p+12∫Ωvp+1⩽dp4∫Ω|∇u|2(p−1)|D2u|2+23p−12pdp(n+2(p−1)K22p+1)p+12((p−1)(4p2+n)K21)p−12∫Ωvp+1 |
and
p(p−1)ξ2∫Ωvp|∇u|2⩽dp8(4p2+n)‖u‖2L∞(Ω)∫Ω|∇u|2(p+1)+pp+1(dp(p+1)8(4p2+n)‖u‖2L∞(Ω))−1p(p(p−1)ξ2)p+1p∫Ωvp+1⩽dp4∫Ω|∇u|2(p−1)|D2u|2+23pp2d1p((p−1)ξ2p+1)p+1p((4p2+n)K21)1p∫Ωvp+1, |
where K1 and K2 are defined in (1.3). Similarly, we can find a constant C2>0 such that
C1∫Ω|∇u|2(p−1)⩽dp8(4p2+n)‖u‖2L∞(Ω)∫Ω|∇u|2(p+1)+C2⩽dp4∫Ω|∇u|2(p−1)|D2u|2+C2for all t∈(0,Tmax). |
Substituting the above estimates into (3.13), we get
ddt(∫Ω|∇u|2p+∫Ωvp)+2(p−1)p∫Ω|∇vp2|2+dp4∫Ω|∇u|2(p−1)|D2u|2+ρp∫Ωvp+1⩽K3(p)∫Ωvp+1+C1∫Ωvp+C1+C2for all t∈(0,Tmax), | (3.14) |
where K3(p) is given in (1.4). Furthermore, we can use Young's inequality and Lemma 2.3 to get a constant C3>0 such that
(C1+1)∫Ωvp⩽ρp2∫Ωvp+1+C3, |
and
∫Ω|∇u|2p⩽dp8(4p2+n)‖u‖2L∞(Ω)∫Ω|∇u|2(p+1)+C3⩽dp4∫Ω|∇u|2(p−1)|D2u|2+C3for all t∈(0,Tmax), |
which together with (3.14) finishes the proof.
Next, we shall deduce a criterion of global boundedness of solutions for the system (1.1) inspired by an idea of [33].
Lemma 3.9. Let n⩾1. If there exist M>0 and p0>n2 such that
∫Ωvp0⩽Mfor all t∈(0,Tmax), | (3.15) |
then Tmax=+∞. Moreover, there exists C>0 such that
‖u(⋅,t)‖W1,∞(Ω)+‖v(⋅,t)‖L∞(Ω)+‖w(⋅,t)‖W1,∞(Ω)⩽Cfor all t>0. |
Proof. We divide the proof into two steps.
Step 1: We claim that there exists a constant C1>0 such that
∫Ωv2p0⩽C1for all t∈(0,Tmax). |
Indeed, due to Lemma 3.8, for any p=2p0, there exists a constant C2>0 such that
ddt(∫Ω|∇u|4p0+∫Ωv2p0)+2p0−1p0∫Ω|∇vp0|2+∫Ω|∇u|4p0+∫Ωv2p0⩽(K3(2p0)−ρp0)∫Ωv2p0+1+C2for all t∈(0,Tmax). | (3.16) |
Let
θ=nn+22p0+22p0+1∈(0,1). |
Then, 2p0+12p0θ<1 due to p0>n2. By the Gagliardo-Nirenberg inequality, Young's inequality and (3.15), we can find some constants C3,C4>0 such that
(K3(2p0)−ρp0)∫Ωv2p0+1=(K3(2p0)−ρp0)‖vp0‖2p0+1p0L2p0+1p0(Ω)⩽C3(‖vp0‖2p0+1p0(1−θ)L1(Ω)‖∇vp0‖2p0+1p0θL2(Ω)+‖vp0‖2p0+1p0L1(Ω))⩽C3(M2p0+1p0(1−θ)‖∇vp0‖2p0+1p0θL2(Ω)+M2p0+1p0)⩽2p0−1p0∫Ω|∇vp0|2+C4for all t∈(0,Tmax), |
which along with (3.16) implies
ddt(∫Ω|∇u|4p0+∫Ωv2p0)+∫Ω|∇u|4p0+∫Ωv2p0⩽C2+C4for all t∈(0,Tmax). |
Therefore, the claim follows from the Grönwall inequality applied to the above inequality.
Step 2: Thanks to the regularity theorem [32,Lemma 1], we can find a constant C5>0 such that ‖∇u‖L∞(Ω)⩽C5 due to 2p0>n. With (3.12) and Lemmas 3.1 and 3.2, we get a constant C6>0 such that for any p⩾2
ddt∫Ωvp+p(p−1)∫Ωvp−2|∇v|2⩽p(p−1)(C6χ+C5ξ)∫Ωvp−1|∇v|+p(ρ+ea3K1)∫Ωvp. | (3.17) |
Thanks to Young's inequality, we find a constant C7>0 such that
p(p−1)(C6χ+C5ξ)∫Ωvp−1|∇v|⩽p(p−1)2∫Ωvp−2|∇v|2+C7p(p−1)∫Ωvp, |
which together with (3.17) implies
ddt∫Ωvp+p(p−1)∫Ωvp+2(p−1)p∫Ω|∇vp2|2⩽p(p−1)C8∫Ωvp, | (3.18) |
with C8=C7+ρ+ea3K1+1. Applying 1+pn⩽(1+p)n and the following inequality [34]
‖f‖2L2⩽ε‖∇f‖2L2+C9(1+ε−n2)‖f‖2L1, |
with f=vp2 and ε=2p2C8, we find a constant C10>0 such that
p(p−1)C8∫Ωup⩽2(p−1)p∫Ω|∇up2|2+C10p(p−1)(1+pn)(∫Ωup2)2. | (3.19) |
Substituting (3.19) into (3.18), we have
ddt∫Ωup+p(p−1)∫Ωup⩽C10p(p−1)(1+p)n(∫Ωup2)2. |
Then, employing the standard Moser iteration in [35] or a similar argument as in [34], we can prove that there exists a constant C11>0 such that
‖v‖L∞(Ω)⩽C11for all t∈(0,Tmax). |
Thus, with the help of Lemma 3.2, we finish the proof.
Now, utilizing the criterion in Lemma 3.9, we prove the global existence and boundedness of solutions for the system (1.1).
Proof of Theorem 1.1. If n⩽2, then the conclusion of the theorem can be obtained by Lemmas 3.3, 3.5 and 3.9. If n⩾3 and
ρ⩾2K3([n2]+1)[n2]+1, |
then according to Lemma 3.8, by fixing p=[n2]+1 we can find a constant C1>0 such that
ddt(∫Ω|∇u|2[n2]+2+∫Ωv[n2]+1)+∫Ω|∇u|2[n2]+2+∫Ωv[n2]+1⩽C1for all t∈(0,Tmax), |
which along with the Grönwall inequality gives a constant C2>0,
∫Ωv[n2]+1⩽C2for all t∈(0,Tmax). |
Together with Lemma 3.9, we finish the proof by Lemma 2.1.
In this section, we will employ suitable Lyapunov functionals to study the large-time behavior of u, v and w. We first improve the regularity of the solution.
Lemma 4.1. There exist constants θ1,θ2,θ3∈(0,1) and C>0 such that
‖u‖C2+θ1,1+θ12(¯Ω×[t,t+1])+‖v‖C2+θ2,1+θ22(¯Ω×[t,t+1])+‖w‖C2+θ3,1+θ32(¯Ω×[t,t+1])⩽Cfor all t>1. |
In particular, one can find C>0 such that
‖∇u‖L∞(Ω)+‖∇v‖L∞(Ω)+‖∇w‖L∞(Ω)⩽Cfor all t>1. |
Proof. The conclusion is a consequence of the regularity of parabolic equations in [36].
We split our analysis into two cases: a1>a3 and a1⩽a3.
We know that there are four homogeneous equilibria (0,0,0), (0,1,0), (a1a2,0,ra1γa2) and (u∗,v∗,w∗) when a1>a3, where u∗,v∗ and w∗ are defined in (1.5). In this case, we shall prove the coexistence steady state (u∗,v∗,w∗) is globally exponentially stable under certain conditions. Define an energy functional for (1.1) as follows:
F(t)=ε1∫Ω(u−u∗−u∗lnuu∗)+∫Ω(v−v∗−v∗lnvv∗)+ε22∫Ω(w−w∗)2, |
where ε1 and ε2 are to be determined below.
Proof of Theorem 1.2–(1). We complete the proof in four steps.
Step 1: The parameters ε1 and ε2 can be chosen in the following way. First, we recall from (1.5) and (1.6) that
Γ=4du∗K21v∗,Φ=2a2ρa23+e,Ψ=γηa23K21dρ2r2u∗. | (4.1) |
Let
f(y)=Ψ(Γy−ξ2)(−y2+2Φy−e2)y,y>0. |
It is clear that f∈C0((0,+∞)). Then, if
ξ2Γ<Φ+√Φ2−e2, |
the following holds:
ξ2K21v∗4du∗<2a2ρa23+e+2a3√a2ρ(a2ρa23+e). | (4.2) |
Under (4.2), we let a=max{ξ2Γ,Φ−√Φ2−e2} and b=Φ+√Φ2−e2 with a<b. Then, f(y) is continuous on [a,b] with f(a)=f(b)=0, and consequently f(y) must attain the maximum at some point, say ε1, in (a,b), namely f(ε1)=maxy∈[a,b]f(y). Then, a<ε1<b, or equivalently (see (4.1))
max{ξ2u2v∗4du∗,2a2ρa23+e−2a3√a2ρ(a2ρa23+e)}<ε1<2a2ρa23+e+2a3√a2ρ(a2ρa23+e). | (4.3) |
Next, we assume χ>0 is suitably small such that
χ2<f(ε1)=γηa23K21dρr2u∗ε1(4du∗ε1v∗K21−ξ2)(−ε21+2(2a2ρa23+e)ε1−e2)=4γηdρr2u∗v∗ε1(4du∗ε1−ξ2v∗K21)(a2ρε1−a23(ε1−e)24), |
which implies
dχ2u∗v2∗ε1η(4du∗v∗ε1−ξ2v2∗K21)<4γρr2(a2ρε1−a23(ε1−e)24). |
Hence, there exists a constant ε2>0 such that
dχ2u∗v2∗ε1η(4du∗v∗ε1−ξ2v2∗K21)<ε2<4γρr2(a2ρε1−a23(ε1−e)24) |
which along with Lemma 3.1 yields
dχ2u∗v2∗ε1η(4du∗v∗ε1−ξ2v2∗u2)<ε2<4γρr2(a2ρε1−a23(ε1−e)24). | (4.4) |
Step 2: We claim
‖u−u∗‖L∞(Ω)+‖v−v∗‖L∞(Ω)+‖w−w∗‖L∞(Ω)→0as t→+∞. |
Indeed, using the equations in system (1.1) along with integration by parts, we have
ddt∫Ω(u−u∗−u∗lnuu∗)=∫Ωu−u∗uut=−du∗∫Ω|∇u|2u2+∫Ω(u−u∗)(a1−a2u−a3v)=−du∗∫Ω|∇u|2u2−a2∫Ω(u−u∗)2−a3∫Ω(u−u∗)(v−v∗). |
Similarly, we obtain
ddt∫Ω(v−v∗−v∗lnvv∗)=∫Ωv−v∗vvt=−v∗∫Ω|∇v|2v2−χv∗∫Ω∇v⋅∇wv+ξv∗∫Ω∇u⋅∇vv+∫Ω(v−v∗)(ρ−ρv+ea3u)=−v∗∫Ω|∇v|2v2−χv∗∫Ω∇v⋅∇wv+ξv∗∫Ω∇u⋅∇vv−ρ∫Ω(v−v∗)2+ea3∫Ω(u−u∗)(v−v∗) |
and
ddt∫Ω(w−w∗)2=2∫Ω(w−w∗)wt=2∫Ω(w−w∗)(ηΔw+ru−γw)=−2η∫Ω|∇w|2+2r∫Ω(u−u∗)(w−w∗)−2γ∫Ω(w−w∗)2for all t>0. |
Then, it follows that
ddtF(t)=−du∗ε1∫Ω|∇u|2u2−v∗∫Ω|∇v|2v2−ηε2∫Ω|∇w|2−χv∗∫Ω∇v⋅∇wv+ξv∗∫Ω∇u⋅∇vv−a2ε1∫Ω(u−u∗)2−ρ∫Ω(v−v∗)2−γε2∫Ω(w−w∗)2−a3(ε1−e)∫Ω(u−u∗)(v−v∗)+rε2∫Ω(u−u∗)(w−w∗)=:−XTSX−YTTY, |
where X=(∇u,∇v,∇w), Y=(u−u∗,v−v∗,w−w∗), and
S=[du∗ε1u2−ξv∗2v0−ξv∗2vv∗v2χv∗2v0χv∗2vηε2],T=[a2ε1a3(ε1−e)2−rε22a3(ε1−e)2ρ0−rε220γε2]. |
Note that (4.3) yields
du∗v∗ε1u2v2−ξ2v2∗4v2>v2∗4v2(4du∗εK21−ξ2)>0, |
and (4.4) gives
ηdu∗v∗ε1ε2u2v2−dχ2u∗v2∗ε14u2v2−ηξ2v2∗ε24v2>0. |
The above results indicate that matrix S is positive definite. Using (4.3) and (4.4) again, we observe that
a2ρε1−a23(ε1−e)24>0, |
and
a2ργε1ε2−ρr2ε224−a23γ(ε1−e)2ε24>0, |
which imply that matrix T is positive definite. Therefore, one can choose a constant C1>0 such that
ddtF(t)⩽−C1(∫Ω(u−u∗)2+∫Ω(v−v∗)2+∫Ω(w−w∗)2)for all t>0. | (4.5) |
Integrating the above inequality with respect to time, we get a constant C2>0 satisfying
∫+∞1∫Ω(u−u∗)2+∫+∞1∫Ω(v−v∗)2+∫+∞1∫Ω(w−w∗)2⩽C2, |
which together with the uniform continuity of u,v and w due to Lemma 4.1 yields
∫Ω(u−u∗)2+∫Ω(v−v∗)2+∫Ω(w−w∗)2→0,as t→+∞. | (4.6) |
By the Gagliardo-Nirenberg inequality, we can find a constant C3>0 such that
‖u−u∗‖L∞(Ω)⩽C3‖u−u∗‖nn+2W1,∞(Ω)‖u−u∗‖2n+2L2(Ω), | (4.7) |
‖v−v∗‖L∞(Ω)⩽C3‖v−v∗‖nn+2W1,∞(Ω)‖v−v∗‖2n+2L2(Ω) | (4.8) |
and
‖w−w∗‖L∞(Ω)⩽C3‖w−w∗‖nn+2W1,∞(Ω)‖w−w∗‖2n+2L2(Ω)for all t>1, | (4.9) |
which along with (4.6) and Lemma 4.1 prove the claim.
Step 3: From the L'Hôpital rule, it holds that for any s0>0
lims→s0s−s0−s0lnss0(s−s0)2=lims→s01−s0s2(s−s0)=lims→s012s=12s0, |
which gives a constant η>0 such that for all |s−s0|⩽η
14s0(s−s0)2⩽s−s0−s0lnss0⩽1s0(s−s0)2. | (4.10) |
By (4.6), there exists T1>1 such that
‖u−u∗‖L∞(Ω)+‖v−v∗‖L∞(Ω)+‖w−w∗‖L∞(Ω)⩽ηfor all t⩾T1. |
Therefore, by (4.10), we get
14u∗∫Ω(u−u∗)2⩽∫Ω(u−u∗−u∗lnuu∗)⩽1u∗∫Ω(u−u∗)2for all t⩾T1 | (4.11) |
and
14v∗∫Ω(v−v∗)2⩽∫Ω(v−v∗−v∗lnvv∗)⩽1v∗∫Ω(v−v∗)2for all t⩾T1. | (4.12) |
Step 4: From (4.11) and (4.12), it follows that
F(t)⩽max{ε1u∗,1v∗,ε22}(∫Ω(u−u∗)2+∫Ω(v−v∗)2+∫Ω(w−w∗)2), |
which alongside (4.5) yields a constant C4>0 such that
ddtF(t)⩽−C4F(t)for all t⩾T1. |
This immediately gives a constant C5>0 such that
F(t)⩽C5e−C4tfor all t⩾T1. |
Hence, utilizing (4.11) and (4.12) again, one obtains a constant C6>0 such that
∫Ω(u−u∗)2+∫Ω(v−v∗)2+∫Ω(w−w∗)2⩽C6e−C4tfor all t⩾T1. |
Finally, by (4.7)–(4.9) and Lemma 4.1, we get the decay rates of ‖u−u∗‖L∞(Ω), ‖v−v∗‖L∞(Ω) and ‖w−w∗‖L∞(Ω), as claimed in Theorem 1.2–(1).
In this case, there are three homogeneous equilibria (0,0,0), (0,1,0) and (a1a2,0,ra1γa2), and we shall show that the steady state (0,1,0) is global asymptotically stable, where the convergence rate is exponential if a1<a3 and algebraic if a1=a3. Define an energy functional for (1.1) as follows:
G(t)=e∫Ωu+ζ12∫Ωu2+∫Ω(v−1−lnv)+ζ22∫Ωw2, |
where ζ1 and ζ2 will be determined below.
Proof of Theorem 1.2–(2). We divide the proof into five steps.
Step 1: We shall choose the appropriate parameters ζ1 and ζ2. By the definitions of A and B in (1.7), since A<B, we have
(ξ24d)2<ξ2ea24da1<(ea2a1)2. | (4.13) |
Let
g(y)=16ηγdr2(dy−ξ24)(ea2−a1y)y,ξ24d<y<ea2a1. |
Then, g∈C1((ξ24d,ea2a1)), and g(y)>0 in (ξ24d,ea2a1). We further observe that
g(ξ2√ea2da1)=D(A+B−2√AB) |
which along with χ2<D(A+B−2√AB) implies
χ2<g(ξ2√ea2da1). |
By the definition of g, one has
g′(y0)=16ηγdr2(−da1+ξ2ea24y20)=0, |
which alongside (4.13) gives y0=ξ2√ea2da1∈(ξ24d,ea2a1). Thus, g(y) is increasing in (ξ24d,ξ2√ea2da1) and decreasing in (ξ2√ea2da1,ea2a1). We can find a constant ζ1>0 such that
ξ2√ea2da1<ζ1<ea2a1 | (4.14) |
and
0=g(ea2a1)<χ2<g(ζ1)<g(ξ2√ea2da1). |
With the definition of g, we get
dχ2ζ14η(dζ1−ξ24)<4γr2(ea2−a1ζ1), |
which implies that there exists ζ2>0 such that
dχ2ζ14η(dζ1−ξ24)<ζ2<4γr2(ea2−a1ζ1). | (4.15) |
One can verify that
ηdζ1ζ2−dχ24ζ1−ηξ24ζ2>0, | (4.16) |
and
(ea2−a1ζ1)ργζ2−ρr24ζ22>0. | (4.17) |
Thanks to (4.13) and (4.14), one obtains
ξ24d<ζ1<ea2a1. | (4.18) |
Step 2: We claim
‖u‖L∞(Ω)+‖v−1‖L∞(Ω)+‖w‖L∞(Ω)→0as t→+∞. | (4.19) |
Indeed, if (u,v,w) is the solution of system (1.1), then we get
ddt∫Ωu=a1∫Ωu−a2∫Ωu2−a3∫Ωuv, | (4.20) |
ddt∫Ωu2=2∫Ωuut=−2d∫Ω|∇u|2+2a1∫Ωu2−2a2∫Ωu3−2a3∫Ωu2v, | (4.21) |
ddt∫Ω(v−1−lnv)=∫Ωv−1vvt=−∫Ω|∇v|2v2−χ∫Ω∇v⋅∇wv+ξ∫Ω∇u⋅∇vv+∫Ω(v−1)(ρ−ρv+ea3u)=−∫Ω|∇v|2v2−χ∫Ω∇v⋅∇wv+ξ∫Ω∇u⋅∇vv−ρ∫Ω(v−1)2+ea3∫Ωuv−ea3∫Ωu | (4.22) |
and
ddt∫Ωw2=2∫Ωwwt=−2η∫Ω|∇w|2+2r∫Ωuw−2γ∫Ωw2for all t>0. | (4.23) |
Then, combining (4.20), (4.21), (4.22) and (4.23), we have from the definition of G(t) that
ddtG(t)⩽−dζ1∫Ω|∇u|2−∫Ω|∇v|2v2−ηζ2∫Ω|∇w|2−χ∫Ω∇v⋅∇wv+ξ∫Ω∇u⋅∇vv+e(a1−a3)∫Ωu−(ea2−a1ζ1)∫Ωu2−ρ∫Ω(v−1)2−γζ2∫Ωw2+rζ2∫Ωuw=:−XTPX−YTQY+e(a1−a3)∫Ωu, | (4.24) |
where X=(∇u,∇v,∇w), Y=(u,v−1,w),
P=[dζ1−ξ2v0−ξ2v1v2χ2v0χ2vηζ2]andQ=[ea2−a1ζ10−rζ220ρ0−rζ220γζ2]. |
It can be checked that (4.16) and (4.18) ensure that the matrix P is positive definite while (4.17) and (4.18) guarantee that the matrix Q is positive definite. Thus, there is a constant C1>0 such that if a1<a3, then
ddtG(t)⩽−C1(∫Ωu+∫Ωu2+∫Ω(v−1)2+∫Ωw2)for all t>0, | (4.25) |
and if a1=a3, then
ddtG(t)⩽−C1(∫Ωu2+∫Ω(v−1)2+∫Ωw2)for all t>0. | (4.26) |
Integrating the above inequalities with respect to time, we find a constant C2>0 satisfying
∫+∞1∫Ωu2+∫+∞1∫Ω(v−1)2+∫+∞1∫Ωw2⩽C2, |
which together with the uniform continuity of u,v and w due to Lemma 4.1 yields
∫Ωu2+∫Ω(v−1)2+∫Ωw2→0,as t→+∞. | (4.27) |
Thus, (4.19) is obtained by the Gagliardo-Nirenberg inequality and Lemma 4.1.
Step 3: By the L'Hôpital rule, we get
lims→1s−1−lns(s−1)2=lims→11−1s2(s−1)=lims→112s=12, |
which gives a constant ε>0 such that
14(s−1)2⩽s−1−lns⩽(s−1)2 for all |s−1|⩽ε. | (4.28) |
By (4.19), there exists T1>0 such that
‖u‖L∞(Ω)+‖v−1‖L∞(Ω)+‖w‖L∞(Ω)⩽εfor all t⩾T1. | (4.29) |
Therefore, it follows from (4.28) that
14∫Ω(v−1)2⩽∫Ω(v−1−lnv)⩽∫Ω(v−1)2for all t⩾T1. | (4.30) |
Step 4: If a1<a3, from the definition of G(t) and (4.30), one has
G(t)⩽max{e,ζ12,ζ22,1}(∫Ωu+∫Ωu2+∫Ω(v−1)2+∫Ωw2), |
which along with (4.25) yields a constant C3>0 such that
ddtG(t)⩽−C3G(t)for all t⩾T1. |
This gives a constant C4>0 such that
G(t)⩽C4e−C3tfor all t⩾T1. |
Hence, utilizing (4.30) again, we find a constant C5>0 such that
∫Ωu2+∫Ω(v−1)2+∫Ωw2⩽C5e−C3tfor all t⩾T1. |
Then, by the Gagliardo-Nirenberg inequality and Lemma 4.1, we get the exponential convergence for ‖u‖L∞(Ω)+‖v−1‖L∞(Ω)+‖w‖L∞(Ω).
Step 5: If a1=a3, we use (4.29), (4.30) and Young's inequality to find a constant C6>0:
G2(t)⩽C6(∫Ωu+∫Ωu2+∫Ω(v−1)2+∫Ωw2)2⩽C6(ε+1)2(∫Ωu+∫Ω(v−1)+∫Ωw)2⩽3C6(ε+1)2|Ω|(∫Ωu2+∫Ω(v−1)2+∫Ωw2)for all t⩾T1, |
which alongside (4.26) implies some constant C7>0
ddtG(t)⩽−C7G2(t)for all t⩾T1. |
Solving the above inequality directly yields a constant C8>0 such that
G(t)⩽C8(t+1)−1for all t⩾T1. |
Similar to the case a1<a3, we can use (4.30), the Gagliardo-Nirenberg inequality and Lemma 4.1 to get the convergence rate of ‖u‖L∞(Ω)+‖v−1‖L∞(Ω)+‖w‖L∞(Ω).
The author warmly thanks the reviewers for several inspiring comments and helpful suggestions. The research of the author was supported by the National Nature Science Foundation of China (Grant No. 12101377) and the Nature Science Foundation of Shanxi Province (Grant No. 20210302124080).
The author declares there is no conflict of interest.
[1] | P. Bedi, C. Sharma, Community detection in social networks, Wiley interdisciplinary reviews: Data mining and knowledge discovery, 6 (2016), 115–135. https://doi.org/10.1002/widm.1178 |
[2] | L. M. Naeni, R. Berretta, P. Moscato, MA-Net: A reliable memetic algorithm for community detection by modularity optimization, In Proceedings of the 18th Asia Pacific Symposium on Intelligent and Evolutionary Systems, 1 (2015), Springer. https://doi.org/10.1007/978-3-319-13359-1_25 |
[3] |
R. K. Behera, D. Naik, S. K. Rath, R. Dharavath, Genetic algorithm-based community detection in large-scale social networks, Neural Comput. Appl., 32 (2020), 9649–9665. https://doi.org/10.1007/s00521-019-04487-0 doi: 10.1007/s00521-019-04487-0
![]() |
[4] |
E. Ferrara, A large-scale community structure analysis in Facebook, EPJ Data Sci., 1 (2012), 1–30. https://doi.org/10.1140/epjds9 doi: 10.1140/epjds9
![]() |
[5] | J. Goldenberg, B. Libai, E. Muller, Using complex systems analysis to advance marketing theory development: Modeling heterogeneity effects on new product growth through stochastic cellular automata, Acad. Mark. Sci. Rev., 9 (2001), 1–18. |
[6] |
M. E. Newman, M. Girvan, Finding and evaluating community structure in networks, Phys. Rev. E, 69 (2004), 026113. https://doi.org/10.1103/PhysRevE.69.026113 doi: 10.1103/PhysRevE.69.026113
![]() |
[7] |
A. Pothen, H. D. Simon, K. P. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. A, 11(1990), 430–452. https://doi.org/10.1137/0611030 doi: 10.1137/0611030
![]() |
[8] |
M. Girvan, M. E. Newman, Community structure in social and biological networks, P. Natl Acad. Sci., 99 (2002), 7821–7826. https://doi.org/10.1073/pnas.122653799 doi: 10.1073/pnas.122653799
![]() |
[9] |
U. Brandes, D. Delling, M. Gaertler, R. Gorke, M. Hoefer, Z. Nikoloski, et al., On modularity clustering, IEEE T. Knowl. Data En., 20 (2007), 172–188. https://doi.org/10.1109/TKDE.2007.190689 doi: 10.1109/TKDE.2007.190689
![]() |
[10] | K. Wakita, T. Tsurumi, Finding community structure in mega-scale social networks, In Proceedings of the 16th international conference on World Wide Web, 2007. https://doi.org/10.1145/1242572.1242805 |
[11] |
I. Koc, A fast community detection algorithm based on coot bird metaheuristic optimizer in social networks, Eng. Appl. Artif. Intel., 114 (2022), 105202. https://doi.org/10.1016/j.engappai.2022.105202 doi: 10.1016/j.engappai.2022.105202
![]() |
[12] |
Y. Zhang, Y. G. Liu, J. T. Li, J. J. Zhu, C. H. Yang, W. Yang, et al., WOCDA: A whale optimization based community detection algorithm, Physica A, 539 (2020), 122937. https://doi.org/10.1016/j.physa.2019.122937 doi: 10.1016/j.physa.2019.122937
![]() |
[13] | C. Pizzuti, Ga-net: A genetic algorithm for community detection in social networks, In International conference on parallel problem solving from nature, Springer, 2008. https://doi.org/10.1007/978-3-540-87700-4_107 |
[14] |
X. Zeng, W. Wang; C. Chen, G. G. Yen, A consensus community-based particle swarm optimization for dynamic community detection, IEEE T. Cybernetics, 50 (2019), 2502–2513. https://doi.org/10.1109/TCYB.2019.2938895 doi: 10.1109/TCYB.2019.2938895
![]() |
[15] | C. Honghao, F. Zuren, R. Zhigang, Community detection using ant colony optimization, In 2013 IEEE congress on evolutionary computation, 2013. |
[16] | M. Tasgin, A. Herdagdelen, H. Bingol, Community detection in complex networks using genetic algorithms, arXiv: 0711.0491, 2007. |
[17] |
M. Gong, B. Fu, L. C. Jiao, H. F. Du, Memetic algorithm for community detection in networks, Phys. Rev. E, 84 (2011), 056101. https://doi.org/10.1103/PhysRevE.84.056101 doi: 10.1103/PhysRevE.84.056101
![]() |
[18] |
R. Shang, J. Bai, L. C. Jiao, C. Jin, Community detection based on modularity and an improved genetic algorithm, Physica A, 392 (2013), 1215–1231. https://doi.org/10.1016/j.physa.2012.11.003 doi: 10.1016/j.physa.2012.11.003
![]() |
[19] |
Y. Liang, L. Wang, Applying genetic algorithm and ant colony optimization algorithm into marine investigation path planning model, Soft Comput., 24 (2020), 8199–8210. https://doi.org/10.1007/s00500-019-04414-4 doi: 10.1007/s00500-019-04414-4
![]() |
[20] | K. De Jong, Genetic algorithms: A 10 year perspective, In Proceedings of the first International Conference on Genetic Algorithms and their Applications, Psychology Press, 2014. |
[21] |
P. Preux, E. G. Talbi, Towards hybrid evolutionary algorithms, Int. T. Oper. Res., 6 (1999), 557–570. https://doi.org/10.1111/j.1475-3995.1999.tb00173.x doi: 10.1111/j.1475-3995.1999.tb00173.x
![]() |
[22] | T. A. El-Mihoub, A. A. Hopgood, N. Lars, B. Alan, Hybrid genetic algorithms: A review, Eng. Lett., 13 (2006), 124–137. |
[23] |
M. E. Newman, Fast algorithm for detecting community structure in networks, Phys. Rev. E, 69 (2004), 066133. https://doi.org/10.1103/PhysRevE.69.066133 doi: 10.1103/PhysRevE.69.066133
![]() |
[24] | J. Holland, Adaptation in natural and artificial systems, Applying genetic algorithm to increase the efficiency of a data flow-based test data generation approach, the university of michigan press, Ann. Arbor. 1975, 1–5. |
[25] | L. Haldurai, T. Madhubala, R. Rajalakshmi, A study on genetic algorithm and its applications, Int. J. Comput. Sci. Eng., 4 (2016), 139. |
[26] | W. E. Hart, N. Krasnogor, J. E. Smith, Memetic evolutionary algorithms, In Recent Advances in Memetic Algorithms, Springer, 2005, 3–27. https://doi.org/10.1007/3-540-32363-5_1 |
[27] | P. Moscato, C. Cotta, A gentle introduction to memetic algorithms, In Handbook of metaheuristics, Springer, 2003,105–144. https://doi.org/10.1007/0-306-48056-5_5 |
[28] |
N. Krasnogor, J. Smith, A tutorial for competent memetic algorithms: Model, taxonomy, and design issues, IEEE T. Evolut. Comput., 9 (2005), 474–488. https://doi.org/10.1109/TEVC.2005.850260 doi: 10.1109/TEVC.2005.850260
![]() |
[29] |
G. Acampora, V. Loia, S. Salerno, A. Vitiello, A hybrid evolutionary approach for solving the ontology alignment problem, Int. J. Intel. Syst., 27 (2012), 189–216. https://doi.org/10.1002/int.20517 doi: 10.1002/int.20517
![]() |
[30] |
R. Cabido, A. S. Montemayor, J. J. Pantrigo, High performance memetic algorithm particle filter for multiple object tracking on modern GPUs, Soft Comput., 16(2012), 217–230. https://doi.org/10.1007/s00500-011-0715-2 doi: 10.1007/s00500-011-0715-2
![]() |
[31] |
Y. Li, J. Liu, C. Liu, A comparative analysis of evolutionary and memetic algorithms for community detection from signed social networks, Soft Comput., 18 (2014), 329–348. https://doi.org/10.1007/s00500-013-1060-4 doi: 10.1007/s00500-013-1060-4
![]() |
[32] |
B. Yang, W. Cheung, J. Liu, Community mining from signed social networks, IEEE T. Knowl. Data En., 19 (2007), 1333–1348. https://doi.org/10.1109/TKDE.2007.1061 doi: 10.1109/TKDE.2007.1061
![]() |
[33] |
P. Doreian, A multiple indicator approach to blockmodeling signed networks, Soc. Networks, 30 (2008), 247–258. https://doi.org/10.1016/j.socnet.2008.03.005 doi: 10.1016/j.socnet.2008.03.005
![]() |
[34] |
V. A. Traag, J. Bruggeman, Community detection in networks with positive and negative links, Phys. Rev. E, 80 (2009), 036115. https://doi.org/10.1103/PhysRevE.80.036115 doi: 10.1103/PhysRevE.80.036115
![]() |
[35] | L. Wu, X. Ying, X. Wu, A. Lu, Z. H. Zhou, Spectral analysis of k-balanced signed graphs, In Advances in Knowledge Discovery and Data Mining: 15th Pacific-Asia Conference, PAKDD 2011, Shenzhen, China, May 24-27, 2011, Proceedings, Part Ⅱ 15. 2011. Springer. |
[36] |
S. Ranjkesh, B. Masoumi, S. M. Hashemi, A novel robust memetic algorithm for dynamic community structures detection in complex networks, World Wide Web, 27 (2024), 3. https://doi.org/10.1007/s11280-024-01238-7 doi: 10.1007/s11280-024-01238-7
![]() |
[37] |
M. Miao, J. R. Wu, F. J. Cai, Y. G. Wang, A modified memetic algorithm with an application to gene selection in a sheep body weight study, Animals, 12 (2022), 201. https://doi.org/10.3390/ani12020201 doi: 10.3390/ani12020201
![]() |
[38] |
J. Andre, P. Siarry, T. Dognon, An improvement of the standard genetic algorithm fighting premature convergence in continuous optimization, Adv. Eng. Softw., 32 (2001), 49–60. https://doi.org/10.1016/S0965-9978(00)00070-3 doi: 10.1016/S0965-9978(00)00070-3
![]() |
[39] |
Y. D. Kwon, S. B. Kwon, S. B. Jin, J. Y. Kim, Convergence enhanced genetic algorithm with successive zooming method for solving continuous optimization problems, Comput. Struct., 81 (2003), 1715–1725. https://doi.org/10.1016/S0045-7949(03)00183-4 doi: 10.1016/S0045-7949(03)00183-4
![]() |
[40] | T. F. Gonzalez, Handbook of approximation algorithms and metaheuristics, 2007: Chapman and Hall/CRC. |
[41] | C. H. Papadimitriou, K. Steiglitz, Combinatorial optimization: Algorithms and complexity, Courier Corporation, 1998. |
[42] | E. Aarts, J. H. Korst, P. J. Laarhoven, Simulated annealing, E. Aarts, JK Lenstra, eds., Local Search in Combinatorial Optimization, John Wiley and Sons, New York, NY, 91120 (1997). |
[43] | S. J. Russell, P. Norvig, Artificial intelligence: A modern approach, Pearson, 2016. |
[44] |
B. Mondal, K. Dasgupta, P. Dutta, Load balancing in cloud computing using stochastic hill climbing-a soft computing approach, Procedia Technol., 4 (2012), 783–789. https://doi.org/10.1016/j.protcy.2012.05.128 doi: 10.1016/j.protcy.2012.05.128
![]() |
[45] | B. L. Miller, D. E. Goldberg, Genetic algorithms, tournament selection, and the effects of noise, Complex Syst., 9 (1995), 193–212. |
[46] | R. Halalai, C. Lemnaru, R. Potolea, Distributed community detection in social networks with genetic algorithms, In Proceedings of the 2010 IEEE 6th International Conference on Intelligent Computer Communication and Processing, 2010. https://doi.org/10.1109/ICCP.2010.5606467 |
[47] | D. E. Goldberg, Genetic algorithms in search, optimization and machine learning, Addison-Wesley Longman Publishing Co., Inc. 1989. |
[48] |
W. W. Zachary, An information flow model for conflict and fission in small groups, J. Anthropol. Res., 33 (1977), 452–473. https://doi.org/10.1086/jar.33.4.3629752 doi: 10.1086/jar.33.4.3629752
![]() |
[49] |
J. Q. Jiang, L. J. McQuay, Modularity functions maximization with nonnegative relaxation facilitates community detection in networks, Physica A, 391 (2012), 854–865. https://doi.org/10.1016/j.physa.2011.08.043 doi: 10.1016/j.physa.2011.08.043
![]() |
[50] |
D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten, S. M. Dawson, The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations: Can geographic isolation explain this unique trait? Behav. Ecol. Sociobiol., 54 (2003), 396–405. https://doi.org/10.1007/s00265-003-0651-y doi: 10.1007/s00265-003-0651-y
![]() |
[51] |
M. E. Newman, Modularity and community structure in networks, P. Natl Acad. Sci., 103 (2006), 8577–8582. https://doi.org/10.1073/pnas.0601602103 doi: 10.1073/pnas.0601602103
![]() |
[52] | The red hot Jazz archive. Available from: http://www.redhotjazz.com. |
[53] | C. Pizzuti, A multi-objective genetic algorithm for community detection in networks, In 2009 21st IEEE International Conference on Tools with Artificial Intelligence, 2009. https://doi.org/10.1109/ICTAI.2009.58 |
[54] |
M. Guerrero, F. G. Montoya, R. Baños, A. Alcayde, C. Gil, Adaptive community detection in complex networks using genetic algorithms, Neurocomputing, 266 (2017), 101–113. https://doi.org/10.1016/j.neucom.2017.05.029 doi: 10.1016/j.neucom.2017.05.029
![]() |
[55] | C. Shi, W. Yi, B. Wu, C. Zhong, A new genetic algorithm for community detection, In Complex Sciences: First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009, Revised Papers, Part 2, Springer, 2009. https://doi.org/10.1007/978-3-642-02469-6_11 |
[56] | R. Zheng, A fast community detection algorithm based on clustering coefficient, In 3rd International Conference on Mechatronics Engineering and Information Technology (ICMEIT 2019), Atlantis Press, 2019. https://doi.org/10.2991/icmeit-19.2019.100 |
[57] | D. Choudhury, S. Bhattacharjee, A. Das, An empirical study of community and sub-community detection in social networks applying Newman-Girvan algorithm, In 2013 1st international conference on emerging trends and applications in computer science, IEEE, 2013. https://doi.org/10.1109/ICETACS.2013.6691399 |
[58] | N. Du, B. Wu, X. Pei, Community detection in large-scale social networks, In Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 workshop on Web mining and social network analysis, 2007. |
[59] |
A. Said, R. A. Abbasi, O. Maqbool, A. Daud, N. R. Aljohani, CC-GA: A clustering coefficient based genetic algorithm for detecting communities in social networks, Appl. Soft Comput., 63 (2018), 59–70. https://doi.org/10.1016/j.asoc.2017.11.014 doi: 10.1016/j.asoc.2017.11.014
![]() |
[60] | W. Y. Lin, W. Y. Lee, T. P. Hong, Adapting crossover and mutation rates in genetic algorithms, J. Inf. Sci. Eng., 19 (2003), 889–903. |
[61] |
A. Clauset, M. E. Newman, C. Moore, Finding community structure in very large networks, Phys. Rev. E, 70 (2004), 066111. https://doi.org/10.1103/PhysRevE.70.066111 doi: 10.1103/PhysRevE.70.066111
![]() |
[62] |
S. Wang, J. Liu, Constructing robust community structure against edge-based attacks, IEEE Syst. J., 13 (2018), 582–592. https://doi.org/10.1109/JSYST.2018.2835642 doi: 10.1109/JSYST.2018.2835642
![]() |
[63] |
S. Wang, J. Liu, X. Wang, Mitigation of attacks and errors on community structure in complex networks, J. Stat. Mech.-Theory E., 2017 (2017), 043405. https://doi.org/10.1088/1742-5468/aa6581 doi: 10.1088/1742-5468/aa6581
![]() |
[64] |
S. Wang, J. Liu, Community robustness and its enhancement in interdependent networks, Appl. Soft Comput., 77 (2019), 665–677. https://doi.org/10.1016/j.asoc.2019.01.045 doi: 10.1016/j.asoc.2019.01.045
![]() |
[65] |
V. D. F. Vieira, C. R. Xavier, A. G. Evsukoff, A comparative study of overlapping community detection methods from the perspective of the structural properties, Appl. Netw. Sci., 5 (2020), 1–42. https://doi.org/10.1007/s41109-020-00289-9 doi: 10.1007/s41109-020-00289-9
![]() |
[66] |
L. Danon, A. Díaz-Guilera1, J. Duch, A. Arenas, Comparing community structure identification, J. Stat. Mech.-Theory E., 2005 (2005), P09008. https://doi.org/10.1088/1742-5468/2005/09/P09008 doi: 10.1088/1742-5468/2005/09/P09008
![]() |
[67] |
L. M. Collins, C. W. Dent, Omega: A general formulation of the rand index of cluster recovery suitable for non-disjoint solutions, Multivar. Behav. Res., 23 (1988), 231–242. https://doi.org/10.1207/s15327906mbr2302_6 doi: 10.1207/s15327906mbr2302_6
![]() |
[68] |
M. Li, J. Liu, A link clustering based memetic algorithm for overlapping community detection, Physica A, 503 (2018), 410–423. https://doi.org/10.1016/j.physa.2018.02.133 doi: 10.1016/j.physa.2018.02.133
![]() |
[69] |
H. Shen, X. Q. Cheng, K. Cai, M. B. Hu, Detect overlapping and hierarchical community structure in networks, Physica A, 388 (2009), 1706–1712. https://doi.org/10.1016/j.physa.2008.12.021 doi: 10.1016/j.physa.2008.12.021
![]() |
[70] | D. Jin, Z. Y. Liu, W. H. Li, D. X. He, W. X. Zhang, Graph convolutional networks meet markov random fields: Semi-supervised community detection in attribute networks, In Proceedings of the AAAI conference on artificial intelligence, 2019. https://doi.org/10.1609/aaai.v33i01.3301152 |
[71] |
W. Shi, Network embedding via community based variational autoencoder, IEEE Access, 7 (2019), 25323–25333. https://doi.org/10.1109/ACCESS.2019.2900662 doi: 10.1109/ACCESS.2019.2900662
![]() |
1. | Luis E. Ayala-Hernández, Gabriela Rosales-Muñoz, Armando Gallegos, María L. Miranda-Beltrán, Jorge E. Macías-Díaz, On a deterministic mathematical model which efficiently predicts the protective effect of a plant extract mixture in cirrhotic rats, 2023, 21, 1551-0018, 237, 10.3934/mbe.2024011 | |
2. | Rinaldo M. Colombo, Paola Goatin, Elena Rossi, A Hyperbolic–parabolic framework to manage traffic generated pollution, 2025, 85, 14681218, 104361, 10.1016/j.nonrwa.2025.104361 |