<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">AM</journal-id><journal-title-group><journal-title>Applied Mathematics</journal-title></journal-title-group><issn pub-type="epub">2152-7385</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/am.2012.39158</article-id><article-id pub-id-type="publisher-id">AM-23016</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Physics&amp;Mathematics</subject></subj-group></article-categories><title-group><article-title>
 
 
  Simulating the Spreading of Two Competing Public Opinion Information on Complex Network
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>engshu</surname><given-names>Xie</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Zhen</surname><given-names>Jia</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Yanfei</surname><given-names>Chen</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Qixiang</surname><given-names>Deng</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>College of Science, Guilin University of Technology, Guilin, China</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>jjjzzz0@163.com(ZJ)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>27</day><month>09</month><year>2012</year></pub-date><volume>03</volume><issue>09</issue><fpage>1074</fpage><lpage>1078</lpage><history><date date-type="received"><day>August</day>	<month>6,</month>	<year>2012</year></date><date date-type="rev-recd"><day>September</day>	<month>6,</month>	<year>2012</year>	</date><date date-type="accepted"><day>September</day>	<month>13,</month>	<year>2012</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  In this paper, we investigate the regularity of spreading of information and public opinions towards two competing products in complex networks. By building its mathematical model and simulating its evolution process, we have found the statistical regularity for support rates of two different products at a steady stage. The research shows that strength of the public opinion spreading is proportional to the final support rates of a product.
 
</p></abstract><kwd-group><kwd>Complex Network; Public Opinion Information; Competing; Spreading</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>We live in a world in which all kinds of network are interwoven with each other, such as technology networks (WWW [<xref ref-type="bibr" rid="scirp.23016-ref1">1</xref>], transportation network [<xref ref-type="bibr" rid="scirp.23016-ref2">2</xref>], electricity networks [<xref ref-type="bibr" rid="scirp.23016-ref3">3</xref>]), social networks (like human relations networks [<xref ref-type="bibr" rid="scirp.23016-ref4">4</xref>], SCN [<xref ref-type="bibr" rid="scirp.23016-ref5">5</xref>]), biological networks (like cellular neural networks [<xref ref-type="bibr" rid="scirp.23016-ref6">6</xref>], food supply chain networks [<xref ref-type="bibr" rid="scirp.23016-ref7">7</xref>]) and so on. Complex networks exist in all aspects of human life. If we take every single person as a node and relations with each other as the edges between the nodes, we will find that human society is composed of a huge and complex network of social relations. Human behavior in complex networks is related to many subjects, like politics, economy, society, humanity, and psychology. So the research of its regularity has become very important in many fields of science, as the result can be put into practice in reality and will take an important role in guiding economic, policy making and social activities.</p><p>Studying all kinds of spreading behavior in complex networks has generated a new branch of science, which is called spreading dynamics on networks. So far the wellresearched models in this field are epidemic spreading models [8-11]. There are several typical epidemic spreading models, for example, SIS, SIR, SIRS etc. S here represents “susceptible”. The S individuals are healthy and they are not able to infect others but may be infected. I represents “infective”. These I individuals have infectivity and can infect others. R represents “removed”. These individuals are immune and not able to infect others, and will not take part in the epidemic process. The above three typical epidemic spreading models are all based on single virus spreading and belong to single information spreading models. For the past few years, the spreading of other things (such as public opinions, rumors) on complex networks has been more and more researched [12,13]. Generally, these researches are all based on the relevant epidemic spreading models. However, the situation in our real life is that there are often various information mixed together. For instance, diverse virus, multiple opinions or rumors can be spread at the same time. Different from single virus spreading, they are influenced, strengthened or restrained by each other. The evolutionary process of multiple information spreading is more complicated than single information’s. Therefore, its research can not simply be attributed to single information spreading models like SIS, SIR, SIRS and more. For the time being, the study of multiple information spreading just begins, and only few research essays mentioned about it [14,15]. In this paper we mainly study the situation in which the opinion and information towards two competing parties exist at the same time in a complex network, and also investigate interrelated and interacted nature of the above opinion spreading during their evolutionary process. By building a mathematical model based on a scale-free network, we use computer to simulate this evolutionary process and investigate the statistical regularity of spreading process at the assumption that the spreading of competing information of two products flows freely. The fact is that the result we obtain at the end is mostly consistent with that in practice. That means it can be used later in our economical life and offer the theoretical support for fair commercial competition and can also be a guidance for product planning and marketing.</p></sec><sec id="s2"><title>2. Model of Spreading of Public Opinions towards Two Competing Products on BA Network</title><sec id="s2_1"><title>2.1. Background for the Model Building</title><p>Product marketing and competition between different companies are common in the commercial world. At the information age today, competition of market shares for one company largely depends on that of its product information spreading. And that is why we can see various kinds of advertisement everywhere in the world. Generally speaking, product information spreading is roughly divided into commercial advertising and public opinion spreading. The public opinion for one product are the experience and comments told by the consumers who used the product and are spread from one person to another. As the spreading behaviors are not controlled by anyone and non-commercial, these comments look much closer to the truth and more convincible for consumers, compared with the other ways of promotion. That is the reason why it will take an important role in product competition campaign today.</p><p>Public opinion spreading works in social networks. Recently, the researches concerning complex networks and its development provide us with new methods and ideas to understand and study social networks and also various types of spreading behaviors in these networks. The earliest study of complex networks is traced back to the research of mathematical graph theory, which is one of the bases of discrete mathematics. The fact that Euler’s celebrated 1735 solution of the K&#246;nigsberg bridge problem is often cited as the first true proof in the theory of networks. In 1960s, two Hungarian mathematicians Erd&#246;s and R&#233;nyi [<xref ref-type="bibr" rid="scirp.23016-ref16">16</xref>] built random graph theory, and started the systematic research of complex networks. They used relatively simple random graphs to explain the topology of networks, and created ER random graph model. However, as the study of networks goes deeper, people find that random networks are very different from real networks in many properties. Ordinarily, lots of networks in reality are not either completely regular or completely random, but lie somewhere between these two extremes. In 1998, Watts and Strogatz connected the above phenomenon with social networks, and then published a piece of paper entitled “Collective dynamics of ‘small-world’ networks” in Nature. In this paper, they revealed the small-world characteristic of complex networks and built WS small-world networks [<xref ref-type="bibr" rid="scirp.23016-ref17">17</xref>]. In 1999, Barab&#225;si and Albert published a piece of paper entitled “Emergence of Scaling in Random Networks” in Science, in which put forward BA scale-free networks model [<xref ref-type="bibr" rid="scirp.23016-ref18">18</xref>]. These two breakthroughs intensified hugely the scientists’ interest in the research of complex networks. With the further research of complex networks, scholars noticed that most of real networks have both the smallworld effect and scale-free property, and many networks can be abstracted into WS small-world networks or BA scale-free networks as the basic networks. Considering the scale-free property of social networks, we set our spreading model on BA scale-free networks. Nodes on BA networks represent consumers, and the edge between two nodes represents the interrelation and communication between two consumers.</p><p>When competing information of two products flow freely, different cognition about two products from consumers will interact with each other. Consumers’ knowledge and attitude to a product influences that on their acquaintances’ attitude to products via mouth that of their acquaintances by words of mouth, and then influence the market shares of these two products. In this paper, consumers are divided into three types in the assumption that there are two competing products A and B in market. Type A are supporters for product A; type B are supporters for product B and type C are neutrals. Neutrals have no knowledge of any products, so they have no preference first. Their attitude is likely to be influenced by other consumers’ information but doesn’t affect the others’. Type A can be classified into firm proponents and ordinary supporters. Firm proponents can be regarded as loyal customers of product A, who are good spreaders of product A and aren’t affected by other customers. Ordinary supporters of two products can affect other people and be affected by others. Denoting the subclass of firm proponents of type A as type A and that of type B as type B, we build the spreading model based on competing public opinion information of two products on a BA network, and simulate its spreading pattern through a computer simulation as follows.</p></sec><sec id="s2_2"><title>2.2. Description of the Model</title><p>We use variable <img src="17-7401032\7cd780c9-8e82-4c3e-9790-368427fdb253.jpg" /> to express attitude of node i (ith consumer) towards two products at time t,<img src="17-7401032\13e75455-c29f-4bc4-87ef-a6f4be6e2824.jpg" />. The closer the value of <img src="17-7401032\aca96b2d-8a7d-413c-8985-35841dc366b0.jpg" /> approaches 1, the stronger the consumer support product A. On the contrary, the closer the value of <img src="17-7401032\3292bd4c-09ab-464a-b990-f8b3a22cd38c.jpg" /> approaches −1, the stronger the consumer support product B. Time t takes discrete value and its step size is 1.</p><p>Firstly, we build a BA network as follows:</p><p>1) Growth: Starting with a small number (m<sub>0</sub>) of nodes, at every timestep we add a new node with <img src="17-7401032\f87b85bf-a727-4b33-ae96-e5026e734877.jpg" /> edges that link the new node to m different nodes already present in the system.</p><p>2) Preferential attachment: When choosing the nodes to which the new node connects, we assume that the probability Π that a new node will be connected to node i depends on the degree <img src="17-7401032\6eecfba9-f25c-4748-a993-104d3d00e155.jpg" /> of node i, such that</p><p><img src="17-7401032\ec3b67a6-a7c6-404f-a0e1-43c5e7cc0fda.jpg" /></p><p>Secondly, we investigate the evolution rules of public opinion on BA networks:</p><p>1) Initialization of node state: Every node is assigned to a value which comes from <img src="17-7401032\13f6b586-3463-4993-a072-bb47fd71e5b7.jpg" /> randomly, and take the value as the corresponding node’s initial state. Namely, initial state of node i is denoted by<img src="17-7401032\38bc2e98-baee-49c7-b2f4-d427bccc1d1e.jpg" />, which represents node i’s first cognition about two products.</p><p>2) Classification rules of nodes: we classify nodes according to their state and the rules are showed as follows.</p><p>Type A set<img src="17-7401032\a21af2ed-edab-4983-ad4c-efa9cd2df2ec.jpg" />; they are proponents for product A.</p><p>Type B set<img src="17-7401032\4309d322-42f6-43e2-9412-310771a22185.jpg" />; they are proponents for product B.</p><p>Type C set<img src="17-7401032\115013c2-0a43-4675-b31f-150dd9435990.jpg" />; they are neutrals and maybe effected but can’t affect other nodes.</p><p>Type A set<img src="17-7401032\5b0a21fc-f33c-44c7-bd12-d6fb76cdf3ef.jpg" />; it’s a subset of<img src="17-7401032\db714b91-a702-40b2-8202-a0822c9d21d7.jpg" />, and nodes in it are firm supporters of product A. They can affect other nodes but no one can affect them.</p><p>Type B set<img src="17-7401032\168c7241-b3e9-442f-b2eb-df3d9afb0829.jpg" />; it’s a subset of<img src="17-7401032\1cb4e7d3-4f52-43f2-b493-068e193bbd27.jpg" />, and nodes in it are firm supporters of product B. They can affect other nodes but no one can affect them.</p><p>3) Evolution mechanism: every time step, a node is selected randomly. The node will be affected by its neighbor nodes and its new state is produced. That means a customer have a new understanding of products because he or she is affected by their neighbor’s information. For example, at the eleventh time step, node No. 3 is selected, and its state changes for its neighbor node No. 8 affects it. Then its next state can be expressed by a state transition equation:</p><p><img src="17-7401032\32e79632-01ee-4713-b4cc-8c144755fa67.jpg" /></p><p>where <img src="17-7401032\258c46a6-5317-4f6f-9955-db5044ff62c1.jpg" /> shows state of node i in time t; <img src="17-7401032\aa4f5d47-61f7-4392-8e68-99c7d547e0ba.jpg" />shows affect strength of node No. 8. If <img src="17-7401032\d22d7494-38c4-49e2-9b3b-cc59e88ddb68.jpg" /> is bigger, that means the state of No. 3 closer to <img src="17-7401032\dc5363ab-69c8-4063-a1b8-44af68ead4cc.jpg" /> after affected; if <img src="17-7401032\2c14d612-fc16-4c91-aee2-5f9437e747a5.jpg" /> is smaller, No. 3 will be closer to its previous state after affected. In real life, the influence of type A and B nodes to other nodes may depends on how strong their promotion is. In the model, <img src="17-7401032\8a107b93-b3f8-4958-b9b5-d31bd58cc556.jpg" />and <img src="17-7401032\1ba5e7bd-27fb-417d-b413-81dcce511451.jpg" /> are taken as IF</p><p>(impact factor) of each node in type A and type B respectively. Then we give the state transition equation showing how node i is affected by its neighbor node j (1):</p></sec></sec><sec id="s3"><title>3. Numerical Simulation and Analysis</title><p>In this part, we use MATLAB to simulate evolution process of the above model. What we investigate mainly is the impact of IF to product competitiveness, which shows the correlativity between spreading strength of public opinions of products and final support rate of products. In our simulations, there are 5 nodes in the BA network first. Every time, a new node is added and connected to 3 existing nodes on the network. The size of the network is<img src="17-7401032\f983e681-4f2d-4181-b4e5-444a8e9ee378.jpg" />. The number of evolution times is 50000, and sampling interval is 500 when drawing.</p><p><xref ref-type="fig" rid="fig1">Figure 1</xref> indicates evolution process of public opinion information for two products when <img src="17-7401032\ea42c23a-b1a9-4a8b-80bd-3bbf3cbdacc8.jpg" /> and<img src="17-7401032\3472e16e-710d-4808-9be4-8ac83f512c0c.jpg" />. The vertical coordinate shows proportion of three types by total numbers of people. We see from <xref ref-type="fig" rid="fig1">Figure 1</xref> that the type with bigger IF wins. In order to validate this result further, we let<img src="17-7401032\415ec744-1476-4bc6-b89b-cef8cd3742d7.jpg" />, and value of <img src="17-7401032\5414834e-dba4-4b0d-ab64-3a5dcf248bdc.jpg" /> changes from 0.6 to 0.9. We calculate the difference of the proportion of type A by total numbers of individuals and the proportion of type B: <img src="17-7401032\7c6880e1-760f-4ec2-a2c2-951e6594ff14.jpg" />and graph it in <xref ref-type="fig" rid="fig2">Figure 2</xref>. What should be explained here is that <img src="17-7401032\a05dd85e-6e43-4056-ae8c-792e29cfd688.jpg" /> in <xref ref-type="fig" rid="fig2">Figure 2</xref> may be negative in its early evolution, but the situation will be change when system comes to a stable stage (normally after 50 times evolution). Therefore the value of <img src="17-7401032\edcf9705-dd35-4006-8059-f3b7d7b1b620.jpg" /> is positive in <xref ref-type="fig" rid="fig2">Figure 2</xref>. As we can see in <xref ref-type="fig" rid="fig2">Figure 2</xref>, the type with bigger IF is the winner and the bigger IF is, the faster it wins. To verify this conclusion further, an experiment is designed as follows. We take value of <img src="17-7401032\f127ab70-77fc-4414-bb74-0b7d262bd941.jpg" /> from 0.5 to 0.9 at interval of 0.05, and the same to<img src="17-7401032\f654fcaa-6739-4880-9727-63ecce0f0527.jpg" />. And there are 81 ways of combination consisting of different <img src="17-7401032\33466ee4-78d1-44df-9105-dcb274d6f9a1.jpg" /> and<img src="17-7401032\3f924361-73e6-4274-b4e8-e894810f4113.jpg" />, and we do 81 experiments, starting from the largest to the smallest of the value<img src="17-7401032\85dc3769-f476-43ea-89c2-98b58d408c4f.jpg" />. Then <xref ref-type="fig" rid="fig3">Figure 3</xref> is given according to the recorded figures and summarized result for the evolution process. Change in color shows change of<img src="17-7401032\2f08ec82-0d03-4ef9-ab77-a4b7c864092c.jpg" />: absolute square of<img src="17-7401032\b14ef333-d5e0-45c9-b4b9-9f3dcf7a3241.jpg" />. <xref ref-type="fig" rid="fig3">Figure 3</xref> displays that value of <img src="17-7401032\0bb0f116-5ff3-4809-af2e-7b2442de5073.jpg" /> in experiments with smaller serial numbers (<img src="17-7401032\2df3b894-c8bd-43ac-91f2-862035ddbc99.jpg" />is bigger) are growing faster, namely the competition costs shorter time, while the values of <img src="17-7401032\97e05f13-632e-4515-be6e-bbca696a2f95.jpg" /> in experiments with bigger serial number (<img src="17-7401032\f53929f3-cca8-4358-84d0-e442b827a7ad.jpg" />is smaller) are growing slower, namely the competition costs longer time. This experiment indicates that the bigger difference between two IF is, the faster determine a winner is determined.</p><disp-formula id="scirp.23016-formula43315"><label>(1)</label><graphic position="anchor" xlink:href="17-7401032\77e52bdd-f81b-4e16-8f0a-915eb2fa6c97.jpg"  xlink:type="simple"/></disp-formula></sec><sec id="s4"><title>4. Conclusions</title><p>In this paper, by building a spreading model of public opinions towards two products on BA network, we simulate their evolution process to investigate its spreading evolution mechanism on a BA network. Our research shows that the strength of public opinion information spreading about products affects their support rate directly. The party with bigger IF will win higher support rate in competition, and the bigger IF is, the faster it wins. Therefore, companies in competition must pay more attention to the service and support for their old customers and put more effort in the promotion to them.</p><p>It will be proved that the result of our research is significant to planning for fair competition in economic activities and it also provides the researchers new methods and new ideas for further study of evolution of multiple information spreading in networks.</p></sec><sec id="s5"><title>REFERENCES</title></sec><sec id="s6"><title>NOTES</title></sec></body><back><ref-list><title>References</title><ref id="scirp.23016-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">R. Albert, H. Jeong and A. L. Barabási, “Diameter of the World-Wide Web,” Nature, Vol. 401, 1999, pp. 130-131. 
doi:10.1038/43601</mixed-citation></ref><ref id="scirp.23016-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">P. Sen, P. Dasgupta, A. Chatterjee, et al., “Small-Word Properties of the Indian Railway Network,” Physical Review E, Vol. 67, 2003, Article ID: 036106. 
doi:10.1103/PhysRevE.67.036106</mixed-citation></ref><ref id="scirp.23016-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">T. Xu, J. Chen, Y. He, et al., “Complex Networks Properties of Chinese Power Grid,” International Journal of Modern Physics B, Vol. 18, 2004, pp. 2599-2603. 
doi:10.1142/S0217979204025749</mixed-citation></ref><ref id="scirp.23016-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">F. Liljeros, C. R. Edling, L. A. N. Amaral, et al., “The Web of Human Sexual Contact,” Nature, Vol. 411, 2001, pp. 907-908. doi:10.1038/35082140</mixed-citation></ref><ref id="scirp.23016-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">M. E. J. Newman, “Scientific Collaboration Networks. I. Network Construction and Fundamental Results,” Physical Review E, Vol. 64, 2001, Article ID: 016131.</mixed-citation></ref><ref id="scirp.23016-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">J. Hu, S. Zhong and L. Liang, “Exponential Stability Analysis of Stochastic Delayed Cellular Neural Network,” Chaos, Solitons &amp; Fractals, Vol. 27, No. 4, 2006, pp. 1006-1010. doi:10.1016/j.chaos.2005.04.067</mixed-citation></ref><ref id="scirp.23016-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">J. A. Dunne, R. J. Williams and N. D. Martinez, “Network Structure and Biodiversity Loss in Food Webs: Robustness Increases with Connectance,” Ecology Letters, Vol. 5, No. 4, 2002, pp. 558-567. 
doi:10.1046/j.1461-0248.2002.00354.x</mixed-citation></ref><ref id="scirp.23016-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">T. Zhou, Z. Fu and B. Wang, “Epidemic Dynamics on Complex Network,” Progress in Natural Science, Vol. 16, No. 5, 2006, pp. 452-457. 
doi:10.1080/10020070612330019</mixed-citation></ref><ref id="scirp.23016-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">X. J. Xu, H. O. Peng, X. M. Wang, et al., “Epidemic Spreading with Time Delay in Complex Networks,” Physica A, Vol. 367, 2006, pp. 525-530. 
doi:10.1016/j.physa.2005.11.035</mixed-citation></ref><ref id="scirp.23016-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">K. Li, M. Small, H. Zhang, et al., “Epidemic Outbreaks on Networks with Effective Contacts,” Nonlinear Analysis: Real World Application, Vol. 11, No. 2, 2010, pp. 1017-1025. doi:10.1016/j.nonrwa.2009.01.046</mixed-citation></ref><ref id="scirp.23016-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">R. Pastor-Satorras and A. Vespingnani, “Epidemic Spreading in Scale-Free Networks,” Physical Review Letters, Vol. 86, No. 4, 2001, pp. 3200-3203.</mixed-citation></ref><ref id="scirp.23016-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">B. Wang and T. Zhou, “Several Directions in Complex System Research,” Complex Systems and Complexity Science, Vol. 5, No. 4, 2008, pp. 21-28.</mixed-citation></ref><ref id="scirp.23016-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">J. M. Bristor, “Enhanced Explanations of Word of Mouth Communications: The Power of Relationships,” Research in Consumer Behavior, Vol. 4, 1990, pp. 51-83.</mixed-citation></ref><ref id="scirp.23016-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">A. Grabowski and R. A. Kosiński, “Ising-Based Model of Opinion Formation in a Complex Network of Interpersonal Interactions,” Physica A, Vol. 361, No. 2, 2006, pp. 651-664. doi:10.1016/j.physa.2005.06.102</mixed-citation></ref><ref id="scirp.23016-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">M. E. J. Newman, “Threshold Effects for Two Pathogens Spreading on a Network,” Physical Review Letters, Vol. 95, No. 108701, 2005.</mixed-citation></ref><ref id="scirp.23016-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple">P. Erd?s and A. Rényi, “On Random Graphs I,” Publicationes Mathematicae Debrecen, Vol. 6, 1959, pp. 290297.</mixed-citation></ref><ref id="scirp.23016-ref17"><label>17</label><mixed-citation publication-type="other" xlink:type="simple">D. J. Watts and S. H. Strogatz, “Collective Dynamics of ‘Small-World’ Networks,” Nature, Vol. 393, 1998, pp. 440-442. doi:10.1038/30918</mixed-citation></ref><ref id="scirp.23016-ref18"><label>18</label><mixed-citation publication-type="other" xlink:type="simple">A. L. Barabási and R. Albert, “Emergence of Scaling in Random Networks,” Science, Vol. 286, No. 5439, 1999, pp. 509-512. doi:10.1126/science.286.5439.509</mixed-citation></ref></ref-list></back></article>