Improving the effectiveness of target link importance assessment strategy has become an important research direction within the field of complex networks today. The reasearch shows that the link importance assessment strategy based on betweenness centrality is the current optimal solution, but its high computational complexity makes it difficult to meet the application requirements of large-scale networks. The k-core decomposition method, as a theoretical tool that can effectively analyze and characterize the topological properties of complex networks and systems, has been introduced to facilitate the generation of link importance assessment strategy and, based on this, a link importance assessment indicator link shell has been developed. The strategy achieves better results in numerical simulations. In this study, we incorporated topological overlap theory to further optimize the attack effect and propose a new link importance assessment indicator link topological shell called t-shell. Simulations using real world networks and scale-free networks show that t-shell based target link importance assessment strategies perform better than shell based strategies without increasing the computational complexity; this can provide new ideas for the study of large-scale network destruction strategies.
Citation: Yongheng Zhang, Yuliang Lu, GuoZheng Yang. Link importance assessment strategy based on improved k-core decomposition in complex networks[J]. Mathematical Biosciences and Engineering, 2022, 19(7): 7019-7031. doi: 10.3934/mbe.2022331
[1] | Yan Xie, Zhijun Liu, Ke Qi, Dongchen Shangguan, Qinglong Wang . A stochastic mussel-algae model under regime switching. Mathematical Biosciences and Engineering, 2022, 19(5): 4794-4811. doi: 10.3934/mbe.2022224 |
[2] | Yansong Pei, Bing Liu, Haokun Qi . Extinction and stationary distribution of stochastic predator-prey model with group defense behavior. Mathematical Biosciences and Engineering, 2022, 19(12): 13062-13078. doi: 10.3934/mbe.2022610 |
[3] | Lin Li, Wencai Zhao . Deterministic and stochastic dynamics of a modified Leslie-Gower prey-predator system with simplified Holling-type Ⅳ scheme. Mathematical Biosciences and Engineering, 2021, 18(3): 2813-2831. doi: 10.3934/mbe.2021143 |
[4] | Sanling Yuan, Xuehui Ji, Huaiping Zhu . Asymptotic behavior of a delayed stochastic logistic model with impulsive perturbations. Mathematical Biosciences and Engineering, 2017, 14(5&6): 1477-1498. doi: 10.3934/mbe.2017077 |
[5] | Chun Lu, Bing Li, Limei Zhou, Liwei Zhang . Survival analysis of an impulsive stochastic delay logistic model with Lévy jumps. Mathematical Biosciences and Engineering, 2019, 16(5): 3251-3271. doi: 10.3934/mbe.2019162 |
[6] | Zhiwei Huang, Gang Huang . Mathematical analysis on deterministic and stochastic lake ecosystem models. Mathematical Biosciences and Engineering, 2019, 16(5): 4723-4740. doi: 10.3934/mbe.2019237 |
[7] | Yan Zhang, Shujing Gao, Shihua Chen . Modelling and analysis of a stochastic nonautonomous predator-prey model with impulsive effects and nonlinear functional response. Mathematical Biosciences and Engineering, 2021, 18(2): 1485-1512. doi: 10.3934/mbe.2021077 |
[8] | Xueqing He, Ming Liu, Xiaofeng Xu . Analysis of stochastic disease including predator-prey model with fear factor and Lévy jump. Mathematical Biosciences and Engineering, 2023, 20(2): 1750-1773. doi: 10.3934/mbe.2023080 |
[9] | Yan Wang, Tingting Zhao, Jun Liu . Viral dynamics of an HIV stochastic model with cell-to-cell infection, CTL immune response and distributed delays. Mathematical Biosciences and Engineering, 2019, 16(6): 7126-7154. doi: 10.3934/mbe.2019358 |
[10] | H. J. Alsakaji, F. A. Rihan, K. Udhayakumar, F. El Ktaibi . Stochastic tumor-immune interaction model with external treatments and time delays: An optimal control problem. Mathematical Biosciences and Engineering, 2023, 20(11): 19270-19299. doi: 10.3934/mbe.2023852 |
Improving the effectiveness of target link importance assessment strategy has become an important research direction within the field of complex networks today. The reasearch shows that the link importance assessment strategy based on betweenness centrality is the current optimal solution, but its high computational complexity makes it difficult to meet the application requirements of large-scale networks. The k-core decomposition method, as a theoretical tool that can effectively analyze and characterize the topological properties of complex networks and systems, has been introduced to facilitate the generation of link importance assessment strategy and, based on this, a link importance assessment indicator link shell has been developed. The strategy achieves better results in numerical simulations. In this study, we incorporated topological overlap theory to further optimize the attack effect and propose a new link importance assessment indicator link topological shell called t-shell. Simulations using real world networks and scale-free networks show that t-shell based target link importance assessment strategies perform better than shell based strategies without increasing the computational complexity; this can provide new ideas for the study of large-scale network destruction strategies.
Cell-based in vitro assays [27] are efficient methods to study the effect of industrial chemicals on environment or human health. Our work is based on the cytotoxicity profiling project carried by Alberta Centre for Toxicology in which initially 63 chemicals were investigated using the xCELLigence Real-Time Cell Analysis High Troughput (RTCA HT) Assay [26]. We consider a mathematical model represented by stochastic differential equations to study cytotoxicity, i.e. the effect of toxicants on human cells, such as the killing of cells or cellular pathological changes.
The cells were seeded into wells of micro-electronic plates (E-Plates), and the test substances with 11 concentrations (1:3 serial dilution from the stock solution) were dissolved in the cell culture medium [20]. The microelectrode electronic impedance value was converted by a software to Cell Index (
The success of clustering and classification methods depends on providing TCRCs that illustrates the cell population evolution from persistence to extinction. In [1] we consider a model represented by a system of ordinary differential equations to determine an appropriate range for the initial concentration of the toxicant. The model's parameters were estimated based on the data included in the TCRCs [1].
Let
dn(t)dt=βn(t)−γn2(t)−αCo(t)n(t), | (1) |
dCo(t)dt=λ21Ce(t)−η21Co(t), | (2) |
dCe(t)dt=λ22Co(t)n(t)−η22Ce(t)n(t) | (3) |
Here
The deterministic model (1)-(3) is a special case of the class of models proposed in [5], and it is related to the models considered in [7, 11, 15]. However, since we consider an acute dose of toxicant instead of a chronic one, the analysis of the survival/death of the cell population is different from the one done in the previously mentioned papers.
We have noticed that, for the toxicants considered here, the estimated values of the parameters
1. If
limt→∞n(t)=K, limt→∞Co(t)=limt→∞Ce(t)=0. |
2. If
limt→∞n(t)=0, limt→∞Co(t)=C∗eλ21η21, limt→∞Ce(t)=C∗e>βη21αλ21, |
In practice we usually estimate a parameter by an average value plus an error term. To keep the stochastic model as simple as possible, we ignore the relationship between the parameters
˜β=β+error1 ,˜γ=γ+error2 | (4) |
By the central limit theorem, the error terms may be approximated by a normal distribution with zero mean. Thus we replace equation (1) by a stochastic differential equation and, together with equations (2) and (3), we get the stochastic model
dn(t)=n(t)(β−γn(t)−αCo(t))dt+σ1n(t)dB1(t)−σ2n2(t)dB2(t), | (5) |
dCo(t)=(λ21Ce(t)−η21Co(t))dt, | (6) |
dCe(t)=(λ22Co(t)n(t)−η22Ce(t)n(t))dt, | (7) |
Here
Several versions of a stochastic logistic equation similar with (5) were considered in [18], [19], [8], [9], [10] and [21]. The system of stochastic differential equations (5)-(7) is closely related with the stochastic models in a polluted environment considered in [15], [16], and [24]. However, for the models considered in these papers, instead of the equations (6) and (7),
In this paper we extend the methods applied in [15] and [16] to find conditions for extinction, weakly persistence, and weakly stochastically permanence for the model (5)-(7). In addition to this we focus on the ergodic properties when the cell population is strongly persistent. The main contribution of this paper is the proof that
In the next section we prove that there is a unique non-negative solution of system (5)-(7) for any non-negative initial value. In section 3 we investigate the asymptotic behavior, and in section 4 we study the weak convergence of
We have to show that system (5)-(7) has a unique global positive solution in order for the stochastic model to be appropriate. Let
Since equations (6) and (7) are linear in
Co(t)=Co(0)e−η21t+λ21e−η21t∫t0Ce(s)eη21sds | (8) |
Ce(t)=Ce(0)exp(−η22∫t0n(s)ds)+λ22exp(−η22∫t0n(s)ds)∫t0Co(s)n(s)exp(η22∫s0n(l)dl)ds, t≥0. | (9) |
Let's define the differential operator
L=∂∂t+(βn−γn2−αCon)∂∂n+(λ21Ce−η21Co)∂∂Co+(λ22Con−η22Cen)∂∂Ce+12((σ21n2+σ22n4)∂2∂2n) |
For any function
dV(x(t),t)=LV(x(t),t)dt+∂V(x(t),t)∂n(σ1n(t)dB1(t)−σ2n2(t)dB2(t)), | (10) |
where
Theorem 2.1. Let
Proof. The proof is similar with the proof of theorem 3.1 in [29]. Since the coefficients are locally Lipschitz continuous functions, there exists a unique solution on
τm=inf{t∈[0,τe):min{n(t),Ce(t)}≤m−1 or max{n(t),Co(t),Ce(t)}≥m}, | (11) |
where
We show that
We define the
V(x)=Co+α4λ22(Ce−logCe−1)+αCe4λ22+(√n−log√n−1)+n. |
We get
LV(x)=(λ21Ce−η21Co)+α4λ22(1−1Ce)(λ22Con−η22Cen)+α4λ22(λ22Con−η22Cen)+(βn−γn2−αCon)(12√n−12n)+12(σ21n2+σ22n4)(−14n√n+12n2)+(βn−γn2−αCon) |
Omitting some of the negative terms, for any
LV(x)≤λ21Ce+αCon4+αCon4+αCo2−αCon+f(n),≤λ21Ce+αCo2+f(n), |
where
f(n)=−σ22n2√n8+α4λ21η22n+β√n2+γn2+σ214+σ22n24+βn |
Since
Let's define
L˜V(x,t)=−Ce−Ct(1+V(x))+e−CtLV(x)≤0. |
Using Itô's formula (10) for
E[˜V(x(t∧τm),t∧τm)]=˜V(x(0),0)+E[∫t∧τm0L˜V(x(u∧τm),u∧τm)du]≤˜V(x(0),0). |
Notice that for any
E[V(x(τm,ω))IΘm(ω)]≥P(Θm)bm≥ϵbm→∞ |
as
Here we focus on the case when
Lemma 2.2. If
Theorem 2.3. If
limt→∞Co(t)=λ21η21limt→∞Ce(t). |
In this section we assume that
Definition 3.1. The population
Definition 3.2. The population
Definition 3.3. The population
Definition 3.4. The population
Theorem 3.5. a. If
b. If
Proof. The proof is similar with the proof of Theorem 6 in [16]. We start with some preliminary results. By Itô's formula in (5) we have
dlnn(t)=(β−γn(t)−αCo(t)−σ21+σ22n2(t)2)dt+σ1dB1(t)−σ2n(t)dB2(t). |
This means that we have
lnn(t)−lnn(0)=(β−σ212)t−γ∫t0n(s)ds−α∫t0Co(s)ds−σ222∫t0n2(s)ds+σ1B1(t)−σ2∫t0n(s)dB2(s), | (12) |
Notice that the quadratic variation [17] of
⟨M(t),M(t)⟩=σ22∫t0n2(s)ds. |
Now we do the proof for part a. Using the exponential martingale inequality (Theorem 7.4 [17]) and Borel-Cantelli lemma ([22], pp. 102), and proceeding as in the proof of Theorem 6 in [16] we can show that for almost all
sup0≤t≤n(M(t)−12⟨M(t),M(t)⟩)≤2lnn. |
Hence, for all
−σ222∫t0n2(s)ds−σ2∫t0n(s)dB2(s)≤2lnn a.s.. |
Substituting the above inequality in (12) we get
lnn(t)−lnn(0)t≤β−σ212−α∫t0Co(s)dst+σ1B1(t)t+2lnnn−1 a.s., |
for all
lim supt→∞lnn(t)t≤β−σ212−αlim inft→∞∫t0Co(s)dst<0 a.s.. |
Next we prove part b. Suppose that
lim supt→∞lnn(t,ω)t≤0 | (13) |
Moreover, from the law of large numbers for local martingales (Theorem 3.4 in [17]) there exists a set
limt→∞M(t,ω)t=limt→∞B1(t,ω)t=0. |
From (12) we get:
ln(n(t))t=ln(n(0))t+(β−σ212)−α∫t0Co(s)dst−∫t0(γn(s)+σ222n2(s))dst+σ1B1(t)t+M(t,ω)t |
Hence, for any
lim supt→∞lnn(t,ω)t=(β−σ212)−αlim inft→∞∫t0Co(s,ω)dst |
Since we know that
We have the following result regarding the expectation of
Lemma 3.6. There exists a constant
Proof. Using Itô's formula in (5) we get:
d(etn(t))=n(t)et(1+β−αCo(t)−γn(t))dt+σ1n(t)etdB1(t)−σ2n2(t)etdB2(t)≤n(t)et(1+β−γn(t))dt+σ1n(t)etdB1(t)−σ2n2(t)etdB2(t)≤et(1+β)24γdt+σ1n(t)etdB1(t)−σ2n2(t)etdB2(t) | (14) |
Let
ηm=inf{t≥0:n(t)∉(1/m,m)}, | (15) |
for any
E[et∧τmn(t∧τm)]≤n(0)+E[∫t∧τm0es(1+β)24γds]≤n(0)+(1+β)24γ(et−1). |
Letting
E[n(t)]≤n(0)et+(1+β)24γ(1−e−t). |
Thus, there exists a constant
Corollary 1. For any
Proof. For any
P(n(t)>c1(ϵ))≤E[n(t)]c1(ϵ). |
Hence, from Lemma 3.6 we get
lim supt→∞P(n(t)>c1(ϵ))≤lim supt→∞E[n(t)]c1(ϵ)≤ϵ. |
Theorem 3.7. If
Proof. First we show that
By Itô's formula in (5) we get for any real constant c:
d(ectn(t))=ect(1n(t)(c−β+σ21+αCo(t))+γ+σ22n(t))dt−σ1ectn(t)dB1(t)+σ2ectdB2(t) |
Since
d(ectn(t))≤ect(γ+σ22n(t))dt−σ1ectn(t)dB1(t)+σ2ectdB2(t) | (16) |
Taking expectation in (16) and using Lemma 3.6 we get:
E[ec(t∧ηm)n(t∧ηm)]≤1n(0)+E[∫t∧ηm0ecs(γ+σ22n(s))ds]≤1n(0)+(γ+σ22K1)(ect−1)c, |
where
E[1n(t)]≤1n(0)ect+(γ+σ22K1)c(1−e−ct), |
so
Next we show that for any
For any
P(n(t)<c2(ϵ))=P(1n(t)>1c2(ϵ))≤c2(ϵ)E[1n(t)] |
Hence
lim supt→∞P(n(t)<c2(ϵ))≤ϵlim supn→∞E[1/n(t)]/M2≤ϵ. |
Thus
The deterministic system (1)-(3) has a maximum capacity equilibrium point
For stochastic differential equations, invariant and stationary distributions play the same role as fixed points for deterministic differential equations. In general, let
dX(t)=b(X(t))dt+d∑r=1σr(X(t))dBr(t), | (17) |
where
L=l∑i=1bi(x)∂∂xi+12l∑i,j=1Ai,j(x)∂2∂xi∂xj, Ai,j(x)=d∑r=1σr,i(x)σr,j(x). |
Let
Definition 4.1. A stationary distribution [6] for
∫EP(t,x,A)μ(dx)=μ(A), for any t≥0, and any A∈B(E). |
Definition 4.2. The Markov process
It is clear that the stability in distribution implies the existence of a unique stationary measure, but the converse is not always true [2]. We have the following result (see lemma 2.2 in [29] and the references therein).
Lemma 4.3. Suppose that there exists a bounded domain
limt→∞P(t,x,B)=μ(B)Px{limT→∞1T∫T0f(X(t))dt=∫Ef(x)μ(dx)}=1, |
for all
We now study the stochastic system (5)-(7) when
dX(t)=(βX(t)−γX2(t))dt+σ1X(t)dB1(t)−σ2X2(t)dB2(t), | (18) |
dXϵ(t)=(βXϵ(t)−γX2ϵ(t)−αϵXϵ(t))dt+σ1Xϵ(t)dB1(t)−σ2X2ϵ(t)dB2(t), | (19) |
Lemma 4.4. a. For any given initial value
b. For any
c. There exists a constant
Proof. The proofs for a. and b. can be done similarly with the proof of Theorem 2.1, using the
Let
Theorem 4.5. If
limt→∞PX(t,x,B)=μ1(B)Px{limT→∞1T∫T0f(X(t))dt=∫Ef(x)μ1(dx)}=1, |
for all
Proof. We consider the
LV(x)=−σ228x5/2+σ224x2−γ2x3/2+γ2x+(β2−σ218)x1/2+(σ214−β2). |
Since
Let
Let define the processes
dN(t)=(N(t)(σ21−β)+αN(t)Co(t)+γ+σ22N(t))dt−σ1N(t)dB1(t)+σ2dB2(t) a.s., | (20) |
dY(t)=(Y(t)(σ21−β)+γ+σ22Y(t))dt−σ1Y(t)dB1(t)+σ2dB2(t) a.s., | (21) |
dYϵ(t)=(Yϵ(t)(σ21−β+αϵ)+γ+σ22Yϵ(t))dt−σ1Yϵ(t)dB1(t)+σ2dB2(t) a.s.. | (22) |
From the proof of Theorem 3.7 we know that if
Lemma 4.6. If
Proof. The proof is based on the results in Lemma 4.4 and it is similar with the first part of the proof of Theorem 3.7. For completeness we have included it in Appendix C.
We use the processes
Theorem 4.7. Let
Proof. We follow the same idea as in the proof of Theorem 2.4 in [28]. From theorem 4.5 we know that
Firstly, let's notice that
Y(t)≤N(t) and Y(t)≤Yϵ(t) for any t≥0 a.s.. | (23) |
Indeed, if we denote
dξ(t)=(ξ(t)(σ21−β−σ22N(t)Y(t))+αN(t)Co(t))dt−σ1ξ(t)dB1(t) a.s.. |
The solution of the previous linear equation is given by (see chapter 3, [17])
ξ(t)=Φ(t)∫t0αN(s)Co(s)Φ(s)ds a.s., |
where
Φ(t)=exp{−t(β−σ212)−∫t0σ22N(s)Y(s)ds−σ1B1(t)}>0 |
Obviously
Secondly we show that for any
liminft→∞(Yϵ(t)−N(t))≥0 a.s.. | (24) |
From equations (20) and (22) we get
d(Yϵ(t)−N(t))=((Yϵ(t)−N(t))(σ21+αϵ−β−σ22N(t)Yϵ(t))+αN(t)(ϵ−Co(t)))dt−σ1(Yϵ(t)−N(t))dB1(t) a.s.. |
The solution of the linear equation is given by
Yϵ(t)−N(t)=Φ1(t)∫t0αN(s)(ϵ−Co(s))Φ1(s)ds a.s., |
where
0<Φ1(t)=exp{−t(β−αϵ−σ212)−∫t0σ22N(s)Yϵ(s)ds−σ1B1(t)}≤exp{−t(β−αϵ−σ212+σ1B1(t)t)} |
Since
Yϵ(t)−N(t)=Φ1(t)(∫T0αN(s)(ϵ−Co(s))Φ1(s)ds+∫tTαN(s)(ϵ−Co(s))Φ1(s)ds)≥Φ1(t)∫T0αN(s)(ϵ−Co(s))Φ1(s)ds |
Therefore for any
lim inft→∞(Yϵ(t)−N(t))≥limt→∞Φ1(t)∫T0αN(s)(ϵ−Co(s))Φ1(s)ds=0 a.s.. |
Thirdly we prove that
limϵ→0limt→∞E[Yϵ(t)−Y(t)]=0. | (25) |
We know from (23) that
d(Yϵ(t)−Y(t))=((Yϵ(t)−Y(t))(σ21+αϵ−β−σ22Y(t)Yϵ(t))+αϵY(t))dt−σ1(Yϵ(t)−Y(t))dB1(t)≤((Yϵ(t)−Y(t))(σ21+αϵ−β)+αϵY(t))dt−σ1(Yϵ(t)−Y(t))dB1(t) a.s.. |
From Lemma 4.6 we know that
E[Yϵ(t)−Y(t)]≤∫t0E[Yϵ(s)−Y(s)](σ21+αϵ−β)+αϵE[Y(s)]ds≤∫t0E[Yϵ(s)−Y(s)](σ21+αϵ−β)ds+tαϵsupt≥0E[Y(t)] a.s.. |
For any
0≤E[Yϵ(t)−Y(t)]≤αϵsupt≥0E[Y(t)]β−σ21−αϵ(1−exp(−t(β−σ21−αϵ))) |
Taking limits in the previous inequality we get equation (25).
Finally, using (23), (24), and (25) we obtain that
Corollary 2. Let
a. If
p(x)=1G1x4exp(−βσ22(1x−γβ)2),x>0 | (26) |
G1=σ22β5/2(Ψ(γ√2ββσ2)√π(σ22β+2γ2)+γσ2β1/2exp(−γ2σ22β)) | (27) |
where
b. If
Proof. We know that
a. If
dY(t)=(−Y(t)β+γ+σ22Y(t))dt+σ2dB2(t) a.s., | (28) |
Let define
q(y)=exp(−2σ22∫y1(−βu+σ22u+γ)du)=1y2exp(−βσ22(1−γβ)2)exp(βσ22(y−γβ)2) |
It can be easily shown that
∫10q(y)dy=∞, ∫∞1q(y)dy=∞, ∫∞01σ22q(y)dy=G1σ22exp(βσ22(1−γβ)2), |
where
p1(x)=1σ22q(x)∫∞01σ22q(y)dy=x2exp(−βσ22(x−γβ)2)G1 |
Thus, by Theorem 4.5,
limt→∞1t∫t0X(u)du=∫∞0xp(x)dx=σ22β3/2G1(σ2√βexp(−γ2σ22β)+2γ√πΨ(γ√2ββσ2)) a.s.. |
b. If
dY(t)=(γ−Y(t)(β−σ21))dt−σ1Y(t)dB1(t) a.s.. |
Proceeding similarly as for a. we can show that
limt→∞1t∫t0X(u)du=(2(β−σ21)σ21+1)σ212γ a.s.. |
Notice that if
On the other hand, if
First we illustrate numerically the results obtained in section 3 regarding survival analysis.We consider a cell population exposed to the toxicant monastrol as in the experiments described in [1]. The parameters' values for this toxicant are estimated in [1]:
One of the applications of the mathematical model is for finding the threshold value for
We illustrate this for the model with initial values
Notice also that the results displayed in Figs. 2 and 3 agree with the conclusion of Theorem 2.3. For the stochastic model with
lim inft→∞n(t,ω)>0,limt→∞Co(t,ω)=limt→∞Ce(t,ω)=0 |
Next we use the same parameters values as stated at the beginning of this section and the initial values
When
We present a stochastic model to study the effect of toxicants on human cells. To account for parameter uncertainties, the model is expressed as a system of coupled ordinary stochastic differential equations. The variables are the cell index
We first prove the positivity of the solutions. Then we investigate the influence of noise on the cell population survival. When the noise variances
Moreover, we prove that when the noise variance
Here we illustrate our results for the toxicant monastrol. We have also considered other toxicants from the experiments described in [1] classified in various clusters [30]. We have noticed that the cluster type does not change the type of stationary distribution, nor has an effect on the behavior of the distributions in response to increased noise variances.
Proof. The proof is similar with the proof of Lemma 3.1 in [1]. We define the stopping time
From (8) with
0≤Co(t,ω)=λ21e−η22t∫t0Ce(s,ω)eη21sds≤λ21e−η22tCe(0)∫t0eη21sds=λ21Ce(0)η21(1−e−η21t)≤λ21Ce(0)η21 |
Moreover, on
dCedt|t=τ=λ22Co(τ)n(τ)−η22Ce(τ)n(τ)≤Ce(0)n(τ)(λ21λ22η21−η22)<0 |
Thus we have a contradiction with the definition of
Proof. The proof is similar with the proof of Theorem 3.2 in [1]. Let
If
∫t0Co(s,ω)n(s,ω)exp(η22∫s0n(l,ω)dl)ds≤λ21Ce(0)η21exp(η22|n|1(ω))|n|1(ω). |
Thus
limt→∞Ce(t,ω)=Ce(0)exp(−η22|n|1(ω))+λ22M(ω)exp(−η22|n|1(ω))<∞. |
Consequently, there exists
∫t0Ce(s,ω)eη21sds≥∫tT1(ω)Ce(s,ω)eη21sds≥Ce(0)exp(−η22|n|1(ω))/2∫tT1(ω)eη21sds. |
So we can apply L'Hospital's rule in (8), and we get
limt→∞Co(t,ω)=λ21η21limt→∞Ce(t,ω)>0. |
Thus, on
Next, if
0≤λ22η22lim inft→∞Co(t,ω)≤lim inft→∞Ce(t,ω)≤lim supt→∞Ce(t,ω)≤λ22η22lim supt→∞Co(t,ω) |
Similarly, from (8) we either get that
0≤λ21η21lim inft→∞Ce(t,ω)≤lim inft→∞Co(t,ω)≤lim supt→∞Co(t,ω)≤λ21η21lim supt→∞Ce(t,ω), |
(if
limt→∞Co(t,ω)=limt→∞Ce(t,ω)=0, |
because
In conclusion, on
Proof. We choose any
d(ectY(t))=ect(Y(t)(c+σ21−β)+γ+σ22X(t))dt−σ1ectY(t)dB1(t)+σ2ectdB2(t)≤ect(γ+σ22X(t))dt−σ1ectY(t)dB1(t)+σ2ectdB2(t) | (29) |
Let
E[ec(t∧τm)Y(t∧τm)]≤1n(0)+E[∫t∧τm0ecs(γ+σ22X(s))ds]≤1n(0)+(γ+σ22C1)(ect−1)c. |
Letting
E[Y(t)]≤1n(0)ect+(γ+σ22C1)c(1−e−ct). |
Thus, there exists a constant
[1] | A. L. Barabasi, E. Bonabeau, Scale-free network, Sci. Am., 288 (2003), 60–69. http://www.jstor.org/stable/26060284 |
[2] |
L. A. N. Amaral, A. Scala, M. Barthelemy, H. E. Stanley, Classes of small-world networks, Proc. Natl. Acad. Sci., 97 (2000), 11149–11152. https://doi.org/10.1073/pnas.200327197 doi: 10.1073/pnas.200327197
![]() |
[3] | J. Jarillo, F. J. Cao-García, F. D. Laender, Spatial and ecological scaling of stability in spatial community networks, preprint, arXiv: 2201.09683. https://doi.org/10.48550/arXiv.2201.09683 |
[4] | P. Berenbrink, M. Hoefer, D. Kaaser, P. Lenzner, M. Rau, D. Schmand, Asynchronous opinion dynamics in social networks, preprint, arXiv: 2201.12923. https://doi.org/10.48550/arXiv.2201.12923 |
[5] |
D. Duan, C. Wu, S. Si, Predicting the survivability of invasive species with mutualistic and competing interaction networks, Phys. A: Stat. Mech. Appl., 587 (2022), 126515. https://doi.org/10.1016/j.physa.2021.126515 doi: 10.1016/j.physa.2021.126515
![]() |
[6] |
Z. Wang, D. Delahaye, J. L. Farges, S. Alam, Air traffic assignment for intensive urban air mobility operations, J. Aerosp. Inf. Syst., 18 (2021), 860–875. https://doi.org/10.2514/1.I010954 doi: 10.2514/1.I010954
![]() |
[7] |
J. H. Zhao, D. L. Zeng, J. T. Qin, H. M. Si, X. F. Liu. Simulation and modeling of microblog-based spread of public opinions on emergencies, Neural Comput. Appl., 33 (2021), 547–564. https://doi.org/10.1007/s00521-020-04919-2 doi: 10.1007/s00521-020-04919-2
![]() |
[8] | Y. Shi, X. Qiu, S. Guo, Genetic algorithm-based redundancy optimization method for smart grid communication network, China Commun., 12 (2015), 73–84. |
[9] |
S. Omranian, A. Angeleska, Z. Nikoloski, Efficient and accurate identification of protein complexes from protein-protein interaction networks based on the clustering coefficient, Comput. Struct. Biotechnol. J., 19 (2021), 5255–5263. https://doi.org/10.1016/j.csbj.2021.09.014 doi: 10.1016/j.csbj.2021.09.014
![]() |
[10] | R. Duffey, Critical infrastructure: the probability and duration of national and regional power outages, Reliab. Theory Appl., 15 (2020), 62–71. |
[11] |
S. Borsky, C. Unterberger, Bad weather and flight delays: The impact of sudden and slow onset weather events, Econ. Transp., 18 (2019), 10–26. https://doi.org/10.1016/j.ecotra.2019.02.002 doi: 10.1016/j.ecotra.2019.02.002
![]() |
[12] |
B. Corominasmurtra, B. Fuchs, S. Thurner, Detection of the elite structure in a virtual multiplex social system by means of a generalised k-core, Environ. Sci. Pollut. Res., 21 (2014), 10294–10306. https://doi.org/10.1371/journal.pone.0112606 doi: 10.1371/journal.pone.0112606
![]() |
[13] |
D. H. Silva, S. C. Ferreira, Activation thresholds in epidemic spreading with motile infectious agents on scale-free networks, Chaos: Interdiscip. J. Nonlinear Sci., 28 (2018), 123112. https://doi.org/10.1063/1.5050807 doi: 10.1063/1.5050807
![]() |
[14] | J. Alvarez-Hamelin, L. Dall'Asta, A. Barrat, A. Vespignani, K-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases, preprint, arXiv: cs/0511007v4. https://doi.org/10.48550/arXiv.cs/0511007 |
[15] |
Y. Shang, Attack robustness and stability of generalized k-cores, New J. Phys., 21 (2019), 093013. https://doi.org/10.1088/1367-2630/ab3d7c doi: 10.1088/1367-2630/ab3d7c
![]() |
[16] | S. Sun, X. Liu, L. Wang, C. Xia, New link attack strategies of complex networks based on k-core decomposition, IEEE Trans. Circuits Syst. II Express Briefs, 67 (2020), 3157–3161. |
[17] | A. Montresor, F. D. Pellegrini, D. Miorandi, Distributed k-core decomposition, IEEE Trans. Parallel Distrib. Syst., 24 (2012), 288–300. |
[18] |
J. P. Onnela, J. Saramaeki, J. Hyvoenen, G. Szabo, D. Lazer, K. Kaski, et al., Structure and tie strengths in mobile communication networks, Proc. Natl. Acad. Sci. U.S.A., 104 (2007), 7332–7336. https://doi.org/10.1073/pnas.0610245104 doi: 10.1073/pnas.0610245104
![]() |
[19] |
M. Girvan, M. E. Newman, Community structure in social and biological networks, Proc. Natl. Acad. Sci. U.S.A., 99 (2002), 7821–7826. https://doi.org/10.1073/pnas.122653799 doi: 10.1073/pnas.122653799
![]() |
[20] |
L. C. Freeman, A set of measures of centrality based on betweenness, Sociometry, 40 (1977), 35–41. https://doi.org/10.2307/3033543 doi: 10.2307/3033543
![]() |
[21] | R. Rossi, N. Ahmed, The network data repository with interactive graph analytics and visualization, in Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015. |
[22] | J. Kunegis, Konect: The koblenz network collection, in Proceedings of the 22nd international conference on world wide web, (2013), 1343–1350. |
[23] | J. Leskovec, A. Krevl, SNAP Datasets: Stanford large network dataset collection, 2014. Avaliable from: http://snap.stanford.edu/data. |
[24] |
J. Bae, S. Kim, Identifying and ranking influential spreaders in complex networks by neighborhood coreness, Phys. A Stat. Mech. Appl., 395 (2014), 549–559. https://doi.org/10.1016/j.physa.2013.10.047 doi: 10.1016/j.physa.2013.10.047
![]() |
[25] |
W. Jing, Y. Li, X. Zhang, J. Zhang, Z. Jin, A rumor spreading pairwise model on weighted networks, Phys. A Stat. Mech. Appl., 585 (2022), 126451. https://doi.org/10.1016/j.physa.2021.126451 doi: 10.1016/j.physa.2021.126451
![]() |
[26] | C. W. Wu, Synchronization in dynamical systems coupled via multiple directed networks, IEEE Trans. Circuits Syst. II Express Briefs, 68 (2021), 1660–1664. |
[27] |
H. M. Tornyeviadzi, E. Owusu-Ansah, H. Mohammed, R. Seidu, A systematic framework for dynamic nodal vulnerability assessment of water distribution networks based on multilayer networks, Reliab. Eng. Syst. Saf., 219 (2022), 108217. https://doi.org/10.1016/j.ress.2021.108217 doi: 10.1016/j.ress.2021.108217
![]() |
[28] |
C. Xia, Z. Wang, C. Zheng, Q. Guo, Y. Shi, M. Dehmer, et al., A new coupled disease-awareness spreading model with mass media on multiplex networks, Inf. Sci., 471 (2019), 185–200. https://doi.org/10.1016/j.ins.2018.08.050 doi: 10.1016/j.ins.2018.08.050
![]() |
[29] |
Y. Shang, Generalized k-core percolation in networks with community structure, SIAM J. Appl. Math., 80 (2020), 1272–1289. https://doi.org/10.1137/19M1290607 doi: 10.1137/19M1290607
![]() |
[30] | S. di Bartolomeo, M. Riedewald, W. Gatterbauer, C. Dunne, Stratisfimal layout: A modular optimization model for laying out layered node-link network visualizations, IEEE Trans. Visual Comput. Graphics, 28 (2022), 324–334. |
1. | Chaoqun Xu, Sanling Yuan, Richards Growth Model Driven by Multiplicative and Additive Colored Noises: Steady-State Analysis, 2020, 19, 0219-4775, 2050032, 10.1142/S0219477520500327 | |
2. | Tiantian Ma, Dan Richard, Yongqing Betty Yang, Adam B Kashlak, Cristina Anton, Functional non-parametric mixed effects models for cytotoxicity assessment and clustering, 2023, 13, 2045-2322, 10.1038/s41598-023-31011-1 |