Loading [MathJax]/jax/output/SVG/jax.js

The longtime behavior of the model with nonlocal diffusion and free boundaries in online social networks

  • Received: 01 May 2020 Revised: 01 May 2020
  • 35K57, 45G15, 35R35, 35B40

  • In this paper we consider a free boundary problem with nonlocal diffusion describing information diffusion in online social networks. This model can be viewed as a nonlocal version of the free boundary problem studied by Ren et al. (Spreading-vanishing dichotomy in information diffusion in online social networks with intervention, Discrete Contin. Dyn. Syst. Ser. B, 24 (2019) 1843–1865). We first show that this problem has a unique solution for all t>0, and then we show that its longtime behaviour is determined by a spreading-vanishing dichotomy. We also obtain sharp criteria for spreading and vanishing, and show that the spreading always happen if the diffusion rate of any one of the information is small, which is very different from the local diffusion model.

    Citation: Meng Zhao. The longtime behavior of the model with nonlocal diffusion and free boundaries in online social networks[J]. Electronic Research Archive, 2020, 28(3): 1143-1160. doi: 10.3934/era.2020063

    Related Papers:

    [1] Meng Zhao . The longtime behavior of the model with nonlocal diffusion and free boundaries in online social networks. Electronic Research Archive, 2020, 28(3): 1143-1160. doi: 10.3934/era.2020063
    [2] Ting-Ying Chang, Yihong Du . Long-time dynamics of an epidemic model with nonlocal diffusion and free boundaries. Electronic Research Archive, 2022, 30(1): 289-313. doi: 10.3934/era.2022016
    [3] Xu Zhao, Wenshu Zhou . Vanishing diffusion limit and boundary layers for a nonlinear hyperbolic system with damping and diffusion. Electronic Research Archive, 2023, 31(10): 6505-6524. doi: 10.3934/era.2023329
    [4] Meng-Xue Chang, Bang-Sheng Han, Xiao-Ming Fan . Global dynamics of the solution for a bistable reaction diffusion equation with nonlocal effect. Electronic Research Archive, 2021, 29(5): 3017-3030. doi: 10.3934/era.2021024
    [5] Yijun Chen, Yaning Xie . A kernel-free boundary integral method for reaction-diffusion equations. Electronic Research Archive, 2025, 33(2): 556-581. doi: 10.3934/era.2025026
    [6] Gongcai Wu . Intelligent recommendation algorithm for social networks based on improving a generalized regression neural network. Electronic Research Archive, 2024, 32(7): 4378-4397. doi: 10.3934/era.2024197
    [7] Xiao Chen, Fuxiang Li, Hairong Lian, Peiguang Wang . A deep learning framework for predicting the spread of diffusion diseases. Electronic Research Archive, 2025, 33(4): 2475-2502. doi: 10.3934/era.2025110
    [8] Jiakun Wang, Xiaotong Guo, Yun Li, Liu Chun . An improved propagation model of public opinion information and its governance in online social networks under Omni-media era. Electronic Research Archive, 2024, 32(12): 6593-6617. doi: 10.3934/era.2024308
    [9] Wenbin Zhong, Yuting Ding . Spatiotemporal dynamics of a predator-prey model with a gestation delay and nonlocal competition. Electronic Research Archive, 2025, 33(4): 2601-2617. doi: 10.3934/era.2025116
    [10] Yuwei Hu, Jun Zheng . Local porosity of the free boundary in a minimum problem. Electronic Research Archive, 2023, 31(9): 5457-5465. doi: 10.3934/era.2023277
  • In this paper we consider a free boundary problem with nonlocal diffusion describing information diffusion in online social networks. This model can be viewed as a nonlocal version of the free boundary problem studied by Ren et al. (Spreading-vanishing dichotomy in information diffusion in online social networks with intervention, Discrete Contin. Dyn. Syst. Ser. B, 24 (2019) 1843–1865). We first show that this problem has a unique solution for all t>0, and then we show that its longtime behaviour is determined by a spreading-vanishing dichotomy. We also obtain sharp criteria for spreading and vanishing, and show that the spreading always happen if the diffusion rate of any one of the information is small, which is very different from the local diffusion model.



    Popular social networks play an essential role in our daily lives. In recent years, many rumors are spreading on social networks such that our lives are seriously affected. In order to control rumor propagation in social networks, we should understand the process of information propagation. Hence, some mathematical models were proposed to characterize and predict the process of information propagation in online social networks, such as, [26,27,17]. In [17], Wang et al. proposed the following diffusive logistic model:

    {ut=duxx+r(t)u(1u/K),t>1, l<x<L,u(1,x)=u0(x),lxL,ux(t,l)=0, ux(t,L)=0,t>1,

    where r, K and d represent the intrinsic growth rate, the carrying capacity, and the diffusion rate, respectively. l and L stand for the upper and lower bounds of the distances between the source s and other social networks users.

    In above system, l and L are fixed boundary and so information only spreads in this fixed area. But in reality, the spreading area of information is changing with time. This can be addressed by considering this over the varying domain. In 2013, Lei et al. [7] introduced the free boundary to study single information diffusion in online social networks,

    {ut=duxx+r(t)u(1u/K),t>0, 0<x<h(t),ux(t,0)=0, u(t,h(t))=0,t>0,h(t)=μux(t,h(t)),t>0,h(0)=h0, u(0,x)=u0(x),0xh0. (1)

    They presented some sharp criteria for information spreading and vanishing. Furthermore, if the information spreading happens, they gave the asymptotic spreading speed which is determined by a corresponding elliptic equation.

    The deduction of free boundary condition in (1) can be found in [2]. In 2010, this condition was introduced by Du and Lin [5] to describe the spreading of the invasive species, and a spreading-vanishing dichotomy was first established. After the work of [5] for a logistic type local diffusion model, free boundary approaches to local diffusion problems similar to problem (1) have been studied by many researchers recently. Among the many further extensions, we only mention the extension to certain Lotka-Volterra two-species systems [20,21,22,23] and the references therein.

    The works of [17] and [7] all discussed the spreading of the single information. However, in many practical situations, considering multiple information diffusion process in online social networks is more realistic. In 2013, Peng et al. [14] studied information diffusion initiated from multiple sources in online social networks by numerical simulation. But there are many challenging problems in modeling and analysing multiple information diffusion process. In particular, a simple case was considered by Ren et al. [15]. They assumed that there are three pieces of information A, B and C sent from different sources to compete for influence on online users, where the official information C is viewed as an intervention from the media or government to control the spread of the ordinary information A and B. For simplicity, they further assumed that A and B has no influence on C, A and B compete for influence on each other. Following the approach of [7], they proposed the following model

    {ut=d1uxx+u(a1b1uc1vr1w),t>0, 0<x<h(t),vt=d2vxx+v(a2b2vc2ur2w),t>0, 0<x<h(t),wt=d3wxx+w(a3b3w),t>0, 0<x<h(t),ux(t,0)=vx(t,0)=wx(t,0)=0,t0,u(t,h(t))=v(t,h(t))=w(t,h(t))=0,t0,h(t)=μ[ρ1ux(t,h(t))+ρ2vx(t,h(t))+wx(t,h(t))],t>0,h(0)=h0,u(0,x)=u0(x), v(0,x)=v0(x), w(0,x)=w0(x),0<x<h0, (2)

    where u(t,x),v(t,x),w(t,x) represent the density of influenced users of information A, B, C at time t and location x respectively, h(t) is the spreading front of the news, di (i=1,2,3) is the diffusion rates, ai (i=1,2,3) is the intrinsic growth rates, 1/bi (i=1,2,3) is the carrying capacities, ci (i=1,2) and ri (i=1,2) are the intervention rates, μ stands for the expanding capacity of information. In [15], they first gave the long time behavior of the information: all information spread; one ordinary information and official information spread, while the other ordinary information vanishes; two pieces of ordinary information vanish and official information spreads. And then they established the criteria for spreading and vanishing. Furthermore, they provided some estimates of asymptotic spreading speed when spreading happens. Finally, by some numerical simulations, they illustrated the results and all cases of the asymptotic behavior of the solution.

    Note that in (2), the dispersal of the information is assumed to follow the rules of random diffusion, which is not realistic in general. This kind of dispersal may be better described by a nonlocal diffusion operator of the form

    dRJ(xy)u(t,y)dydu(t,x),

    which can capture short-range as well as long-range factors in the dispersal by choosing the kernel function J properly [1,10,11,12,13,16,24,25].

    Recently, Cao et al. [3] proposed a nonlocal version of the logistic model of [5], and successfully extended many basic results of [5] to the nonlocal model. Motivated by the work [3], some related models with nonlocal diffusion and free boundaries have been considered in several recent works (see, for example, [6,8,9,18,19]). In this paper, following the approach of [3], we propose and examine a nonlocal version of (2), which has the form

    {ut=d1h(t)g(t)J1(xy)u(t,y)dyd1u+u(a1b1uc1vr1w),t>0, g(t)<x<h(t),vt=d2h(t)g(t)J2(xy)v(t,y)dyd2v+v(a2b2vc2ur2w),t>0, g(t)<x<h(t),wt=d3h(t)g(t)J3(xy)w(t,y)dyd3w+w(a3b3w),t>0, g(t)<x<h(t),u(t,x)=v(t,x)=w(t,x)=0,t0, x=g(t) or h(t),g(t)=μh(t)g(t)g(t)[ρ1J1(xy)u(t,x)+ρ2J2(xy)v(t,x)+J3(xy)w(t,x)]dydx,t>0,h(t)=μh(t)g(t)+h(t)[ρ1J1(xy)u(t,x)+ρ2J2(xy)v(t,x)+J3(xy)w(t,x)]dydx,t>0,g(0)=h(0)=h0,u(0,x)=u0(x),v(0,x)=v0(x),w(0,x)=w0(x),h0<x<h0, (3)

    where di (i=1,2,3), ai (i=1,2,3), bi (i=1,2,3), ci (i=1,2), ri (i=1,2), ρi (i=1,2), μ and h0 are given positive constants. The initial functions u0(x), v0(x) and w0(x) belong to

    X(h0):={u0C([h0,h0]) : u0(±h0)=0, u0>0 in (h0,h0)},

    where [h0,h0] represents the initial range of the information. Assumed that u,v,w are identically 0 for xR[g(t),h(t)], and the kernel function Ji:RR (i=1,2,3) is continuous and nonnegative, and have the properties

    (J) J(0)>0, RJ(x)dx=1, J is symmetric, supRJ<.

    The main results of this paper are the following theorems:

    Theorem 1.1 (Global existence and uniqueness). Suppose that Ji(i=1,2,3) satisfies (J). Then for any given h0>0 and u0(x),v0(x),w0(x) belonging to X(h0), problem (3) admits a unique solution (u(t,x),v(t,x),w(t,x),g(t),h(t)) defined for all t>0.

    Theorem 1.2 (Spreading-vanishing dichotomy). Let the conditions of Theorem 1.1 hold and (u,v,w,g,h) be the unique solution of (3). Assume further that J1(x)>0, J2(x)>0 in R, then one of the following alternatives must happen:

    (i) Spreading: limt[h(t)g(t)]=.

    (ii) Vanishing: limt(g(t),h(t))=(g,h) is a finite interval,

    limtmaxg(t)xh(t)u(t,x)=0, limtmaxg(t)xh(t)v(t,x)=0

    and

    limtmaxg(t)xh(t)w(t,x)=0.

    Theorem 1.3 (Spreading-vanishing criteria). Assume that Ji (i=1,2,3) satisfies (J), and J1(x)>0, J2(x)>0 in R. Then the dichotomy in Theorem 1.2 can be determined as follows:

    (i) If a1d1 or a2d2 or a3d3, then necessarily hg=.

    (ii) If ai<difor  i=1,2,3, then

    (a) If hg<, then hgl.

    (b) If h0l/2, then hg=.

    (c) If h0<l/2, then there exist two positive numbers μμ>0 such that hg< when 0<μμ and μ=μ, and hg= when μ>μ,

    where l is given by (13).

    Theorem 1.4 (Asymptotic limit). Let (u,v,w,g,h) be the unique solution of (3) and suppose limt[h(t)g(t)]=. The following conclusions hold:

    (i) If a1>c1a2b2+r1a3b3 and a2>c2a1b1+r2a3b3, then

    limt(u(t,x),v(t,x),w(t,x))= (b2(a1b3r1a3)c1(a2b3r2a3)b3(b1b2c1c2),c2(a1b3r1a3)+b1(a2b3r2a3)b3(b1b2c1c2),a3b3)

    locally uniformly for xR.

    (ii) If a1+c1b2(c2a1b1+r2a3b3)c1a2b2+r1a3b3 and a2>c2a1b1+r2a3b3, then

    limt(u(t,x),v(t,x),w(t,x))=(0,a2b3r2a3b2b3,a3b3) locally uniformly for xR.

    (iii) If a1>c1a2b2+r1a3b3 and a2+c2b1(c1a2b2+r1a3b3)c2a1b1+r2a3b3, then

    limt(u(t,x),v(t,x),w(t,x))=(a1b3r1a3b1b3,0,a3b3) locally uniformly for xR.

    (iv) If a1r1a3b3 and a2r2a3b3, then

    limt(u(t,x),v(t,x),w(t,x))=(0,0,a3b3) locally uniformly for xR.

    Remark 1. Note that for the corresponding local diffusion model in [15], no matter how small the diffusion coefficient di is, vanishing can always happen if h0 and μ are both sufficiently small. However, for (3), Theorem 1.3 indicates that when d1a1 or d2a2 or d3a3, spreading always happens no mater how small h0 and μ are. This is different from the local diffusion model in [15].

    The rest of this paper is organised as follows. In Section 2 we prove Theorem 1.1, namely, problem (3) has a unique solution defined for all t>0. The long-time dynamical behaviour of (3) is investigated in Section 3, where Theorems 1.2, 1.3 and 1.4 are proved. Finally, we conclude this paper with a brief discussion in Section 4.

    For convenience, we first introduce some notations. For given T>0, define

    HT:={hC1([0,T]):h(0)=h0,h(t) is strictly increasing},GT:={gC1([0,T]):gHT},DT=Dg,hT:={(t,x)R2:0<t<T, g(t)<x<h(t)}.

    The proof of Theorem 1.1. The existence and uniqueness of solution to the problem (3) can be done in a similar fashion as in [3,6]. We only list the main steps in the proof.

    Noting that J3 satisfies (J), f3(w):=w(a3b3w) satisfies (f1) and (f2) in [3], and w0(x) belongs to X(h0) for any h0>0. For any given T>0 and (g,h)GT×HT, it follows from [3,Lemma 2.3] that the following problem

    {wt=d3h(t)g(t)J3(xy)w(t,y)dyd3w+w(a3b3w),0<t<T,g(t)<x<h(t),w(t,g(t))=w(t,h(t))=0,0<t<T,w(0,x)=w0(x),h0xh0

    admits a unique solution w(t,x), and

    0<w(t,x)max{w0,a3/b3}=:A3 in DT.

    For such w(t,x), it is easy to check that f1(t,x,u,v):=u(a1b1uc1v+r1w(t,x)) and f2(t,x,u,v):=v(a2b2vc2u+r2w(t,x)) satisfy (f), (f1) and (f2) in [6]. For (g,h) given above, it follows from [6,Lemma 2.3] that the following problem

    {ut=d1h(t)g(t)J1(xy)u(t,y)dyd1u+u(a1b1uc1vr1w(t,x)),0<t<T, g(t)<x<h(t),vt=d2h(t)g(t)J2(xy)v(t,y)dyd2v+v(a2b2vc2ur2w(t,x)),0<t<T, g(t)<x<h(t),u(t,x)=v(t,x)=0,0<t<T, x=g(t) or h(t),u(0,x)=u0(x), v(0,x)=v0(x),h0xh0

    has a unique solution (u,v) and

    0<umax{u0,a1/b1}=:A1 in DT,
    0<vmax{v0,a2/b2}=:A2 in DT.

    For (u,v,w,g,h) above, we define (˜g,˜h) for t[0,T] by

    {˜g(t):=h0μt0h(τ)g(τ)g(τ)[ρ1J1(xy)u(τ,x)+ρ2J2(xy)v(τ,x)+J3(xy)w(τ,x)]dydxdτ,˜h(t):=h0+μt0h(τ)g(τ)+h(τ)[ρ1J1(xy)u(τ,x)+ρ2J2(xy)v(τ,x)+J3(xy)w(τ,x)]dydxdτ.

    Since Ji (i=1,2,3) satisfies (J), there exist constants ϵ0(0,h0/4) and δ0 such that

    Ji(x)δ0 if |x|ϵ0, i=1,2,3.

    Let

    L:=(b1+c2)A1+(c1+b2)A2+(r1+r2+b3)A3,

    then

    f1(u,v,w)=u(a1b1uc1vr1w)(b1A1+c1A2+r1A3)uLu,f2(u,v,w)=v(a2b2vc2ur2w)(b2A2+c2A1+r2A3)vLv,f3(w)=w(a3b3w)b3A3wLw.

    Using this we can follow the corresponding arguments of [6] to show that, for some sufficiently small T0=T0(μ,A1,A2,A3,h0,ϵ0,ρ1,ρ2,J)>0 and any T(0,T0],

    sup0t1<t2T˜g(t2)˜g(t1)t2t1˜σ0,   inf0t1<t2T˜h(t2)˜h(t1)t2t1σ0,
    ˜h(t)˜g(t)2h0+ϵ04 for t[0,T],

    where

    ˜σ0=14ϵ0δ0μe(d1+d2+d3+L)T0h0+ϵ04h0 [ρ1u0(x)+ρ2v0(x)+w0(x)]dx,
    σ0=14ϵ0δ0μe(d1+d2+d3+L)T0h0h0ϵ04[ρ1u0(x)+ρ2v0(x)+w0(x)]dx.

    Let

    ΣT:={(g,h)GT×HT : sup0t1<t2Tg(t2)g(t1)t2t1˜σ0,inf0t1<t2Th(t2)h(t1)t2t1σ0, h(t)g(t)2h0+ϵ04 for t[0,T]},

    and define the mapping

    F(g,h)=(˜g,˜h).

    Then the above analysis indicates that

    F(ΣT)ΣT for T(0,T0].

    Next, we will show that F is a contraction mapping on ΣT for sufficiently small T(0,T0]. For any given (gi,hi)ΣT (i=1,2), denote

    (˜gi,˜hi)=F(gi,hi).

    Let

    U(t,x):=u1(t,x)u2(t,x), V(t,x):=v1(t,x)v2(t,x),W(t,x):=w1(t,x)w2(t,x).

    Then we can follow the approach of Step 2 in the proof of [3,Theorem 2.1] to show

    |˜g1(t)˜g2(t)|+|˜h1(t)˜h2(t)| 6h0μρ1TUC([0,T]×R)+6h0μρ2TVC([0,T]×R)+6h0μTWC([0,T]×R)+3Tμ(ρ1A1+ρ2A2+A3)[g1g2C([0,T])+h1h2C([0,T])].

    We can apply the same argument as the step 2 in the proof of [6,Theorem 2.1] to obtain that there exist C1 and T1(0,T0) such that, for TT1,

    max{UC([0,T]×R), VC([0,T]×R)}C1[g1g2C([0,T])+h1h2C([0,T])].

    Meanwhile, by using the same argument as the step 2 in the proof of [3,Theorem 2.1] to obtain that there exist C2 and T2(0,T1) such that, for TT2,

    WC([0,T]×R)C2[g1g2C([0,T])+h1h2C([0,T])].

    Then we have, for TT2,

    |˜g1(t)˜g2(t)|+|˜h1(t)˜h2(t)| C3T[g1g2C([0,T])+h1h2C([0,T])],

    where

    C3=6h0μρ1C1+6h0μρ2C1+6h0μC2+3μ(ρ1A1+ρ2A2+A3).

    This shows that if we choose ˜T such that

    0<˜Tmin{T2,12C3},

    then, for T(0,˜T],

    |˜g1(t)˜g2(t)|+|˜h1(t)˜h2(t)| 12[g1g2C([0,T])+h1h2C([0,T])]

    and so F is a contraction mapping on ΣT. Hence F has a unique fixed point (g,h) in ΣT, which gives a nonnegative solution (u,v,w,g,h) of (3) for t(0,T]. Similar to Steps 3 and 4 in the proof of [6,Theorem 2.1], we can show that this is the unique solution of (3) and it can be extended uniquely to all t>0.

    Since u,v and w are positive in DT, we have h(t)>0 and g(t)<0 for t>0. Thus we can define

    limtg(t)=g[,h0),   limth(t)=h(h0,].

    Clearly we have either

    (i) hg<, or (ii) hg=.

    We will call (ⅰ) the vanishing case, and call (ⅱ) the spreading case. The main purpose of this section is to determine when (ⅰ) or (ⅱ) can occur, and to determine the long-time profile of (u,v,w) if (ⅰ) or (ⅱ) happens.

    Before analysing the vanishing phenomenon, we first give some lemmas.

    Lemma 3.1. Let the condition (J) hold for the kernel functions Ji (i=1,2,3), and β1,β2,β3>0 be constants. Suppose that g,hC1([0,)), g(0)<h(0), g(t)0, h(t)0 and wi,witC(D)L(D) for i=1,2,3, where D={t>0, g(t)<x<h(t)}. If (w1,w2,w3,g,h) satisfies

    {h(t)=3i=1βih(t)g(t)h(t)Ji(xy)wi(t,x)dydx,t0,g(t)=3i=1βih(t)g(t)g(t)Ji(xy)wi(t,x)dydx,t0, (4)

    and

    limth(t)limtg(t)<, (5)

    then

    limtg(t)=limth(t)=0.

    This lemma can be proven by using the same arguments in [6,Lemma 3.1]. Next we recall another lemma which will be used later.

    Lemma 3.2. ([6,Lemma 3.2]) Let J satisfy the condition (J) and J(x)>0 in R. Suppose that g,hC1([0,)), g(0)<h(0), g(t)0, h(t)0, and (5) holds. If (w,g,h) satisfies, for some positive constants β and M,

    0wM in  D,   w(t,g(t))=w(t,h(t))=0,   t0,
    h(t)βh(t)g(t)h(t)J(xy)w(t,x)dydx,   t>0,

    and limth(t)=0, then

    limth(t)g(t)w(t,x)dx=0,   0h(t)g(t)w(t,x)dxdt<.

    We define the operator LdiΩ+β:C(¯Ω)C(¯Ω) by

    (LdiΩ+β)[ϕ](x):=diΩJi(xy)ϕ(y)dydiϕ(x)+β(x)ϕ(x),

    where Ω is an open bounded interval in R, and βC(¯Ω). The generalized principal eigenvalue of LdiΩ+β is given by

    λp(LdiΩ+β):=inf{λR:(LdiΩ+β)[ϕ]λϕ in Ω for some ϕC(¯Ω), ϕ>0}.

    Then we will use the techniques in [6,Theorem 3.3] to give the vanishing result.

    Lemma 3.3. Assume that Ji (i=1,2,3) satisfies (J), Ji(x)>0 (i=1,2) in R. Let (u,v,w,g,h) be the unique solution of (3). If hg<, then

    limtmaxg(t)xh(t)u(t,x)=limtmaxg(t)xh(t)v(t,x)=limtmaxg(t)xh(t)w(t,x)=0, (6)

    moreover,

    λp(Ldi(g,h)+ai)0, i=1,2,3. (7)

    Proof. By the similar arguments in [3,Theorem 3.7], we can have

    limtmaxg(t)xh(t)w(t,x)=0 and λp(Ld3(g,h)+a3)0.

    In the following, we only prove

    limtmaxg(t)xh(t)u(t,x)=0 and λp(Ld1(g,h)+a1)0. (8)

    The conclusion for v can be obtained similarly, so we omit here.

    By the same arguments in [6], we can have

    limtu(t,x)=limtv(t,x)=limtw(t,x)=0 for almost every x[g(0),h(0)]. (9)

    Define

    M(t):=maxx[g(t),h(t)]u(t,x)

    and

    X(t):={x(g(t),h(t)):u(t,x)=M(t)}.

    Then Xi(t) is a compact set for each t>0. Therefore, there exist ξ_i(t),¯ξi(t)Xi(t) such that

    ut(t,¯ξ(t))=maxxX(t)ut(t,x), ut(t,ξ_(t))=minxX(t)ut(t,x).

    By the arguments in [6], the following claim holds

    M(t+0):=lims>t,stM(s)M(t)st=ut(t,¯ξ(t)),M(t0):=lims<t,stM(s)M(t)st=ut(t,ξ_(t)).

    If M(t) has a local maximum at t=t0, then M(t0) exists and M(t0)=0. Moreover, if M(t) is monotone nondecreasing for all large t and limtM(t)=σ>0, then M(t0)0 as t; if M(t) is monotone nonincreasing for all large t and limtM(t)=σ>0, then M(t+0)0 as t.

    Now we are ready to show that limtM(t)=0. This can be done by the similar argument in Theorem 3.3 of [6]. Arguing indirectly we assume that this claim does not hold. Then

    σ:=lim suptM(t)(0,). (10)

    By the above stated properties of M(t), there exists a sequence tn>0 increasing to as n, and ξn{¯ξ(tn),ξ_(tn)} such that

    limnu(tn,ξn)=σ, limnut(tn,ξn)=0.

    By passing to a subsequence of (tn,ξn) if necessary, we may assume, without loss of generality,

    limnv(tn,ξn)=ρ[0,).

    By Lemma 3.1, we have limth(t)=0. It follows from this fact and Lemma 3.2 that

    limth(t)g(t)u(t,y)dy=0.

    Since supxRJ1(x)< by (J), we have

    limth(t)g(t)J1(xy)u(t,y)dy=0 uniformly for xR.

    We now make use of the identity

    ut=d1h(t)g(t)J1(xy)u(t,y)dyd1u+u(a1b1uc1vr1w)

    with (t,x)=(tn,ξn). Letting n, we obtain

    0d1σ+σ(a1b1σc1ρ)<σ(a1d1).

    It follows that a1>d1. We show next that this leads to a contradiction.

    Indeed, by (9), there exists x0(g(0),h(0)) such that

    limtu(t,x0)=limtv(t,x0)=limtw(t,x0)=0.

    Therefore we can find T>0 large so that

    d1+a1b1u(t,x0)c1v(t,x0)r1w(t,x0)>(a1d1)/2>0 for tT.

    It then follows from the equation satisfied by u that

    ut(t,x0)a1d12u(t,x0)  for tT,

    which implies u(t,x0) as t, a contradiction to the boundedness of u. This completes the proof of limtmaxg(t)xh(t)u(t,x)=0. Similarly, limtmaxg(t)xh(t)v(t,x)=0.

    In the following we prove the second conclusion of (8). Suppose on the contrary that λp(Ld1(g,h)+a1)>0. Then there exists small ϵ1(0,2a1c1+r1) such that

    λp(Ld1(g+ϵ,hϵ)+a1ϵ2(c1+r1))>0 for ϵ(0,ϵ1).

    Moreover, for such ϵ, it follows from

    hg< and limtv(t,x)=limtw(t,x)=0 for xR

    that there exists Tϵ such that

    g(t)<g+ϵ, h(t)>hϵ for t>Tϵ,

    and

    v(t,x)ϵ2, w(t,x)ϵ2 for t>Tϵ and xR.

    Then

    utd1hϵg+ϵJ1(xy)u(t,y)dyd1u+u[a1b1uϵ2(c1+r1)],  t>Tϵ, x[g+ϵ,hϵ].

    Let ϕ(x) be the corresponding normalized eigenfunction of λp(Ld1(g+ϵ,hϵ)+a1ϵ2(c1+r1)), namely, ϕ=1 and

    d1hϵg+ϵJ1(xy)ϕ(y)dyd1ϕ(x)+(a1ϵ2(c1+r1))ϕ(x)=λpϕ(x).

    Then, for any δ>0,

    d1hϵg+ϵJ1(xy)δϕ(y)dyd1δϕ(x)+(a1ϵ2(c1+r1))δϕ(x)=λpδϕ(x)>0.

    If we choose δ small enough such that δϕ(x)u(Tϵ,x) for x[g+ϵ,hϵ], then we can use [3,Lemma 3.3] and a simple comparison argument to obtain

    u(t,x)δϕ(x)>0 for t>Tϵ and x[g+ϵ,hϵ].

    This is a contradiction to limtmaxg(t)xh(t)u(t,x)=0. Thus λp(Ld1(g,h)+a1)0.

    Then Theorem 1.2 can be obtained by Lemma 3.3 directly.

    Corollary 1. Suppose that J1,J2 and J3 satisfy the conditions in Lemma 3.3, and (u,v,w,g,h) is the unique solution of (3). If a1d1 or a2d2 or a3d3, then necessarily hg=.

    Proof. Arguing indirectly we assume that hg< and aidi for some i{1,2,3}. Thanks to [3,Proposition 3.4],

    λp(Ldi(g,h)+ai)>0.

    This is a contradiction to Lemma 3.3.

    Hence, Theorem 1.3 (ⅰ) has been proved.

    We next consider the case that

    ai<di for i=1,2,3. (11)

    In this case, it follows from [3,Proposition 3.4] that there exists li (i=1,2,3) such that

    {λp(Ldi(0,li)+ai)=0, if l=li,(lli)λp(Ldi(0,li)+ai)>0, if lli(0,+){li}. (12)

    Define

    l=min{l1,l2,l3}. (13)

    It is easily seen that conclusions (a) and (b) of Theorem 1.3 follow directly from the definition of l, (12) and Lemma 3.3. In the following, we prove Theorem 1.3 (c) by several lemmas.

    Lemma 3.4. Under the assumptions of Theorem 1.3, if h0<l/2, then there exists a positive number μ0 such that hg< for any μ(0,μ0].

    We need some comparison results to prove this lemma. The proof of the following Lemma 3.5 can be carried out by the same arguments in the proof of [3,Theorem 3.1]. Since the adaptation is rather straightforward, we omit the details here.

    Lemma 3.5. For T(0,+), suppose that ¯g,¯hC([0,T]), ¯u,¯vC(¯D¯g,¯hT). If (¯u,¯v,¯w,¯g,¯h) satisfies

    {¯utd1¯h(t)¯g(t)J1(xy)¯u(t,y)dyd1¯u+¯u(a1b1¯u),t>0, ¯g(t)<x<¯h(t),¯vtd2¯h(t)¯g(t)J2(xy)¯v(t,y)dyd2¯v+¯v(a2b2¯v),t>0, ¯g(t)<x<¯h(t),¯wtd3¯h(t)¯g(t)J3(xy)¯w(t,y)dyd3¯w+¯w(a3b3¯w),t>0, ¯g(t)<x<¯h(t),¯u(t,x)0, ¯v(t,x)0, ¯w(t,x)0,t0, x=¯g(t)or ¯h(t),¯g(t)μ¯h(t)¯g(t)¯g(t)[ρ1J1(xy)¯u(t,x)+ρ2J2(xy)¯v(t,x)+J3(xy)¯w(t,x)]dydx,t>0,¯h(t)μ¯h(t)¯g(t)+¯h(t)[ρ1J1(xy)¯u(t,x)+ρ2J2(xy)¯v(t,x)+J3(xy)¯w(t,x)]dydx,t>0,¯g(0)h0, ¯h(0)h0,¯u(0,x)u0(x), ¯v(0,x)v0(x), ¯w(0,x)w0(x),h0<x<h0.

    then the unique solution (u,v,w,g,h) of (3) satisfies

    u(t,x)¯u(t,x), v(t,x)¯v(t,x), w(t,x)¯w(t,x),g(t)¯g(t), h(t)¯h(t) for  0<tT, g(t)xh(t).

    The proof of Lemma 3.4. Since 2h0<l, we have λp(Ldi(h0,h0)+ai)<0 (i=1,2,3). There exists some small ε>0 such that h:=h0(1+ε) satisfies

    λip:=λp(Ldi(h,h)+ai)<0.

    Let ϕi (i=1,2,3) be the positive normalized eigenfunction corresponding to λip, namely, ϕi=1 and

    dihhJi(xy)ϕi(y)dydiϕi(x)+aiϕi=λipϕi, x[h,h]. (14)

    Choose positive constants Ki (i=1,2,3) large enough such that

    K1ϕ1(x)u0(x), K2ϕ2(x)v0(x) and K3ϕ3(x)w0(x) for x[h0,h0].

    Define

    ¯h(t)=h0[1+ε(1eδt)], ¯g(t)=¯h(t), t0,zi(t,x)=Kieδtϕi(x), t0, x[¯g(t),¯h(t)], i=1,2,3,

    where δ>0 will be determined later. Clearly h0¯h(t)h.

    For t>0 and x(¯g(t),¯h(t)),

    zitdi¯h(t)¯g(t)Ji(xy)zi(t,y)dy+dizizi(aibizi)
     Kieδt(δϕi(x)di¯h(t)¯g(t)Ji(xy)ϕi(y)dy+diϕiaiϕi) Kieδt(δλip)ϕi(x)0, i=1,2,3,

    if we can choose δ small enough such that

    δmin{λ1p,λ2p,λ3p}.

    Moreover, ¯h(t)=h0εδeδt and

    μ¯h(t)¯g(t)+¯h(t)[ρ1J1(xy)z1(t,x)+ρ2J2(xy)z2(t,x)+J3(xy)z3(t,x)]dydx 2μ(ρ1K1+ρ2K2+K3)eδth.

    If

    μh0εδ2(ρ1K1+ρ2K2+K3)h:=μ0,

    then we have

    ¯h(t)μ¯h(t)¯g(t)+¯h(t)[ρ1J1(xy)z1(t,x)+ρ2J2(xy)z2(t,x)+J3(xy)z3(t,x)]dydx.

    Similarly, we can derive

    ¯g(t)μ¯h(t)¯g(t)¯g(t)[ρ1J1(xy)z1(t,x)+ρ2J2(xy)z2(t,x)+J3(xy)z3(t,x)]dydx.

    We may now apply Lemma 3.5 to obtain

    u(t,x)z1(t,x), v(t,x)z2(t,x), w(t,x)z3(t,x),g(t)¯g(t), h(t)¯h(t) for t>0 and x[g(t),h(t)].

    It follows that limt(h(t)g(t))limt(¯h(t)¯g(t))2h<.

    Lemma 3.6. Under the assumptions of Theorem 1.3, if h0<l/2, then there exists a positive number μ0 such that hg= for any μ>μ0.

    Proof. Consider the following problem

    {w_t=d3h_(t)g_(t)J3(xy)w_(t,y)dyd3w_+w_(a3b3w_),t>0, g_(t)<x<h_(t),w_(t,g_(t))=w_(t,h_(t))=0,t0,g_(t)=μh_(t)g_(t)g_(t)J3(xy)w_(t,x)dydx,t>0,h_(t)=μh_(t)g_(t)+h_(t)J3(xy)w_(t,x)dydx,t>0,g_(0)=h_(0)=h0,w_(0,x)=w0(x),h0<x<h0.

    By [3,Theorem 3.1], we have

    w(t,x)w_(t,x), g(t)g_(t), h(t)h_(t), for t>0, x(g_(t),h_(t)).

    It follows from [3,Theorem 3.13] that there exists some μ0 such that limt[h_(t)g_(t)]= for any μ>μ0, and so hg=.

    Then Theorem 1.3 (c) can follow from Lemmas 3.4 and 3.6 by argument in [23,Theorem 5.2]. Next we give the details below for completeness.

    The proof of Theorem 1.3 (c). Define Σ:={μ>0:hgl}. By Lemma 3.4, we have (0,μ0]Σ. It follows from Lemma 3.6 that Σ[μ0,)=. Therefore, μ:=supΣ[μ0,μ0]. By this definition and Theorem 1.3 (a), we find that hg= when μ>μ.

    We claim that μΣ. Otherwise hg= for μ=μ. Hence, we can find T>0 such that h(T)g(T)>l. To stress the dependence of the solution (u,v,w,g,h) of (3) on μ, we write (uμ,vμ,wμ,gμ,hμ) instead of (u,v,w,g,h). So we have hμ(T)gμ(T)>l. By the continuous dependence of (uμ,vμ,wμ,gμ,hμ) on μ, we can find ε>0 small so that hμ(T)gμ(T)>l for μ[με,μ+ε]. It follows that for all such μ,

    limt[hμ(t)gμ(t)]>[hμ(T)gμ(T)]>l.

    This implies that [με,μ+ε]Σ=, and supΣμε, contradicting to the definition of μ. This proves our claim.

    Define Σ:={ν>0:νμ0 such that hgl for all 0<μ<ν}, then μ:=supΣμ and (0,μ)Σ. Similarly to the above, we can prove that μΣ. The proof is completed.

    Finally, we will examine the long-time behaviour of the solution to (3) when hg=. Before proving Theorem 1.4, we first give the following lemma:

    Lemma 3.7. h=+ if and only if g=.

    Proof. This follows the idea in the proof of [3,Lemma 3.8]. For example, if g= but h<+, then we may argue as in the proof of [3,Theorem 3.7] to obtain h(t)ξ0>0 for all large t, which yields a contradiction.

    The proof of Theorem 1.4. By [3,Theorem 3.9], we have

    limtw(t,x)=a3b3=:C locally uniformly for xR. (15)

    (ⅰ) We will prove it by the following steps.

    Step 1. Let q(t) be the solution of

    {q(t)=q(a1b1q),t>0,q(0)=supxRu0(x).

    Then limtq(t)=a1/b1. By the comparison principle ([3,Lemma 2.2]), we have u(t,x)q(t) for t>0 and x[g(t),h(t)]. In view of u(t,x)=0 for t>0 and xR(g(t),h(t)), we have u(t,x)q(t) for t>0 and xR. Hence,

    lim suptu(t,x)a1b1=:ˉA1  locally uniformly in R. (16)

    Step 2. By (15) and (16), we have

    lim supt[c2u(t,x)+r2w(t,x)]c2ˉA1+r2C  locally uniformly in R.

    By the condition a2>c2a1b1+r2a3b3, we have

    a2c2ˉA1r2C=a2c2a1b1r2a3b3>0.

    It follows from above two facts, and [6,Lemma 3.14] that

    lim inftv(t,x)a2c2ˉA1r2Cb2=:B_1 locally uniformly in R. (17)

    Step 3. By (15) and (17), we have

    lim supt[c1v(t,x)+r1w(t,x)]c1B_1+r1C  locally uniformly in R.

    The condition a1>c1a2b2+r1a3b3 implies

    a1c1B_1r1C=a1c1a2c2ˉA1r2Cb2r1Ca1c1a2b2r1a3b3>0.

    These two facts and [6,Lemma 3.14] allow us to derive

    lim suptu(t,x)a1c1B_1r1Cb1=:ˉA2  locally uniformly in R. (18)

    Step 4. By (15) and (18), we have

    lim supt[c2u(t,x)+r2w(t,x)]c2ˉA2+r2C  locally uniformly in R.

    Furthermore, the condition a2>c2a1b1+r2a3b3 implies

    a2c2ˉA2r2C=a2c2a1c1B_1r1Cb1r2Ca2c2a1b1r2a3b3>0.

    Similar to the above,

    lim inftv(t,x)(a2c2ˉA2r2C)/b2=:B_2  locally uniformly in R.

    Step 5. Repeating the above procedure, we can find two sequences ˉAi and B_i such that

    lim suptu(t,x)ˉAi,   lim inftv(t,x)B_i  locally uniformly in R,

    and

    ˉAi+1=(a1c1B_ir1C)/b1,   B_i=(a2c2ˉAir2C)/b2,   i=1,2,.

    Let

    p:=a1r1Cb1c1(a2r2C)b1b2,   q:=c1c2b1b2.

    Then p>0 by a1c1a2b2r1a3b3>0, 0<q<1 by a1>c1a2b2 and a2>c2a1b1. By direct calculation,

    ˉAi+1=p+qˉAi,   i=1,2,.

    From ˉA2<ˉA1 and the above iteration formula, we immediately obtain

    0<ˉAi+1<ˉAi, i=1,2,,

    from which it easily follows that

    limiˉAi=b2(a1b3r1a3)c1(a2b3r2a3)b3(b1b2c1c2),
    limiB_i=c2(a1b3r1a3)+b1(a2b3r2a3)b3(b1b2c1c2).

    Thus we have

    lim suptu(t,x)b2(a1b3r1a3)c1(a2b3r2a3)b3(b1b2c1c2) locally uniformly in R.
    lim inftv(t,x)c2(a1b3r1a3)+b1(a2b3r2a3)b3(b1b2c1c2) locally uniformly in R.

    Similarly, we can show

    lim inftu(t,x)b2(a1b3r1a3)c1(a2b3r2a3)b3(b1b2c1c2) locally uniformly in R.
    lim suptv(t,x)c2(a1b3r1a3)+b1(a2b3r2a3)b3(b1b2c1c2) locally uniformly in R.

    Thus, (ⅰ) is proved.

    (ⅱ) By Steps 1 and 2 in (ⅰ), we also have

    lim inftv(t,x)a2c2ˉA1r2Cb2=:B_1 locally uniformly in R.

    It follows from this fact and (15) that

    lim supt[c1v(t,x)+r1w(t,x)]c1B_1+r1C  locally uniformly in R.

    The condition a1+c1b2(c2a1b1+r2a3b3)c1a2b2+r1a3b3 implies

    a1c1B_1r1C=a1c1a2c2ˉA1r2Cb2r1C= a1+c1b2(c2a1b1+r2a3b3)c1a2b2r1a3b30.

    These two facts and [6,Lemma 3.14] allow us to derive

    lim suptu(t,x)0 locally uniformly in R.

    Since

    lim inftu(t,x)0 locally uniformly in R,

    we have

    limtu(t,x)=0 locally uniformly in R.

    It follows from this, (15) and [6,Lemma 3.14] that

    a2b3r2a3b2b3lim inftv(t,x)lim suptv(t,x)a2b3r2a3b2b3 locally uniformly in R,

    and so

    limtv(t,x)=a2b3r2a3b2b3 locally uniformly in R.

    We have proved (ⅱ).

    (ⅲ) This conclusion can be proved by the same arguments in (ⅱ).

    (ⅳ) By (15), we have

    lim supt[c1v(t,x)+r1w(t,x)]r1C locally uniformly in R.

    The condition a1r1a3b3 implies

    a1r1C=a1r1a3b30.

    These two facts and [6,Lemma 3.14] allow us to derive

    lim suptu(t,x)0 locally uniformly in R,

    and so

    limtu(t,x)=0 locally uniformly in R.

    Similarly, we have

    limtv(t,x)=0 locally uniformly in R.

    Then (ⅳ) has been proved.

    In this paper, we study a free boundary problem with nonlocal diffusion describing information diffusion in online social networks. This system consists of three equations representing three pieces of information propagating via the internet and competing for influence among users. We obtain the criteria for information spreading and vanishing. If the diffusion rate of any piece of information is small, i.e., d1a1 or d2a2 or d3a3, information will always spread. But when the diffusion rates of three pieces of information are all large, i.e., di>ai (i=1,2,3), whether information spread or vanish depends on the initial data. If the initial spreading area [h0,h0] is within the critical size, i.e., h0<l/2, information spread or vanish depending on the size of the expanding capacity μ, namely, vanishing happens with small expanding capability and spreading happens with large expanding capability. Regardless of the expanding capability, spreading always occurs if the initial spreading area is beyond the critical size. We find that the result of the nonlocal diffusion model (3) is different from the local diffusion model in [15].

    When spreading happens, the longtime behavior of the solution is obtained in Theorem 1.4, which is similar to the result of local diffusion model studied in [15]. According to Theorem 1.4, we can choose suitable official information to control rumor propagation in social networks, namely, we can change the value of a3 and b3 by choosing suitable official information.

    For local diffusion model (2), the result in [15] showed the spreading has a finite speed when spreading happens. However, what will happen for the nonlocal diffusion model (3)? Very recently, Du, Li and Zhou [4] investigated the spreading speed of the nonlocal model in [3] and proved that the spreading may or may not have a finite speed, depending on whether a certain condition is satisfied by the kernel function J in the nonlocal diffusion term. This contrasts sharply to the local model of [5], where the spreading has finite speed whenever spreading happens. Since (3) consists of three equations, we expect a more complex result for (3), which will be considered in a future work.



    [1] F. Andreu-Vaillo, J. M. Mazˊon, J. D. Rossi and J. J. Toledo-Melero, Nonlocal Diffusion Problems, Mathematical Surveys and Monographs, 165. American Mathematical Society, Providence, RI; Real Sociedad Matemática Española, Madrid, 2010. doi: 10.1090/surv/165
    [2] Spreading speed revisited: Analysis of a free boundary model. Netw. Heterog. Media (2012) 7: 583-603.
    [3] The dynamics of a Fisher-KPP nonlocal diffusion model with free boundary. J. Funct. Anal. (2019) 277: 2772-2814.
    [4] Y. Du, F. Li and M. Zhou, Semi-wave and spreading speed of the nonlocal Fisher-KPP equation with free boundaries, preprint, arXiv: 1909.03711.
    [5] Spreading-vanishing dichotomy in the diffusive logistic model with a free boundary. SIAM J. Math. Anal. (2013) 45: 1995-1996.
    [6] Y. Du, M. Wang and M. Zhao, Two species nonlocal diffusion systems with free boundaries, preprint, arXiv: 1907.04542.
    [7] The free boundary problem describing information diffusion in online social networks. J. Differ. Equ. (2013) 254: 1326-1341.
    [8] L. Li, W. Sheng and M. Wang, Systems with nonlocal vs. local diffusions and free boundaries, J. Math. Anal. Appl., 483 (2020), article no. 123646, 27 pp. doi: 10.1016/j.jmaa.2019.123646
    [9] The dynamics of nonlocal diffusion systems with different free boundaries. Comm. Pure Appl. Anal. (2020) 19: 3651-3672.
    [10] Entire solutions in the Fisher-KPP equation with nonlocal dispersal. Nonlinear Anal. Real World Appl. (2010) 11: 2302-2313.
    [11] Entire solutions of nonlocal dispersal equations with monostable nonlinearity in space periodic habitats. J. Differ. Equ. (2016) 261: 2472-2501.
    [12] Traveling waves and entire solutions for an epidemic model with asymmetric dispersal. Discrete Contin. Dyn. Syst. (2017) 37: 2483-2512.
    [13] Invasion entire solutions in a competition system with nonlocal dispersal. Discrete Contin. Dyn. Syst. (2015) 35: 1531-1560.
    [14] C. Peng, K. Xu, F. Wang and H. Wang, Predicting information diffusion initiated from multiple sources in online social networks, in 6th International Symposium on Computational Intelligence and Design(ISCID), (2013), 96–99. doi: 10.1109/ISCID.2013.138
    [15] Spreading-vanishing dichotomy in information diffusion in online social networks with intervention. Discrete Contin. Dyn. Syst. Ser. B (2019) 24: 1843-1865.
    [16] Entire solutions in nonlocal monostable equations: Asymmetric case. Commun. Pure Appl. Anal. (2019) 18: 1049-1072.
    [17] F. Wang, H. Wang and K. Xu, Diffusive logistic model towards predicting information diffusion in online social networks, in 32nd International Conference on Distributed Computing Systems Workshops (ICDCS), (2012), 133–139. doi: 10.1109/ICDCSW.2012.16
    [18] J. Wang and M. Wang, Free boundary problems with nonlocal and local diffusions Ⅰ: Global solution, J. Math. Anal. Appl., (2020), 123974. doi: 10.1016/j.jmaa.2020.123974
    [19] J. Wang and M. Wang, Free boundary problems with nonlocal and local diffusions Ⅱ: Spreading-vanishing and long-time behavior, Discrete Contin. Dyn. Syst. Ser. B, (2020). doi: 10.3934/dcdsb.2020121
    [20] Invasion by an inferior or superior competitor: A diffusive competition model with a free boundary in a heterogeneous environment. J. Math. Anal. Appl. (2015) 423: 377-398.
    [21] On some free boundary problems of the prey-predator model. J. Differ. Equ. (2014) 256: 3365-3394.
    [22] Free boundary problems for a Lotka-Volterra competition system. J. Dyn. Differ. Equ. (2014) 26: 655-672.
    [23] A free boundary problem for the predator-prey model with double free boundaries. J. Dyn. Differ. Equ. (2017) 29: 957-979.
    [24] Entire solution in an ignition nonlocal dispersal equation: Asymmetric kernel. Sci. China Math. (2017) 60: 1791-1804.
    [25] Entire solutions for nonlocal dispersal equations with bistable nonlinearity: Asymmetric case. Acta Math. Sin. (English Ser.) (2019) 35: 1771-1794.
    [26] Complex dynamic behavior of a rumor propagation model with spatial-temporal diffusion terms. Inform. Sci. (2016) 349–350: 119-136.
    [27] L. Zhu, H. Zhao and H. Wang, Partial differential equation modeling of rumor propagation in complex networks with higher order of organization, Chaos, 29 (2019), 053106, 23 pp. doi: 10.1063/1.5090268
  • This article has been cited by:

    1. Phuong Le, Longtime behavior of a free boundary model with nonlocal diffusion in online social networks, 2025, 6, 2662-2963, 10.1007/s42985-025-00324-3
  • Reader Comments
  • © 2020 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(2415) PDF downloads(283) Cited by(1)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog