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.

18.5. MEAN-FIELD APPROXIMATION ON RANDOM NETWORKS 419means that <strong>the</strong> disease will never go away from <strong>the</strong> network. This epidemic threshold is<strong>of</strong>ten written in terms <strong>of</strong> <strong>the</strong> infection probability, asp i >p r(n − 1)p e= p r〈k〉 , (18.28)as a condition for <strong>the</strong> disease <strong>to</strong> persist, where 〈k〉 is <strong>the</strong> average degree. It is an importantcharacteristic <strong>of</strong> epidemic models on r<strong>and</strong>om networks that <strong>the</strong>re is a positive lower boundfor <strong>the</strong> disease’s infection probability. In o<strong>the</strong>r words, a disease needs <strong>to</strong> be “contagiousenough” in order <strong>to</strong> survive in a r<strong>and</strong>omly connected social network.Exercise 18.5 Modify Code 16.6 <strong>to</strong> implement a synchronous, simultaneous updatingversion <strong>of</strong> <strong>the</strong> network SIS model. Then simulate its dynamics on an Erdős-Rényi r<strong>and</strong>om network for <strong>the</strong> following parameter settings:• n = 100, p e = 0.1, p i = 0.5, p r = 0.5 (p r < (n − 1)p e p i )• n = 100, p e = 0.1, p i = 0.04, p r = 0.5 (p r > (n − 1)p e p i )• n = 200, p e = 0.1, p i = 0.04, p r = 0.5 (p r < (n − 1)p e p i )• n = 200, p e = 0.05, p i = 0.04, p r = 0.5 (p r > (n − 1)p e p i )Discuss how <strong>the</strong> results compare <strong>to</strong> <strong>the</strong> predictions made by <strong>the</strong> mean-field approximation.As you can see in <strong>the</strong> exercise above, <strong>the</strong> mean-field approximation works much betteron r<strong>and</strong>om networks than on CA. This is because <strong>the</strong> <strong>to</strong>pologies <strong>of</strong> r<strong>and</strong>om networks arenot locally clustered. Edges connect nodes that are r<strong>and</strong>omly chosen from <strong>the</strong> entire network,so each edge serves as a global bridge <strong>to</strong> mix <strong>the</strong> states <strong>of</strong> <strong>the</strong> system, effectivelybringing <strong>the</strong> system closer <strong>to</strong> <strong>the</strong> “mean-field” state. This, <strong>of</strong> course, will break down if <strong>the</strong>network <strong>to</strong>pology is not r<strong>and</strong>om but locally clustered, such as that <strong>of</strong> <strong>the</strong> Watts-Strogatzsmall-world networks. You should keep this limitation in mind when you apply mean-fieldapproximation.Exercise 18.6 If you run <strong>the</strong> simulation using <strong>the</strong> original Code 16.6 with asynchronousupdating, <strong>the</strong> result may be different from <strong>the</strong> one obtained with synchronousupdating. Conduct simulations using <strong>the</strong> original code for <strong>the</strong> same parametersettings as those used in <strong>the</strong> previous exercise. Compare <strong>the</strong> results obtainedusing <strong>the</strong> two versions <strong>of</strong> <strong>the</strong> model, <strong>and</strong> discuss why <strong>the</strong>y are so different.

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

Saved successfully!

Ooh no, something went wrong!