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

Influence maximization in social networks using role-based embedding

  • Influence maximization (IM), a central issue in optimizing information diffusion on social platforms, aims to spread posts or comments more widely, rapidly, and efficiently. Existing studies primarily focus on the positive effects of incorporating heuristic calculations in IM approaches. However, heuristic models fail to consider the potential enhancements that can be achieved through network representation learning techniques. Some recent work is keen to use representation learning to deal with IM issues. However, few in-depth studies have explored the existing challenges in IM representation learning, specifically regarding the role characteristics and role representations. This paper highlights the potential advantages of combining heuristic computing and role embedding to solve IM problems. First, the method introduces role granularity classification to effectively categorize users into three distinct roles: opinion leaders, structural holes and normal nodes. This classification enables a deeper understanding of the dynamics of users within the network. Second, a novel role-based network embedding (RbNE) algorithm is proposed. By leveraging the concept of node roles, RbNE captures the similarity between nodes, allowing for a more accurate representation of the network structure. Finally, a superior IM approach, named RbneIM, is recommended. RbneIM combines heuristic computing and role embedding to establish a fusion-enhanced IM solution, resulting in an improved influence analysis process. Exploratory outcomes on six social network datasets indicate that the proposed approach outperforms state-of-the-art seeding algorithms in terms of maximizing influence. This finding highlights the effectiveness and efficacy of the proposed method in achieving higher levels of influence within social networks. The code is available at https://github.com/baiyazi/IM2.

    Citation: Xu Gu, Zhibin Wang, Xiaoliang Chen, Peng Lu, Yajun Du, Mingwei Tang. Influence maximization in social networks using role-based embedding[J]. Networks and Heterogeneous Media, 2023, 18(4): 1539-1574. doi: 10.3934/nhm.2023068

    Related Papers:

    [1] Ke Guo, Wanbiao Ma . Global dynamics of an SI epidemic model with nonlinear incidence rate, feedback controls and time delays. Mathematical Biosciences and Engineering, 2021, 18(1): 643-672. doi: 10.3934/mbe.2021035
    [2] Yu Ji . Global stability of a multiple delayed viral infection model with general incidence rate and an application to HIV infection. Mathematical Biosciences and Engineering, 2015, 12(3): 525-536. doi: 10.3934/mbe.2015.12.525
    [3] Jinliang Wang, Gang Huang, Yasuhiro Takeuchi, Shengqiang Liu . Sveir epidemiological model with varying infectivity and distributed delays. Mathematical Biosciences and Engineering, 2011, 8(3): 875-888. doi: 10.3934/mbe.2011.8.875
    [4] Pengyan Liu, Hong-Xu Li . Global behavior of a multi-group SEIR epidemic model with age structure and spatial diffusion. Mathematical Biosciences and Engineering, 2020, 17(6): 7248-7273. doi: 10.3934/mbe.2020372
    [5] Pengfei Liu, Yantao Luo, Zhidong Teng . Role of media coverage in a SVEIR-I epidemic model with nonlinear incidence and spatial heterogeneous environment. Mathematical Biosciences and Engineering, 2023, 20(9): 15641-15671. doi: 10.3934/mbe.2023698
    [6] Maoxing Liu, Yuhang Li . Dynamics analysis of an SVEIR epidemic model in a patchy environment. Mathematical Biosciences and Engineering, 2023, 20(9): 16962-16977. doi: 10.3934/mbe.2023756
    [7] Tingting Xue, Long Zhang, Xiaolin Fan . Dynamic modeling and analysis of Hepatitis B epidemic with general incidence. Mathematical Biosciences and Engineering, 2023, 20(6): 10883-10908. doi: 10.3934/mbe.2023483
    [8] N. H. AlShamrani, A. M. Elaiw . Stability of an adaptive immunity viral infection model with multi-stages of infected cells and two routes of infection. Mathematical Biosciences and Engineering, 2020, 17(1): 575-605. doi: 10.3934/mbe.2020030
    [9] Thomas Torku, Abdul Khaliq, Fathalla Rihan . SEINN: A deep learning algorithm for the stochastic epidemic model. Mathematical Biosciences and Engineering, 2023, 20(9): 16330-16361. doi: 10.3934/mbe.2023729
    [10] Xiao-Min Huang, Xiang-ShengWang . Traveling waves of di usive disease models with time delay and degeneracy. Mathematical Biosciences and Engineering, 2019, 16(4): 2391-2410. doi: 10.3934/mbe.2019120
  • Influence maximization (IM), a central issue in optimizing information diffusion on social platforms, aims to spread posts or comments more widely, rapidly, and efficiently. Existing studies primarily focus on the positive effects of incorporating heuristic calculations in IM approaches. However, heuristic models fail to consider the potential enhancements that can be achieved through network representation learning techniques. Some recent work is keen to use representation learning to deal with IM issues. However, few in-depth studies have explored the existing challenges in IM representation learning, specifically regarding the role characteristics and role representations. This paper highlights the potential advantages of combining heuristic computing and role embedding to solve IM problems. First, the method introduces role granularity classification to effectively categorize users into three distinct roles: opinion leaders, structural holes and normal nodes. This classification enables a deeper understanding of the dynamics of users within the network. Second, a novel role-based network embedding (RbNE) algorithm is proposed. By leveraging the concept of node roles, RbNE captures the similarity between nodes, allowing for a more accurate representation of the network structure. Finally, a superior IM approach, named RbneIM, is recommended. RbneIM combines heuristic computing and role embedding to establish a fusion-enhanced IM solution, resulting in an improved influence analysis process. Exploratory outcomes on six social network datasets indicate that the proposed approach outperforms state-of-the-art seeding algorithms in terms of maximizing influence. This finding highlights the effectiveness and efficacy of the proposed method in achieving higher levels of influence within social networks. The code is available at https://github.com/baiyazi/IM2.



    Measles is an infectious disease caused by a virus of the genus Morbilivirus and belonging to a group RNA viruses. The extremely contagious measles virus is spread when people cough or sneeze, through close contact between people or through direct contact with nasal, laryngeal secretions or with contaminated objects [1,2]. Symptoms of measles are characterized by a high fever accompanied by cough, runny nose, red and watery eyes, and Koplik's spot, which appear about 10–12 days after exposed to the virus [1]. In 2018, more than 140,000 people worldwide died from measles in part large are children under 5 years of age [3]. Measles immunization is given to infants aged 9 months because babies under that age still have innate immunity from their mother. Measles virus quickly killed by ultraviolet rays, chemicals, acids, and heating. Hence, early handling against measles can be done after going through laboratory confirmation by doing serological examination (patient blood collection/blood serum) or virological examination (patient urine collection) [2].

    In the current context where we live serious health crises both in the industrialized countries and those who are less industrialized, one of the disciplinary fields of predilection embraced by mathematical modeling is public health. Several research teams are interested in the potential of mathematical models in the development of new tools and methods to control the spread of a disease [4]. Mathematical modeling of infectious diseases makes it possible to study the unexplained questions of an epidemic in a population, its dynamics of transmission, the probability that the epidemic will spread or die out in the susceptible population, the best vaccination strategy that would be effective to be undertaken by governments and any possibility of treatment of the disease. Develop, validate and use mathematical models to analyze and predict the dynamics of infectious diseases such as HIV, tuberculosis and hepatitis using the available data [5]. In the context of predictions and insights for the time-evolution related to infectious diseases, several researchers developed mathematical compartmental models; for example, see [6,7,8,9,10,11,12,13,14,15].

    The spread of infectious diseases can be modeled with an epidemiological model, using either deterministic or stochastic approach [16,17,18,19,20,21]. In the health sector, epidemiological models can be used for proposing and testing theories, as well as for comparing, planning, implementing, and evaluating various detection, prevention, or control programs [22]. One of the basic models for the spread of disease was proposed by Kermack and McKendrick [23] in 1927. In their original model, Kermack and McKendrick introduced a model of dividing differential equations population into three compartments, namely the infected population compartment (I), the susceptible population compartment (S), and the recovered population compartment (R), known as the Susceptible (susceptible)-Infected (infected)-Recovered ("SIR") model [23]. The "SIR" model is used to model disease assuming that it is an individual have permanent immunity or temporary immunity for a very long period of time. Measles epidemic models have been studied by several researchers using deterministic models, as in [2,7,24,25]. In [25], Momoh et al. used the "SEIR" (Susceptible, Exposed, Infected, Recovered) to analyze the effect of testing and therapy for measles during the incubation period (exposed) against the dynamics of the spread of measles. Furthermore, Edward et al. [24] using the "SVEIR" model (Susceptible, Vaccinated, Exposed, Infected, Recovered) taking into account the proportion of immigrants who have been vaccinated, the proportion of the population that has been vaccinated twice, and the rate of effectiveness of the first vaccine. It is modified by Aldila and Asrianti [7] by differentiating the compartments of the population that have been vaccinated once and the population compartment that has been vaccinated twice, as well as the population compartment that has been vaccinated do quarantine. Fakhruddin et al. [2] modified the "SIR" model by adding a hospitalized (Hospitalized) infected population compartments.

    The application of the "SVEIR" model to the spread of measles as reviewed in this article is in line with government efforts to control, reduce, and even eliminate the spread of measles human population, by carrying out a mass measles vaccine since 2000 [2]. Based on Therefore, the model reviewed in this article modifies the model proposed by Momoh et al. [25] with add vaccinated population compartments, and analyze the dynamics of the spread measles by looking at the influence of the proportion of susceptible population who have been vaccinated and the rate of infection when susceptible individuals interact with infected individuals. In [26], Wei et al. proposed an "SVEIR" epidemic model where a pulse vaccination was given for each individual. The strategy is to vaccinate each individual several times by separating doses of a definite time of a certain age group. Therefore, in the present article, we shall revisit and analyse the model first proposed by Hethcote [18], then studied by Gumel et al. [12], Wei et al. [26], Adda et al. [27], and then by Nkamba et al. [28] but by considering general nonlinear increasing incidence rate with respect to the infected individuals. Our choice is motivated by the fact that the number of effective contacts between infected individuals and susceptible individuals or between vaccinated individuals and infected individuals may increase at high infective levels due to crowding of infected individuals. Further, we proposed an optimal vaccination strategy relative to this epidemic model in order to minimize the number of both infected and exposed individuals.

    The organization of the paper is as follows: In a first step, we present, in Section 2, a description of the investigated model. Further, the basic properties of the model for the existence of the solutions are obtained. The basic reproduction number R was calculated using the next generation matrix method. Then existence, uniqueness of the model equilibria was studied. Local stability of the equilibria of the proposed model was investigated in Section 3. The global stability and asymptotic behaviour of the solution are discussed in Section 4. In Section 5, the sensitivity analysis of the basic reproduction number R with respect to the model parameters is carried out. In Section 6, we proposed and formulated an optimal vaccination strategy in order to optimize the number of infected and exposed individuals. We discussed the existence, uniqueness and characterisation of the optimal solution. Finally, in Section 7, we give some numerical simulations, validating the theoretical results where we applied an appropriated numerical scheme inspired from the competitive Gauss-Seidel like implicit difference method.

    We assume that the total population is divided into five classes (compartments) according to their status concerning disease: susceptible S(t), vaccinated V(t), exposed E(t), infected I(t), and recovered R(t) classes. The susceptible class, S(t), represents the individuals that having the risk to catch the infection because of the close contact with the infected individuals. The vaccinated class, V(t), consists of those individuals who may be given an imperfect vaccine that reduces their susceptibility to the disease; still, they can get the infection under some suitable conditions. The infected class, I(t), represents the individuals who already cached the disease, and they are able to infect the susceptible individuals for some suitable conditions. The recovered class, R(t), represents the individuals who are already infected, and now they recovered their healthy due to either treatment or immunization. Schematically, the spread of measles using the "SVEIR" model is presented in the following transfer diagram.

    To build a deterministic model for the "SVEIR" spread of measles, several things are assumed following.

    Λ is the recruitment rate of susceptible individuals.

    p describe the rate of vaccination.

    θ[0,1] is the effectiveness rate of the vaccination.

    ● Each compartment has a specific natural mortality rate. ms, mv, me, mi and mr are the mortality rates of susceptible, vaccinated, exposed, infected and recovered individuals, respectively.

    ● Measles can cause death (fatal) with a mortality rate of ζ.

    f represents the saturated incidence rate.

    ε the rate at which an exposed individuals become infectious. 1/ε is the average latency time spent in compartment E.

    γ the rate at which infectious agents recover their health. 1/γ is the average duration elapsed in compartment I.

    ● Individuals who have been vaccinated will no gain permanent immunity so they will can be infected again.

    ● Measles has an incubation period so that when the incubation period ends, individuals in the Exposed (E) compartment will move to the Infected (I) compartment at a rate of ε.

    ● The recovery rate of individuals infected with measles is γ.

    ● Recovered individuals will not re-infect.

    The generalized "SVEIR" mathematical model of the ones given in [12,26,27,28] for the spread of the epidemic based on the transfer diagram in Figure 1 is given by:

    {˙S=Λ(ms+p)Sf(I)S,˙V=pSmvVθf(I)V,˙E=f(I)(S+θV)(me+ε)E,˙I=εE(mi+ζ+γ)I,˙R=γImrR, (2.1)
    Figure 1.  "SVEIR" epidemic compartmental model.

    with positive initial condition (S(0),V(0),E(0),I(0),R(0))R5+.

    Table 1.  Variables and parameters description.
    Variable Description Parameter Description
    S(t) Susceptible individuals f Saturated incidence rate
    V(t) Vaccinated individuals Λ Susceptible recruitment rate
    E(t) Exposed individuals ε Infection transmission rate
    I(t) Infected individuals γ Recovery rate
    R(t) Recovered individuals θ[0,1] Effectiveness rate of the vaccination
    Parameter Description Parameter Description
    mv Mortality rate of vaccinated individuals ms mortality rate of susceptible individuals
    me Mortality rate of exposed individuals p vaccination rate
    mi+ζ Total mortality rate of infected individuals 1ε Average latency time spent in compartment E
    mr Mortality rate of recovered individuals 1γ Average duration elapsed in compartment I

     | Show Table
    DownLoad: CSV

    Assumption 1. The function f is non-negative C1(R+), increasing bounded and concave such that f(0)=0.

    Any function f satisfying Assumption 1 satisfies the following lemma.

    Lemma 1. f(I)I<f(I)f(0)I for all I>0.

    Proof. For IR+, let h1(I)=f(I)If(I). Since f is an increasing and concave function then f(I)0 and f(I)0. Therefore h1(I)=If(I)0 and h1(I)h1(0)=0 or also f(I)If(I). Similarly, let h2(I)=f(I)If(0) then h2(I)=f(I)f(0)0 since f is concave. Then h2(I)h2(0)=0 then f(I)If(0).

    Remark 1. The Monod (or Holling's type Ⅱ) functions satisfy the assumption 1 and then can express the transmission rate.

    f(I)=ˉfIk+I

    ˉf designs the maximum transmission rate and k represents the Monod constant.

    In order to prove that the system (2.1) is well-posed, we will give some general properties. Let m=min(ms,mv,me,mi+ζ,mr), then

    Proposition 1. The compact set Ω1={(S,V,E,I,R)R5+/S+V+E+I+RΛm} is positively invariant for system (2.1).

    Proof. Since ˙S|S=0=Λ>0, ˙V|V=0=pS>0, ˙E|E=0=f(I)(S+θV)>0, ˙I|I=0=εE>0 and ˙R|R=0=γI>0, then the solution of system (2.1) is non-negative.

    Consider a new variable T=S+V+E+I+RΛm, then by adding all equations of (2.1), T satisfies:

    ˙T=˙S+˙V+˙E+˙I+˙R=ΛmsSmvVmeE(mi+ζ)ImrRΛm(S+V+E+I+R)m(ΛmSVEIR)mT.

    Hence

    T(t)T(0)emt. (2.2)

    Since all variables are non-negative then all variables are bounded and thus Ω1 is positively invariant for system (2.1).

    In epidemiology, a major health index calculating the average number of people an infectious person infects while they are contagious, is called the basic reproduction number, and it is denoted R. Recall that R is the number of secondary infections produced by a single typical infection in a susceptible population, a very common question is how to define R when there are several types of infected individuals, for example we can have an atypical infection in a disease vector-borne such as malaria, or sexually transmitted infections when there are large asymmetries in transmission, such as HIV, or a multiple-host pathogen such as influenza. The key concept is that we now need to average the expected number of news infections in our case. If there are several compartments representing infectious individuals, the next-generation matrix method introduced by Diekmann [4] and developed later by van den Driessche and Watmough [5] is used to calculate the basic reproduction number R. Let S0=Λms+p,V0=pΛmv(ms+p),E0=0,ˉI0=0 and R0=0. The Jacobian of the sub-system (E,I) of the original system (2.1) at the disease-free equilibrium point E0=(S0,V0,E0,I0,R0) is given by

    J(E0)=((me+ε)f(0)(S0+θV0)ε(mi+ζ+γ))=F+V

    where F=(0f(0)(S0+θV0)00) and V=((me+ε)0ε(mi+ζ+γ)).

    The determinant of V is given by det(V)=(me+ε)(mi+ζ+γ)>0 and thus the inverse matrix of V is

    V1=(1(mi+ζ+γ)0ε(me+ε)(mi+ζ+γ)1(me+ε))

    and the next-generation matrix is given by

    FV1=(εf(0)(S0+θV0)(me+ε)(mi+ζ+γ)f(0)(S0+θV0)(me+ε)00).

    Then, the basic reproduction number of system (2.1) is calculated as the spectral radius of the matrix FV1:

    R=εf(0)(S0+θV0)(me+ε)(mi+ζ+γ)=Λεf(0)(mv+θp)mv(me+ε)(mi+ζ+γ)(ms+p). (2.3)

    Note that in absence of vaccination (p=0), the system (2.1) becomes the standard SEIR model with

    R0=R|p=0=Λεf(0)ms(me+ε)(mi+ζ+γ). (2.4)

    Proposition 2. System (2.1) admits a trivial (disease-free) equilibrium point E0=(S0,V0,E0,I0,R0) and if R>1, system (2.1) admits a unique non-trivial (endemic) equilibrium point E1=(S1,V1,E1,I1,R1) with S1,V1,E1,I1,R1>0.

    Proof. An equilibrium point for the system (2.1) satisfies

    {0=Λ(ms+p)Sf(I)S,0=pSmvVθf(I)V,0=f(I)(S+θV)(me+ε)E,0=εE(mi+ζ+γ)I,0=γImrR, (2.5)

    which reduces to

    {S=Λ(ms+p+f(I)),V=pS(mv+θf(I))=pΛ(mv+θf(I))(ms+p+f(I)),E=f(I)(me+ε)(S+θV)=Λf(I)(mv+θp+θf(I))(me+ε)(ms+p+f(I))(mv+θf(I)),I=ε(mi+ζ+γ)E=εΛf(I)(mv+θp+θf(I))(mi+ζ+γ)(me+ε)(ms+p+f(I))(mv+θf(I)),R=γmrI=γεΛf(I)(mv+θp+θf(I))mr(mi+ζ+γ)(me+ε)(ms+p+f(I))(mv+θf(I)). (2.6)

    From the fourth equation of (2.6) one deduces that

    I=εΛf(I)(mv+θp+θf(I))(mi+ζ+γ)(me+ε)(ms+p+f(I))(mv+θf(I)).

    Since all parameters are non-negative then either I=0 or

    εΛf(I)(mv+θp+θf(I))=I((mi+γ)(me+ε)(ms+p+f(I))(mv+θf(I))).

    ● If I=0 then R=0,E=0,S=Λms+p=ˉS and V=pSmv=pΛmv(ms+p)=ˉV. This equilibrium known as the disease-free equilibrium denoted here by E0=(S0,V0,E0,I0,R0).

    ● For I0, define the continuous function g

    g(I)=1εΛf(I)I(mv+θp+θf(I))(mi+ζ+γ)(me+ε)(ms+p+f(I))(mv+θf(I)).

    The derivative of g is given by

    g(I)=εΛ(mi+ζ+γ)(me+ε)(ms+p+f(I))2(mv+θf(I))2×([f(I)If(I)I2(mv+θp+θf(I))+θf(I)f(I)I](ms+p+f(I))(mv+θf(I))f(I)f(I)I(mv+θp+θf(I))(mv+θf(I)+θ(ms+p+f(I))))=εΛf(I)If(I)I2(mv+θp+θf(I))(mi+ζ+γ)(me+ε)(ms+p+f(I))(mv+θf(I))εΛf(I)f(I)I(mi+ζ+γ)(me+ε)(ms+p+f(I))2(mv+θf(I))2×(θ(ms+p+f(I))(mv+θf(I))(mv+θp+θf(I))(mv+θf(I)+θ(ms+p+f(I))))=εΛf(I)If(I)I2(mv+θp+θf(I))(mi+ζ+γ)(me+ε)(ms+p+f(I))(mv+θf(I))+εΛf(I)f(I)I((mv+θp+θf(I))(mv+θf(I))+θ2p(ms+p+f(I))))(mi+ζ+γ)(me+ε)(ms+p+f(I))2(mv+θf(I))2.

    Since all parameters are non-negative and since the function f satisfies f(I)I<f(I) for all I>0, one can easily deduce that the function g is an increasing function.

    A simple calculus gives

    limI0g(I)=1εΛlimI0f(I)I(mv+θp+θlimI0f(I))(mi+ζ+γ)(me+ε)(ms+p+limI0f(I))(mv+θlimI0f(I))=1εΛlimI0f(I)I(mv+θp)mv(mi+ζ+γ)(me+ε)(ms+p)=1εΛf(0)(mv+θpmv(mi+ζ+γ)(me+ε)(ms+p)=1R,

    and

    g(Λm)=1εmf(Λm)(mv+θp+θf(Λm))(mi+ζ+γ)(me+ε)(ms+p+f(Λm))(mv+θf(Λm))>1εmf(Λm)(mv+θp+θf(Λm))(mi+ζ)ε(ms+p+f(Λm))(mv+θf(Λm))>1εmf(Λm)(mv+θp+θf(Λm))mε(ms+p+f(Λm))(mv+θf(Λm))>1εmf(Λm)(mv+θp+θf(Λm))mεf(Λm)(mv+θf(Λm))+mεpθf(Λm)+mεmsmv=εmsmvεf(Λm)(mv+θf(Λm))+εpθf(Λm)+εmsmv>0

    Since R>1, limI0g(I)<0 and g(Λm)>0, the equation g(I)=0 admits a unique solution I1 in (0,Λm) and then the uniqueness of the endemic equilibrium E1=(S1,V1,E1,I1,R1).

    In the section below, we discussed the local stability of equilibria with respect to the value of the basic reproduction number R.

    Theorem 1. If R<1, then the disease-free equilibrium (DFE) point E0 is locally asymptotically stable and it is unstable if R>1.

    Proof. The Jacobian matrix associated to the system (2.1) at a given point (S,V,E,I,R) is calculated as follows:

    J=((ms+p)f(I)00f(I)S0pmvθf(I)0θf(I)V0f(I)θf(I)(me+ε)f(I)(S+θV)000ε(mi+ζ+γ)0000γmr)

    It's value, evaluated at E0, is given by:

    ˉJ=(msp00f(0)S00pmv0θf(0)V0000meεf(0)(S0+θV0)000εmiζγ0000γmr)

    which admits five distinguish eigenvalues given by λ1=(ms+p)<0,λ2=mv<0,λ3=mr<0 and two other eigenvalues corresponding to the sub-matrix

    ((me+ε)f(0)(S0+θV0)ε(mi+ζ+γ)).

    The corresponding characteristic polynomial is calculated as follows

    P(λ)=λ2+(me+mi+ζ+ε+γ)λ+(1R)(me+ε)(mi+ζ+γ).

    Only if R<1, then the roots of P(.) have negative real parts. Then E0 is locally asymptotically stable only if R<1. E0 is unstable once R>1.

    In the next section, the global stability behavior of the equilibria will be discussed.

    Corollary 1. The set Ω2={(S,V,E,I,R)R5+/S+V+E+I+RΛm;SS0,VV0} is positively invariant for system (2.1).

    Proof. It is already proved that Ω1 is invariant for system (2.1). Note that ˙S(t)<0 for S(t)>S0 therefore lim infS(t)S0. Let ξ>0 be a constant and S(0) be an initial condition. Then T0;S(t)S0+ξtT. Therefore

    ˙V(t)<p(S0+ξ)mvVfor alltT.

    Consider ˉV=Vp(S0+ξ)mv which satisfies

    ˙ˉV(t)<mvˉVfor alltT. (4.1)

    Then

    ˙ˉV(t)<˜V(0)emvtfor alltT. (4.2)

    Therefore lim infˉV(t)0 and lim infV(t)p(S0+ξ)mv for all ξ>0 thus lim infV(t)pS0mv=V0. This completes the proof.

    Theorem 2. E0 is globally asymptotically stable if R1 however it is unstable if R>1.

    Proof. Let the function F0 given by:

    F0=εE+(me+ε)I.

    Since f(I)f(0)I, the time-derivative of F0 is given by:

    ˙F0=ε˙E+(me+ε)˙I=ε(f(I)(S+θV)(me+ε)E)+(me+ε)(εE(mi+ζ+γ)I)=εf(I)(S+θV)(me+ε)(mi+γ)Iεf(0)I(S+θV)(me+ε)(mi+ζ+γ)I(εf(0)(S+θV)(me+ε)(mi+ζ+γ))I(me+ε)(mi+ζ+γ)(εf(0)(S+θV)(me+ε)(mi+ζ+γ)1)I(me+ε)(mi+ζ+γ)(εf(0)(ˉS+θˉV)(me+ε)(mi+ζ+γ)1)I,sinceSˉS,VˉV=(me+ε)(mi+ζ+γ)(R1)I,(S,V,E,I,R)Ω2.

    If R1, then ˙F00 for all S,V,E,I,R>0. Let W0={(S,V,E,I,R):˙F0=0}={E0}. Then by LaSalle's invariance principle [29] E0 is globally asymptotically stable once R1 (see [9,20,21,30] for some applications). Then the solution of system (2.1) converges to E0 as t+.

    Hereafter, we study the global stability analysis for the endemic equilibrium E1.

    Theorem 3. If R>1, then the endemic equilibrium E1 is globally asymptotically stable.

    Proof. Let the function F1, given by

    F1=(SS1ln(SS1))+(VV1ln(VV1))+(EE1ln(EE1))+me+εε(II1ln(II1)).

    The function F1 admits its minimum value F1min=S1+V1+E1+me+εεI1 once S=S1,V=V1,E=E1,I=I1. The time-derivative of F1, along solutions of system (2.1) is given by

    ˙F1=(1S1S)˙S+(1V1V)˙V+(1E1E)˙E+me+εε(1I1I)˙I=(1S1S)(Λ(ms+p)Sf(I)S)+(1V1V)(pSmvVθf(I)V)+(1E1E)(f(I)(S+θV)(me+ε)E)+me+εε(1I1I)(εE(mi+ζ+γ)I)=ΛmsSΛS1S+msS1+pS1+f(I)S1mvVpSV1V+mvV1+θf(I)V1f(I)(S+θV)E1E+(me+ε)E1me+εε(mi+ζ+γ)I(me+ε)EI1I+me+εε(mi+ζ+γ)I1=msS1msSmsS2S+msS1+mvV1mvS1SV1+mvV1mvV+mvV1+mvV1mvV2VSS1+f(I1)(S1+θV1)f(I1)S2Sθf(I1)V1S1S+θf(I1)V1+f(I1)S1θf(I1)V2VSS1
    +θf(I)V1f(I)(S+θV)E1E+f(I)(S1+θV1)me+εε(mi+ζ+γ)I(me+ε)EI1I+me+εε(mi+ζ+γ)I1=msS1(2SS1S1S)+mvV1(3S1SVV1V1VSS1)+3f(I1)S1f(I1)S2Sf(I1)S1EE1I1If(I)SE1E3θf(I1)V1+θf(I1)V1θf(I1)V2VSS1θf(I)VE1Eθf(I1)V1EE1I1Iθf(I1)V1S1Sme+εε(mi+ζ+γ)I+f(I)(S1+θV1)=msS1(2SS1S1S)+mvV1(3S1SVV1V1VSS1)+f(I1)S1(3S1SII1SS1E1EEE1I1I)+θf(I1)V1(4V1VSS1II1VV1E1EEE1I1IS1S).

    Since

    x1+x2+x3++xnnnx1.x2.x3xn,x1,x2,x3,,xn0 (4.3)

    then (2SS1S1S)0,(3S1SVV1V1VSS1)0, (3S1SII1SS1E1EEE1I1I)0, (4V1VSS1II1VV1E1EEE1I1IS1S)0. Therefore ˙F20. Thank's to Lyapunov theorem, E1 is stable.

    Now, we have to show the asymptotic stability of E1 using the Lasalle invariance principle.

    Define A=(2SS1S1S),B=(3S1SVV1V1VSS1), C=(3S1SII1SS1E1EEE1I1I),

    D=(4V1VSS1II1VV1E1EEE1I1IS1S). Then ˙F1(S,V,E,I,R)=0 if and only if A=B=C=D=0.

    A=0 means that S=S1 and B=0 means that V=V1. If moreover C=0 then EE1=II1. To conclude

    ˙F1(S,V,E,I,R)=0S=S1,V=V1,EE1=II1.

    Let a=EE1=II1, then E=aE1 and I=aI1.

    The endemic equilibrium satisfies

    |Λ=(ms+p)S1+f(I1)S1,pS1=mvV1+θf(I1)V1,f(I1)(S1+θV1)=(me+ε)E1,εE1=(mi+ζ+γ)I1.

    Then

    pS1=mvV1+θf(I1)V1,a=1

    and thus I=I1 and E=E1. Finally

    ˙F1(S,V,E,I,R)=0(S=S1,V=V1,E=E1,I=I1,R=R1).

    Therefore {(S,V,E,I,R)|˙F1=0}={E1}. Then by LaSalle's invariance principle [29] E1 is globally asymptotically stable once R>1 (see [9,20,21,30] for some applications).

    The sensitivity analysis helps to determine how the variability of the model outputs can be attributed to different sources of variation of its input parameters [31,32]. It can thus have various objectives:

    ● Identify the input parameters that most contribute to an output of interest from the model. Consequently, this makes it possible to prioritize the parameters to be estimated rather than to estimate all the uncertain parameters in order to save simulation time considerable (most common goal).

    ● Detect and quantify the effects of interactions between input parameters.

    ● Determine possible simplifications of the model.

    In our case, the sensitivity analysis can tells us how important each parameter with respect to the disease transmission. Thus we have to discover the parameters that have the most high impact on the basic reproduction number R. These parameters will be targeted by any possible intervention strategies. A key parameter known as the normalized forward sensitivity index describe the ratio of the relative change in the variable to the relative change in this parameter. If the result is positive, this means that an increase in the parameter value induces an increase in the basic reproduction number value. However, a negative sensitivity index means that the parameter and the basic reproduction number are inversely proportional [33].

    Definition 1. (see [31,32]). The normalized forward sensitivity index of R that depends differentiably on a parameter ρ is defined by

    YRρ=Rρ×ρ|R|.

    For instance, YRρ=1 implies an increase (decrease) of ρ by y% increases (decreases) R by the same percentage. On the other hand, YRρ=1 indicates an increase (decrease) of ρ by y% decreases (increases) R by y%. In this case, ρ is called a highly sensitive parameter.

    Proposition 3. The explicit expression of R is given by

    R=Λεf(0)(mv+θp)mv(me+ε)(mi+ζ+γ)(ms+p).

    The basic reproduction number R depends on some parameters, we calculate analytical expressions for its sensitivity to each of these parameters by calculating the normalized forward sensitivity index as the following:

    Proof. This follows immediately from Definition 1.

    From the Table 2, it is to be noted that the parameters Λ,ε and θ are positive and hence an increase of the values of parameters Λ,ε and θ leads to an increase of the value of R. Note that the dependence of R on p depend on the sign of (θmsmv), and the dependence of R on the remaining parameters are negative and hence an increase of the values of these parameters leads to a decrease of the value of R.

    Table 2.  Sensitivity of R for the parameter values.
    Parameter Sensitivity index of R Sign
    Λ YRΛ=RΛ×ΛR=1 +ve
    ε YRε=Rε×εR=meme+ε +ve
    θ YRθ=Rθ×θR=θpmv+θp +ve
    p YRp=Rp×pR=(θmsmv)p(ms+p)(mv+θp)
    mv YRmv=Rmv×mvR=θpmv+θp -ve
    ms YRms=Rms×msR=msms+p -ve
    me YRme=Rme×meR=meme+ε -ve
    mi YRmi=Rmi×miR=mimi+ζ+γ -ve
    ζ YRζ=Rζ×ζR=ζmi+ζ+γ -ve
    γ YRγ=Rγ×γR=γmi+ζ+γ -ve

     | Show Table
    DownLoad: CSV

    The optimal control strategy for epidemic models remains a wide open research area [20,34,35]. In this section, we proposed an optimal vaccination strategy as the limit of preventive strategies for which vaccination effort is minimized. Since the fifth equation doesn't affect the other equations, let consider the reduced system given by

    {˙S=Λ(ms+p)Sf(I)S,˙V=pSmvVθf(I)V,˙E=f(I)(S+θV)(me+ε)E,˙I=εE(mi+ζ+γ)I, (6.1)

    where p=p(t) is a function that will be considered as control.

    Note that the compact set Ω1={(S,V,E,I)R4+/S+V+E+IΛm} is positively invariant for system (6.1).

    Assume moreover that f is globally Lipschitz with an upper bound ˉf=supI>0f(I) and a Lipschitz constant Lf. Consider the admissible space

    Vad={p|p(t)is measurable,pminp(t)<pmax,0tT}

    where pmin and pmax are the bounds of the control.

    The optimal control problem considered here is

    minpVadJ(p)=minpVadT0(a2p2(t)+αE(t)+βI(t))dtsubject to (6.1). (6.2)

    Our objective for the work is to minimize the number of exposed E(t) and infective I(t) in the population and the cost of vaccination by using the optimal vaccination rate p(t). The quantities α and β denote the weight constants of the exposed and infective human population.

    For φ=(S,V,E,I)t, the system (6.1) takes a new form

    ˙φ=Aφ+G(φ)=F(φ) (6.3)

    where A=(msp000pmv0000meε000εmiζγ) and G(φ)=(Λf(I)Sθf(I)V(S+θV)f(I)0).

    Proposition 4. The continuous function F is uniformly Lipschitz.

    Proof. The continuous function G is uniformly Lipschitz since

    |G(φ1)G(φ2)|=2|f(I1)S1f(I2)S2|+2θ|f(I1)V1f(I2)V2|2|S1(f(I1)f(I2))+f(I2)(S1S2)|+2θ|V1(f(I1)f(I2))+f(I2)(V1V2)|2|Λm(f(I1)f(I2))+ˉf(S1S2)|+2θ|Λm(f(I1)f(I2))+ˉf(V1V2)|2ΛmLf|I1I2|+2ˉf|S1S2|+2θΛmLf|I1I2|+2ˉf|V1V2|2max(ΛmLf,θΛmLf,ˉf)(|S1S2|+|V1V2|+|I1I2|)M|φ1φ2|

    where M=2max(ΛmLf,θΛmLf,ˉf). Since

    |Aφ1Aφ2|A|φ1φ2| (6.4)

    where . is the matrix norm, then

    |F(φ1)F(φ2)|K|φ1φ2| (6.5)

    where K=max(M,A) and the continuous function G is therefore uniformly Lipschitz.

    Once the continuous function F is uniformly Lipschitz thus the existence and uniqueness of the solution of system (6.3).

    By using Pontryagin's Maximum Principle [20,34,35,36], necessary conditions for our optimal control and corresponding states can be derived. Define the Hamiltonian H for the optimal control problems (6.1) and (6.2)

    H(S,V,E,I,p,λ1,λ2,λ3,λ4)=a2p2+αE+βI+λ1˙S+λ2˙V+λ3˙E+λ4˙I=a2p2+αE+βI+λ1(Λ(ms+p)Sf(I)S)+λ2(pSmvVθf(I)V)+λ3(f(I)(S+θV)(me+ε)E)+λ4(εE(mi+ζ+γ)I).

    For a given optimal control p, there exist adjoint functions λ1,λ2,λ3 and λ4 corresponding to the states S,V,E and I such that:

    {˙λ1=HS=p(λ1λ2)+f(I)(λ1λ3)+msλ1,˙λ2=HV=θf(I)(λ2λ3)+mvλ2,˙λ3=HE=α+ε(λ3λ4)+meλ3,˙λ4=HI=β+f(I)S(λ1λ3)+θf(I)V(λ2λ3)+(mi+ζ+γ)λ4. (6.6)

    Initial conditions of the adjoint variables are given at the time t=T by λ1(T)=0,λ2(T)=0,λ3(T)=0,λ4(T)=0.

    Since the Hamiltonian is minimized with respect to p thus the singular case could occur if the partial derivative function,

    Hp=apλ1S+λ2S, (6.7)

    is zero on a non-trivial interval of time. Since the optimal control must be between an upper and lower bounds such that: Hp<0 or >0.

    In our case, the singular expression is given by

    psingular(t)=Sa(λ1λ2) if pminSa(λ1λ2)pmax.

    For the transmission rate of infection, we used Monod function (Known also as Holling's type Ⅱ): f(I)=ˉfIk+I. ˉf designs the maximum transmission rate and k is a non-negative constant. Note that f is globally Lipschitz function on R+. For all numerical simulations presented hereafter, we used the parameter values given in Table 3.

    Table 3.  Used parameters for numerical simulations.
    Parameter ˉf k ms mv me mi ζ mr p θ
    Value 5 3 0.2 0.1 0.3 0.25 0.15 0.2 1 0.5

     | Show Table
    DownLoad: CSV

    We give first some numerical simulations confirming the global stability of the equilibria of system (2.1).

    For the both two cases where R<1, the solution of system (2.1) converges asymptotically to E0=(ˉS,ˉV,0,0,0) (Figure 2). This confirms the global stability of E0 when R1. Similarly, the both last cases where R>1, the solution of system (2.1) converges asymptotically to E1 (Figure 3). This validate the global stability of E1 when R>1.

    Figure 2.  Λ=0.5,ϵ=1,γ=3,R=0.94<1 (left) and Λ=0.5,ϵ=0.5,γ=4,R=0.59<1 (right).
    Figure 3.  Λ=1,ϵ=0.5,γ=0.3,R=10.82>1 (left) and Λ=5,ϵ=0.5,γ=0.5,R=28.94>1 (right).

    Concerning the numerical resolution of the control problem, we used an improved Gauss-Seidel implicit scheme for the state variables and a first-order backward-difference scheme for the adjoint-state variables [37]. For the numerical simulations of the optimal control problems (6.1) and (6.2), we used the same values as for the direct problem system (2.1) given in the Table 3 with Λ=5,ϵ=0.5,γ=0.5 with a variable p such that p(0)=1 and with bounds pmin=0 and pmax=10. We plot in Figure 4 the behaviours of the state variables S(t),V(t),E(t) and I(t) for different values of α and β.

    Figure 4.  Behaviours for α=1,β=10 (left) and α=10,β=1(right).

    As seen in the Figure 4, vaccinated individuals increases about 37% however the exposed and infected individuals decrease about 33 and 46%, respectively, of their number at steady-state in Figure 3 (right). As it can be noted that no considerable influence of the values of α and β on the behaviour of the variables S(t),V(t),E(t) and I(t) (Figure 4).

    In this paper, we have proposed and studied a generalized "SVEIR" epidemic model with general nonlinear incidence rate. We discussed the stability of the equilibrium points (the trivial equilibrium point E0 and the nontrivial equilibrium point E1). E0 is locally asymptotically stable once the basic reproduction number R1 and unstable once R>1. We studied the uniqueness and existence of the nontrivial equilibrium point E1 therefore we studied its stability with respect to the basic reproduction number R. We proved that E1 is locally asymptotically stable when R is greater than 1. Later, we studied the global stability of both equilibrium points of system (2.1). We proved that E0 is globally asymptotically stable once R1, and that E1 is globally asymptotically stable once R>1. The sensitivity analysis of the basic reproduction number R with respect to the model parameters was carried out. In a second step, we proposed an optimal vaccination strategy to optimise the number of infected and exposed individuals. We formulated this strategy in terms of a nonlinear optimal control problem. We discussed the existence, uniqueness and the characterisation of the optimal solution. Finally, some numerical simulations that support the obtained analytical results are given.

    The author would like to thank the editors and the anonymous reviewers whose invaluable comments and suggestions have greatly improved this manuscript.

    The authors declare no conflict of interest.

    Let a subdivision of the time interval [0,T] such that [0,T]=N1n=0[tn,tn+1], tn=ndt, dt=T/N. Let Sn,Vn,En,In, λn1,λn2,λn3,λn4 and pn be an approximation of S(t), V(t), E(t), I(t), λ1(t), λ2(t), λ3(t), λ4(t) and the control p(t) at the time tn. S0,V0,E0,I0, λ01,λ02,λ03,λ04 and p0 as the state variables, the adjoint-state variables and the control at initial time. SN,VN,EN,IN, λN1,λN2,λN3,λN4 and pN as the state variables, the adjoint-state variables and the control at final time T. The following appropriated scheme was then applied:

    {Sn+1Snδt=Λ(ms+pn)Sn+1f(In)Sn+1,Vn+1Vnδt=pnSn+1mvVn+1θf(In)Vn+1,En+1Enδt=f(In)(Sn+1+θVn+1)(me+ε)En+1,In+1Inδt=εEn+1(mi+ζ+γ)In+1,λNn1λNn11δt=pn(λNn11λNn2)+f(In+1)(λNn11λNn3)+msλNn11,λNn2λNn12δt=θf(In+1)(λNn12λNn3)+mvλNn12,λNn3λNn13δt=α+ε(λNn13λNn4)+meλNn13,λNn4λNn14δt=β+f(In+1)Sn+1(λNn11λNn13)+θf(In+1)Vn+1(λNn12λNn13)+(mi+ζ+γ)λNn14

    Hence, the following algorithm was applied.

    Algorithm 1: Optimal control resolution
    S0S0,V0V0,E0E0, I0I0, λN10,λN20,λN30,λN40,
    for n=0 to N1 do
            [Sn+1Sn+δtΛ1+δt(ms+pn)+δtf(In),Vn+1Vn+δtpnSn+11+δtmv+δtθf(In),En+1En+δtf(In)(Sn+1+θVn+1)1+δt(me+ε),In+1In+δtεEn+11+δt(mi+ζ+γ),λNn11λNn1+δtpnλNn2+δtf(In+1)λNn31+δtpn+δtf(In+1)+δtms,λNn12λNn2+δtθf(In+1)λNn31+δtθf(In+1)+δtmv,λNn13λNn3+δtα+δtελNn41+δtε+δtme,λNn14λNn4+δtβδtf(In+1)Sn+1(λNn11λNn13)1+δt(mi+ζ+γ)δtθf(In+1)Vn+1(λNn12λNn13)1+δt(mi+ζ+γ)pn+1max(min((λNn11λNn12)Sn+1a,pmax),pmin).
    end

     | Show Table
    DownLoad: CSV


    [1] J. Gu, G. Li, N. D. Vo, J. J. Jung, Contextual Word2Vec model for understanding chinese out of vocabularies on online social media, Int. J. Semant. Web. Inf. Syst., 18 (2022), 1–14. https://doi.org/10.4018/ijswis.309428 doi: 10.4018/ijswis.309428
    [2] G. Manal, Social media data for the conservation of historic urban landscapes: Prospects and challenges, in Culture and Computing. Design Thinking and Cultural Computing (eds. M. Rauterberg), Springer, (2021), 209–223. https://doi.org/10.1007/978-3-030-77431-8_13
    [3] J. Zhao, L. Yang, X. Yang, Maximum profit of viral marketing: An optimal control approach, in Proceedings of the 2019 4th International Conference on Mathematics and Artificial Intelligence, Association for Computing Machinery, (2019), 209–214. https://doi.org/10.1145/3325730.3325767
    [4] D. Pedro, R. Matt, Mining the network value of customers, in Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, Association for Computing Machinery, (2001), 57–66. https://doi.org/10.1145/502512.502525
    [5] X. Song, B. L. Tseng, C. Lin, M. Sun, Personalized recommendation driven by information flow, in Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, Association for Computing Machinery, (2006), 509–516. https://doi.org/10.1145/1148170.1148258
    [6] Y. Li, D. Zhang, K. Tan, Real-time targeted influence maximization for online advertisements, Proc. VLDB Endow., 8 (2015), 1070–1081. https://doi.org/10.14778/2794367.2794376 doi: 10.14778/2794367.2794376
    [7] L. Simone, M. Diego, R. Giuseppe, M. Maurizio, Mining micro-influencers from social media posts, in Proceedings of the 35th Annual ACM Symposium on Applied Computing, Association for Computing Machinery, (2020), 867–874. https://doi.org/10.1145/3341105.3373954
    [8] X. Zhou, S. Li, Z. Li, W. Li, Information diffusion across cyber-physical-social systems in smart city: a survey, Neurocomputing, 444 (2021), 203–213. https://doi.org/10.1016/j.neucom.2020.08.089 doi: 10.1016/j.neucom.2020.08.089
    [9] V. Soroush, M. Mostafa, R. Deb, Rumor gauge: predicting the veracity of rumors on Twitter, ACM Trans. Knowl. Discov. Data, 11 (2017), 1–36. https://doi.org/10.1145/3070644 doi: 10.1145/3070644
    [10] S. R. Sahoo, B. B. Gupta, Multiple features based approach for automatic fake news detection on social networks using deep learning, Appl. Soft Comput., 100 (2021), 106983. https://doi.org/10.1016/j.asoc.2020.106983 doi: 10.1016/j.asoc.2020.106983
    [11] D. Kempe, J. Kleinberg, E. Tardos, Maximizing the spread of influence through a social network, in Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Association for Computing Machinery, (2003), 137–146. https://doi.org/10.1145/956750.956769
    [12] A. G. Cecilia, B. Manuel, T. M. Valentina, An agent-based social simulation for citizenship competences and conflict resolution styles, Int. J. Semant. Web Inf. Syst., 18 (2022), 1–23. https://doi.org/10.4018/IJSWIS.306749 doi: 10.4018/IJSWIS.306749
    [13] Y. Rong, Q. Zhu, H. Cheng, A model-free approach to infer the diffusion network from event cascade, in Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, Association for Computing Machinery, (2016), 1653–1662. https://doi.org/10.1145/2983323.2983718
    [14] S. Galhotra, A. Arora, S. Virinchi, S. Roy, Asim: A scalable algorithm for influence maximization under the independent cascade model, in Proceedings of the 24th International Conference on World Wide Web, Association for Computing Machinery, (2015), 35–36. https://doi.org/10.1145/2740908.2742725
    [15] A. Cetto, M. Klier, A. Richter, J. F. Zolitschka, "Thanks for sharing"—Identifying users' roles based on knowledge contribution in Enterprise Social Networks, Comput. Net., 135 (2018), 275–288. https://doi.org/10.1016/j.comnet.2018.02.012 doi: 10.1016/j.comnet.2018.02.012
    [16] L. Sopjani, J. J. Stier, S. Ritzén, M. Hesselgren, P. Georén, Involving users and user roles in the transition to sustainable mobility systems: The case of light electric vehicle sharing in Sweden, Transp. Res. Part D: Transp. Environ., 71 (2019), 207–221. https://doi.org/10.1016/j.trd.2018.12.011 doi: 10.1016/j.trd.2018.12.011
    [17] L. B. Jeppesen, K. Laursen, The role of lead users in knowledge sharing, Res. Policy, 38 (2009), 1582–1589. https://doi.org/10.1016/j.respol.2009.09.002 doi: 10.1016/j.respol.2009.09.002
    [18] I. Singh, N. Kumar, S. K. G., T. Sharma, V. Kumar, S. Singhal, Database intrusion detection using role and user behavior based risk assessment, J. Inf. Secur. Appl., 55 (2020), 102654. https://doi.org/10.1016/j.jisa.2020.102654 doi: 10.1016/j.jisa.2020.102654
    [19] D. Kempe, J. M. Kleinberg, E. Tardos, Maximizing the spread of influence through a social network, in Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, Association for Computing Machinery, (2003), 137–146. https://doi.org/10.1145/956750.956769
    [20] P. Shakarian, A. Bhatnagar, A. Aleali, E. Shaabani, R. Guo, The independent cascade and linear threshold models, in Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, Association for Computing Machinery, (2015), 177–184. https://doi.org/10.1007/978-3-319-23105-1_4
    [21] M. Richardson, P. Domingos, Mining knowledge-sharing sites for viral marketing, in Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, Association for Computing Machinery, (2002), 61–70. https://doi.org/10.1145/775047.775057
    [22] D. Oriedi, C. de Runz, Z. Guessoum, A. A. Nyongesa, Influence maximization through user interaction modeling, in Proceedings of the 35th Annual ACM Symposium on Applied Computing, Association for Computing Machinery, (2020), 1888–1890. https://doi.org/10.1145/3386901.3388999
    [23] L. Sun, A. Chen, P. S. Yu, W. Chen, Influence maximization with spontaneous user adoption, in Proceedings of the 13th International Conference on Web Search and Data Mining, Association for Computing Machinery, (2020), 573–581. https://doi.org/10.1145/3336191.3371785
    [24] J. Guo, W. Wu, Adaptive influence maximization: if influential node unwilling to be the seed, ACM Trans. Knowl. Discov. Data, 15 (2021), 1–23. https://doi.org/10.1145/3447396 doi: 10.1145/3447396
    [25] J. Luo, X. Liu, X. Kong, Competitive opinion maximization in social networks, in Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, Association for Computing Machinery, (2019), 250–257. https://doi.org/10.1145/3341161.3342899
    [26] Y. Zhang, Y. Zhang, Top-K influential nodes in social networks: A game perspective, in Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, Association for Computing Machinery, (2017), 1029–1032. https://doi.org/10.1145/3077136.3080709
    [27] X. Liu, X. Kong, P. S. Yu, Active ppinion maximization in social networks, Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, Association for Computing Machinery, (2018), 1840–1849. https://doi.org/10.1145/3219819.3220061
    [28] P. Banerjee, W. Chen, L. V.S. Lakshmanan, Maximizing welfare in social networks under a utility driven influence diffusion model, in Proceedings of the 2019 International Conference on Management of Data, Association for Computing Machinery, (2019), 1078–1095. https://doi.org/10.1145/3299869.3319879
    [29] M. M. Keikha, M. Rahgozar, M. Asadpour, M. F. Abdollahi, Influence maximization across heterogeneous interconnected networks based on deep learning, Expert Syst. Appl., 140 (2020). https://doi.org/10.1016/j.eswa.2019.112905 doi: 10.1016/j.eswa.2019.112905
    [30] Q. Zhan, W. Zhuo, Y. Liu, Social influence maximization for public health campaigns, IEEE Access, 7 (2019), 151252–151260. https://doi.org/10.1109/ACCESS.2019.2946391 doi: 10.1109/ACCESS.2019.2946391
    [31] S. Tian, S. Mo, L. Wang, Z. Peng, Deep reinforcement learning-based approach to tackle topic-aware influence maximization, Data Sci. Engineer., 5 (2020), 1–11. https://doi.org/10.1007/s41019-020-00117-1 doi: 10.1007/s41019-020-00117-1
    [32] D. Li, J. Liu, J. Jeon, S. Hong, T. Le, D. Lee, et al., Large-scale data-rriven airline market influence maximization, in Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, Association for Computing Machinery, (2021), 914–924. https://doi.org/10.1145/3447548.3467365
    [33] C. Zhang, W. Li, D. Wei, Y. Liu, Z. Li, Network dynamic GCN influence maximization algorithm with leader fake labeling mechanism, IEEE Trans. Comput. Soc. Syst., (2022), 1–9. https://doi.org/10.1109/TCSS.2022.3193583 doi: 10.1109/TCSS.2022.3193583
    [34] W. Li, Z. Li, A. M. Luvembe, C. Yang, Influence maximization algorithm based on Gaussian propagation model, Inf. Sci., 568 (2021), 386–402. https://doi.org/10.1016/j.ins.2021.04.061 doi: 10.1016/j.ins.2021.04.061
    [35] W. Li, Y. Li, W. Liu, C. Wang, An influence maximization method based on crowd emotion under an emotion-based attribute social network, Inf. Process. Manage., 59 (2022), 102818. https://doi.org/10.1016/j.ipm.2021.102818 doi: 10.1016/j.ipm.2021.102818
    [36] W. Li, Y. Hu, C. Jiang, S. Wu, Q. Bai, E. M. K. Lai, ABEM: an adaptive agent-based evolutionary approach for influence maximization in dynamic social networks, Appl. Soft Comput., 136 (2023), 110062. https://doi.org/10.1016/j.asoc.2023.110062 doi: 10.1016/j.asoc.2023.110062
    [37] H. Cai, V. W. Zheng, K. C. Chang, A comprehensive survey of graph embedding: Problems, techniques, and applications, IEEE Trans. Knowl. Data Engineer., 30 (2018), 1616–1637. https://doi.org/10.1109/TKDE.2018.2807452 doi: 10.1109/TKDE.2018.2807452
    [38] B. Perozzi, R. Al-Rfou, S. Skiena, Deepwalk: online learning of social representations, in Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, Association for Computing Machinery, (2014), 701–710. https://doi.org/10.1145/2623330.2623732
    [39] J. Tang, M. Qu, M. Wang, M. Zhang, J. Yan, Q. Mei, Line: large-scale information network embedding, in Proceedings of the 24th international conference on World Wide Web, Association for Computing Machinery, (2015), 1067–1077. https://doi.org/10.1145/2736277.2741093
    [40] A. Grover, J. Leskovec, node2vec: scalable feature learning for networks, in Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining, Association for Computing Machinery, (2016), 855–864. https://doi.org/10.1145/2939672.2939754
    [41] C. McCormick, Word2vec tutorial-the skip-gram model, 2016. Available from: http://mccormickml.com/2016/04/19/word2vec-tutorial-the-skip-gram-model.
    [42] M. M. Keikha, M. Rahgozar, M. Asadpour, Community aware random walk for network embedding, Knowledge-Based Syst., 148 (2018), 47–54. https://doi.org/10.1016/j.knosys.2018.02.028 doi: 10.1016/j.knosys.2018.02.028
    [43] T. Lou, J. Tang, Mining structural hole spanners through information diffusion in social networks, in Proceedings of the 22nd international conference on World Wide Web, Association for Computing Machinery, (2013), 825–836. https://doi.org/10.1145/2488388.2488461
    [44] R. S. Burt, Structural holes and good ideas, Am. J. Soc., 110 (2004), 349–399. https://doi.org/10.1086/421787 doi: 10.1086/421787
    [45] S. Wu, J. M. Hofman, W. A. Mason, D. J. Watts, Who says what to whom on Twitter, in Proceedings of the 20th International Conference on World Wide Web, WWW 2011, Association for Computing Machinery, (2011). https://doi.org/10.1145/1963405.1963504
    [46] T. Mikolov, K. Chen, G. Corrado, J. Dean, Efficient estimation of word representations in vector space, 2013. Available from: http://arXiv.org/abs/1301.3781.
    [47] 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, Behav. Ecol. Soc., 54 (2003), 396–405. https://doi.org/10.1007/s00265-003-0651-y doi: 10.1007/s00265-003-0651-y
    [48] A. L. Traud, P. J. Mucha, M. A. Porter, Social structure of Facebook networks, Phys. A, 391 (2012), 4165–4180. https://arXiv.org/1102.2166
    [49] M. J. Newman, Finding community structure in networks using the eigenvectors of matrices, Phys. Rev. E, 74 (2006), 036104. https://arXiv.org/abs/physics/0605087v3
    [50] J. Leskovec, J. Kleinberg, C. Faloutsos, Graph evolution: Densification and shrinking diameters, ACM Trans. Knowl. Discovery Data, 1 (2007). https://doi.org/10.1145/1217299.1217301 doi: 10.1145/1217299.1217301
    [51] B. Rozemberczki, R. Davies, R. Sarkar, C. Sutton, Gemsec: graph embedding with self clustering, in Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2019, Association for Computing Machinery, (2019), 65–72. https://doi.org/10.1145/3341161.3342890
    [52] J. Zhang, Y. Luo, Degree centrality, betweenness centrality, and closeness centrality in social network, in Proceedings of the 2017 2nd International Conference on Modelling, Simulation and Applied Mathematics (MSAM2017), 132 (2017), 300–303. https://doi.org/10.2991/msam-17.2017.68
    [53] M. E. J. Newman, A measure of betweenness centrality based on random walks, Soc. Net., 27 (2005), 39–54. https://doi.org/10.1016/j.socnet.2004.11.009 doi: 10.1016/j.socnet.2004.11.009
    [54] D. F. Gleich, PageRank beyond the Web, SIAM Rev., 57 (2015), 321–363. https://doi.org/10.1137/140976649 doi: 10.1137/140976649
  • This article has been cited by:

    1. Mourad Chamekh, Mohamed Ali Latrach, Fadel Jday, Multi-step semi-analytical solutions for a chikungunya virus system, 2023, 2731-6734, 10.1007/s43994-023-00027-8
    2. Muhammad Farman, Aamir Shehzad, Ali Akgül, Dumitru Baleanu, Manuel De la Sen, Modelling and Analysis of a Measles Epidemic Model with the Constant Proportional Caputo Operator, 2023, 15, 2073-8994, 468, 10.3390/sym15020468
    3. Olumuyiwa James Peter, Sania Qureshi, Mayowa M. Ojo, Ratchada Viriyapong, Amanullah Soomro, Mathematical dynamics of measles transmission with real data from Pakistan, 2022, 2363-6203, 10.1007/s40808-022-01564-7
    4. Salah Alsahafi, Stephen Woodcock, Exploring HIV Dynamics and an Optimal Control Strategy, 2022, 10, 2227-7390, 749, 10.3390/math10050749
    5. Zakaria Yaagoub, Karam Allali, Global Stability of Multi-Strain SEIR Epidemic Model with Vaccination Strategy, 2023, 28, 2297-8747, 9, 10.3390/mca28010009
    6. Ahmed Alshehri, Miled El Hajji, Mathematical study for Zika virus transmission with general incidence rate, 2022, 7, 2473-6988, 7117, 10.3934/math.2022397
    7. Nikhila Yaladanda, Rajasekhar Mopuri, Hari Prasad Vavilala, Srinivasa Rao Mutheneni, Modelling the impact of perfect and imperfect vaccination strategy against SARS CoV-2 by assuming varied vaccine efficacy over India, 2022, 15, 22133984, 101052, 10.1016/j.cegh.2022.101052
    8. Mohammed H. Alharbi, Global investigation for an "SIS" model for COVID-19 epidemic with asymptomatic infection, 2023, 20, 1551-0018, 5298, 10.3934/mbe.2023245
    9. Amer Hassan Albargi, Miled El Hajji, Mathematical analysis of a two-tiered microbial food-web model for the anaerobic digestion process, 2023, 20, 1551-0018, 6591, 10.3934/mbe.2023283
    10. Yantao Luo, Yunqiang Yuan, Zhidong Teng, ANALYSIS OF A DEGENERATED DIFFUSION SVEQIRV EPIDEMIC MODEL WITH GENERAL INCIDENCE IN A SPACE HETEROGENEOUS ENVIRONMENT, 2024, 14, 2156-907X, 2704, 10.11948/20230346
    11. Rukhsar Ikram, Amir Khan, Mostafa Zahri, Aeshah A. Raezah, The impact of Lévy noise on a stochastic measles model, 2023, 138, 2190-5444, 10.1140/epjp/s13360-023-04625-7
    12. Maoxing Liu, Yuhang Li, Dynamics analysis of an SVEIR epidemic model in a patchy environment, 2023, 20, 1551-0018, 16962, 10.3934/mbe.2023756
    13. Dilber Uzun Ozsahin, Najeeb Alam Khan, Araib Aqeel, Hijaz Ahmad, Maged F. Alotaibi, Muhammad Ayaz, Junyuan Yang, Mathematical modeling and dynamics of immunological exhaustion caused by measles transmissibility interaction with HIV host, 2024, 19, 1932-6203, e0297476, 10.1371/journal.pone.0297476
    14. Liang’an 良安 Huo 霍, Yue 跃 Yu 于, Impact of individual behavior adoption heterogeneity on epidemic transmission in multiplex networks, 2023, 32, 1674-1056, 108703, 10.1088/1674-1056/acea65
    15. Jiandong Nie, Qiaoling Chen, Zhidong Teng, Yihan Zhang, Ramziya Rifhat, Dynamics of a Stochastic Measles Model with General Incidence Rate and Black–Karasinski Process, 2024, 47, 0126-6705, 10.1007/s40840-024-01771-8
    16. Miled El Hajji, Periodic solutions for chikungunya virus dynamics in a seasonal environment with a general incidence rate, 2023, 8, 2473-6988, 24888, 10.3934/math.20231269
    17. Miled El Hajji, Dalal M. Alshaikh, Nada A. Almuallem, Periodic Behaviour of an Epidemic in a Seasonal Environment with Vaccination, 2023, 11, 2227-7390, 2350, 10.3390/math11102350
    18. Young Rock Kim, Youngho Min, Joy Nana Okogun-Odompley, Rehana Naz, A mathematical model of COVID-19 with multiple variants of the virus under optimal control in Ghana, 2024, 19, 1932-6203, e0303791, 10.1371/journal.pone.0303791
    19. Marlon Nunes Gonzaga, Marcelo Martins de Oliveira, Allbens Picardi Faria Atman, Role of Vaccination Strategies to Host-Pathogen Dynamics in Social Interactions, 2024, 26, 1099-4300, 739, 10.3390/e26090739
    20. Amar Nath Chatterjee, Santosh Kumar Sharma, Fahad Al Basir, A Compartmental Approach to Modeling the Measles Disease: A Fractional Order Optimal Control Model, 2024, 8, 2504-3110, 446, 10.3390/fractalfract8080446
    21. Amer Hassan Albargi, Miled El Hajji, Bacterial Competition in the Presence of a Virus in a Chemostat, 2023, 11, 2227-7390, 3530, 10.3390/math11163530
    22. W. Ahmad, A. I. K. Butt, M. Rafiq, Z. Asif, T. Ismaeel, N. Ahmad, Modeling, analyzing and simulating the Measles transmission dynamics through efficient computational optimal control technique, 2024, 139, 2190-5444, 10.1140/epjp/s13360-024-05368-9
    23. Zakaria Yaagoub, Fractional two-strain SVLIR epidemic model with vaccination and quarantine strategies, 2025, 13, 2195-268X, 10.1007/s40435-024-01561-x
    24. Tianqi Song, Yishi Wang, Chuncheng Wang, Qi An, Modeling and analyzing COVID-19 infections in South Africa, 2025, 18, 1793-5245, 10.1142/S1793524523501036
    25. Nassira Madani, Zakia Hammouch, EL-Houssine Azroul, New model of HIV/AIDS dynamics based on Caputo–Fabrizio derivative order: Optimal strategies to control the spread, 2025, 18777503, 102612, 10.1016/j.jocs.2025.102612
  • Reader Comments
  • © 2023 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(2527) PDF downloads(224) Cited by(3)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog