15.08.2015 Views

Introduction to the Modeling and Analysis of Complex Systems

introduction-to-the-modeling-and-analysis-of-complex-systems-sayama-pdf

introduction-to-the-modeling-and-analysis-of-complex-systems-sayama-pdf

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

424CHAPTER 18. DYNAMICAL NETWORKS III: ANALYSIS OF NETWORK DYNAMICSWe can check <strong>the</strong> stability <strong>of</strong> this equilibrium state by differentiating Eq. (18.38) by q(k)<strong>and</strong> <strong>the</strong>n applying <strong>the</strong> results above. In so doing, we should keep in mind that q n containsq(k) within it (see Eq. (18.36)). So <strong>the</strong> result should look like this:df(q(k))dq(k)= −kq n p i + (1 − q(k))kp idq ndq(k) + 1 − p r (18.47)= −kq n p i + (1 − q(k)) k2 P (k)p i〈k〉+ 1 − p r (18.48)At <strong>the</strong> equilibrium state Eq. (18.41), this becomesdf(q(k))dq(k)∣∣q(k)=kqnp ikqnp i +pr= −kq n p i +p r k 2 P (k)p i+ 1 − p r = r(k). (18.49)kq n p i + p r 〈k〉Then, by applying P (k) <strong>and</strong> q n with a constraint k → 〈k〉 for large r<strong>and</strong>om networks, weobtain(r(〈k〉) = −〈k〉 1 − p )rp i +〈k〉p ip r〈k〉( )2 p i〈k〉 1 − pr〈k〉p ip i + p 〈k〉 r+ 1 − p r (18.50)= −〈k〉p i + p r + p r + 1 − p r (18.51)= −〈k〉p i + p r + 1. (18.52)In order for <strong>the</strong> non-zero equilibrium state <strong>to</strong> be stable:− 1 < −〈k〉p i + p r + 1 < 1 (18.53)p r〈k〉 < p i < p r + 2〈k〉(18.54)Note that <strong>the</strong> lower bound indicated above is <strong>the</strong> same as <strong>the</strong> epidemic threshold weobtained on r<strong>and</strong>om networks before (Eq. (18.28)). So, it seems our analysis is consistentso far. And for your information, <strong>the</strong> upper bound indicated above is ano<strong>the</strong>r criticalthreshold at which this non-zero equilibrium state loses stability <strong>and</strong> <strong>the</strong> system begins <strong>to</strong>oscillate.What happens if <strong>the</strong> network is scale-free? Here, let’s assume that <strong>the</strong> network isa Barabási-Albert scale-free network, whose degree distribution is known <strong>to</strong> be P (k) =2m 2 k −3 where m is <strong>the</strong> number <strong>of</strong> edges by which each newcomer node is attached <strong>to</strong>

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!