Why Do Computer Viruses Survive In The Internet?
|
|
- Cassandra Carroll
- 6 years ago
- Views:
Transcription
1 Why Do Computer Viruses Survive In The Internet? Margarita Ifti a and Paul Neumann b a Department of Physics, Faculty of Natural Sciences, University of Tirana Bul. Zog I, Tirana, Albania b Department of Computer Sciences, University Kristal Highway Tirana-Durres, km.5, Tirana, Albania Abstract. We use the three-species cyclic competition model (Rock-Paper-Scissors), described by reactions A + B 2B, B + C 2C, C + A 2A, for emulating a computer network with viruses. Different topologies of the network bring about different dynamics of the epidemics. When the parameters of the network are varied, it is observed that very high clustering coefficients are necessary for a pandemics to happen. The differences between the networks of computer users, e- mail networks, and social networks, as well as their role in determining the nature of epidemics are also discussed. Keywords: computer networks, computer viruses, topology, clustering. PACS: Rt, Hh, Hc INTRODUCTION The Internet is a complex network of computers and routers, connected by wires or wireless links, the World Wide Web is a network of web pages connected by hyperlinks (virtual), the social networks are composed of human beings (nodes) and social connections (links). All these are examples of complex networks, whose structure (topology) has interested scientists, particularly physicists, in recent years. Three concepts are central to the modern understanding of complex networks: Small worlds: Despite the large size of the network, there is always a relatively short path between any two nodes. The best known example is the ``six degrees of separation'' idea, discovered by Stanley Milgram [1] who stated that there is a path of acquaintances with typical length of six between any pair of people in the United States. Clustering: In social networks, particularly, we observe the formation of ``cliques'', representing circles of friends or acquaintances in which everybody knows everybody. This attribute is characterized by the clustering coefficient, defined for a node i with k i >1 edges as follows: C i = 2E i / [k i (k i -1)], where E i is the number of links between the k i nodes connected to the i-th node [2]. Their average over the network gives the clustering coefficient of the network. Degree distribution: The number of edges (links) for a particular node is known as the degree of that node. The degree distribution P(k) for the real networks (World Wide Web [3], Internet [4], and metabolic networks [5]) has a power-law tail: P(k) k -. Networks with the above degree distribution (independent of N) are called scale-free [6]. The topology of the Internet is studied at the router level, and at the interdomain level. Faloutsos et al. [4] report power-law distributions with exponents around 2.2 at the interdomain level, and 2.48 at the router level. The clustering coefficient is 0.18 and 0.3 [7]. Similar topology has been observed in the movie actor collaboration [8, 6, 9, 10], science collaboration [11, 12, 13, 14], citations [14], human sexual contacts [15] networks (as some examples of social/human contacts networks). In previous works we have considered a non-spatial version of three-species competition models, and studied their long-term behaviour [16, 17]. They exhibit the extinction of one of the species, when there are no migrations, or survival of all three, when there are enough migrations into and out of the system. The same holds for systems with a larger number of species [18, 19], as well as generalized Volterra systems [20]. Many studies of the cyclic competition system, or cyclic Lotka-Volterra model, put the ensemble on a lattice [21, 22, 23]. However, humans are mobile. In such situations, the lattice models do not correctly represent the real spatial structure of the interaction and migration networks [24]. In this paper we will present a model that relates to the spread and survival of viruses in the Internet. CP1203, 7 th International Conference of the Balkan Physical Union, edited by A. Angelopoulos and T. Fildisis 2009 American Institute of Physics /09/$
2 THE ABC CYCLIC MODEL ON A SCALE-FREE NETWORK The ABC model we have previously studied in the non-spatial version has relevance to epidemiological studies, since it resembles the case when the immunity to a particular infectious disease is only temporary, otherwise known in epidemiology as the SIRS (Susceptible-Infected-Recovered-Susceptible) model [25]. (The similarity is not present at all the steps within the SIRS model.) This is particularly relevant when one is interested in the spread of computer viruses in the Internet. We would like to be able to predict, just as for ordinary infectious diseases, whether they will flare up and die out, or remain endemic. Several questions arise, the answer to which will be determined by the topology of the system. First, let us discuss the relevance of the SIRS model to the computer viruses' spread. Computer and Virus Features The very name of computer viruses comes from the obvious resemblance to natural viruses: their ability to selfreplicate, high speed of spreading, the ability to select the target system (i.e. each virus only targets certain systems, or groups of systems), the ability to infect non-infected systems, our difficulties in fighting them, etc. Most recently, one can also add a permanently increasing rate of mutation and the appearance of new generations of viruses. The global distribution of the viruses in a large degree is determined by the mass-production and popularity of personal computers, which are particularly vulnerable to infection, due to their standardised architecture and software. Many viruses are able to mutate by modifying their own code randomly, so that it is difficult to establish certain fingerprinting characteristics of a given virus. It makes a reappearing virus unrecognisable to the antivirus software, causing reinfection. This circumstance justifies the use of a SIRS model for this class of viruses. The spread of computing networks caused concerns that it would create an environment on which the viruses would thrive. Although this is true, the contrary is also true: computing networks create the environment in which the antiviruses can spread very quickly. Once one of the users of the network is in possession of the means to combat a virus, they can share it with all other users in the network who are interested within minimal time. For all the circumstances described above, the spread of some sorts of computer infections (but not all of them) can be epidemiologically modelled by a SIRS model. Our ABC cyclic model, described by reactions A + B 2B, B + C 2C, C + A 2A (all three at equal rates), is a good first realisation of the epidemiological SIRS model. Models of Networks with Different Topologies Very good reviews in the field have been written by R. Albert and A.-L. Barabási [24], S.N. Dorogovtsev and J.F.F. Mendes [26], M.E.J. Newman [27], etc. We will give very short descriptions of relevant models. A network is represented by a graph, i.e. a set of nodes and edges (links) between them. The theory of random graphs was founded by Erdös and Rényi [28, 29, 30]. A random graph is defined as N nodes connected by n edges, randomly chosen among all possible edges [28]. Erdös and Rényi [29] showed that there is a sudden change in the cluster structure as the average degree per node <k> goes through 1: from a loose collection of small clusters, a large cluster is formed, which for <k> c =1 has approximately N 2/3 of the nodes, and for larger <k> has a number of nodes proportional to network size N. For large N the degree distribution of a random network is Poisson distributed with mean <k>. The diameter of these graphs, defined as the maximal distance between any pair of nodes in it, is almost constant, if p is not too small. The above described random networks have clustering coefficients that are much smaller than those observed in real-world networks. Definition of the scale-free model. The origin of the scale-free behaviour in networks was first addressed by Barabási and Albert [3]. They attributed the scale-free nature of the networks to two mechanisms present in many networks. The Albert- Barabási algorithm for the scale-free model is the following: (i) Growth: Start with a small (m 0 ) number of nodes, then every step add a new node with m( m 0 ) edges which link the newly added node to m nodes already in the network. (ii) Preferential attachment: The probability that the new node will be connected to node i depends on the degree k i of node i: P(k i ) = k i / k j. This algorithm produces a scale-free network with an exponent equal to 3 for the power-law degree distribution. The average path length of the scale-free model follows a logarithmic dependence on the number of nodes in the network N. This model is a minimal one that captures the mechanisms responsible for the power-law degree distribution. 738
3 The CM is already the standard for simulating networks of a given. For each node, its degree k is drawn from the power-law probability distribution function. Then pairs of links are randomly placed between the nodes, until they get saturated [31, 32]. This model creates correlations in the connectivity distribution between the system nodes for <3. UCM uses the same algorithm for the construction of the network, except that the upper cutoff is fixed beforehand at k max =N 1/2. Then the connectivity correlations disappear [33]. The spread of ideas, innovations, and computer viruses is influenced immensely by the network structure. The dynamics is influenced heavily by the fact that these networks have a large clustering coefficient. Many studies of dynamics on networks have been and are being done [34, 35, 36]. This area of study is a rapidly developing one. A Model for Social and Networks When modelling the fate of viral infections, we have to keep in mind that the process of spreading will take place in a social network, for the natural viruses, and in an network, in the case of the viruses. Acquaintance networks have been studied extensively [1, 9]. Scale-free properties have been observed in some of them [37, 12, 13]. A model for the emergence of small world properties from local interactions has been introduced by Davidsen, Ebel, and Bornholdt [38, 39]. The model is based on ``transitive linking'', i.e. ``my friend's friend is my friend'', and a finite lifetime of the nodes. The dynamics is then defined as follows: (i) A randomly chosen node picks at random two nodes it is already connected to, and a link is established between those two nodes. If the picked node has degree less than two, then a link is established between it and another, randomly picked, node. (ii) With probability p, a randomly chosen node is removed from the network, and is replaced by a node with one randomly chosen link. The number of nodes remain constant. Since the nodes have a finite lifetime, the network reaches a stationary state. The death probability p is bound to be very small, since the time separation between meetings with new acquaintances is a lot shorter than that between major events, like somebody leaving the network (dying). The model described above exhibits large clustering, which only depends on the parameter p, and the (large) clustering coefficient can be tuned by varying the death rate p (this is the main reason we chose this model). When p is small enough, the network shows scale-free degree distribution; above that the degree distribution is exponential. This degree distribution is also observed in real-world social networks. SIMULATIONS OF ABC MODEL IN NETWORKS WITH DIFFERENT TOPOLOGIES It seems reasonable to try to simulate the behaviour of the ABC model in a network, generated according to the transitive linking and finite lifetime assumptions [38, 39], since it correctly describes the social networks. The social networks are a good candidate, since they are the medium through which most viruses spread. networks appear as some ``diluted'' version of a social network (e.g. not all one's friends use ). Hence, the above model does not completely describe them [40], but it seems to be a good toy model. In each case, the random networks, as well as scale-free networks (generated with Albert- Barabási, CM and UCM algorithm), were used for comparison. In our approach to the simulation of our systems, we aim at making the simulation fit the theoretical description, which means that we have to simulate continuous time Markov processes. In these processes the event times are exponentially distributed, and the characteristic time depends on the current configuration of the system. First, we initialize the simulation: the nodes are assigned an initial state at random, i.e. A, B, or C with probability 1/3, and then they are assigned a ``wake up'' time with exponential distribution. The node with the smallest time will be activated: if its state is, say, B, it will convert the nodes at state A among the ones it is connected to (emulating infection at contact), and analogously for other states. The process is then iterated. No Pandemics in the Internet! We started our simulations with the Albert- Barabási model, and a modified version of it, after Capocci et al. [41, as well as the CM and UCM models. In all cases the number of A, B, C individuals drifts with time, but none of them becomes zero. This situation is observed in network sizes up to and <k> up to 200. A typical time series is shown in Fig. 1. This situation is very applicable to network viruses. Indeed we have seen viruses reappear several times in the real life. But does this mean that we cannot have pandemics in small-world and scale-free networks? 739
4 FIGURE 1. A typical time series for the ABC model in a scale-free network of size N=900. The model for the social networks, introduced by Davidsen et al. [38, 39], seems to be a good testing ground for this, since its average degree, as well as clustering coefficient, can be tuned by varying the death parameter. As we increase the clustering coefficient, the system undergoes a transition from the ``diversity'' regime to the ``fixation'' one, much like the one observed for the non-spatial system [17]. The variation of the critical clustering coefficient with the network size is given in Fig. 2. It was possible to obtain an approximate value of the critical clustering coefficient for network sizes up to The critical value of clustering coefficient stabilizes around FIGURE 2. Critical clustering coefficient vs. network size for the social networks, modelled using the Davidsen et al. algorithm. 740
5 The computer users and networks appear as ``diluted'' versions of the social networks, so one would expect their clustering coefficient to be lower, perhaps close to those obtained with Albert- Barabási model, for which the ABC model does not reach fixation. A study of the networks was done by Ebel et al. [40], based on the log files of the server at the University of Kiel, recording the sender and receiver of every message from or to a student account over a period of 112 days. The network that emerged from the log files has nodes (including student accounts), and it has an average degree <k>=2.88. The large cluster comprises nodes and has an average degree of The power law exponent for the degree distribution is The network shows ``small world'' properties: its clustering coefficient is large, C= However, the clustering coefficient of real life networks never reach the values required in order to have pandemics, as shown by our simulations. As far as clustering goes, one end of the spectrum (when networks are considered) are the social networks, while the other one are the random networks. Runs performed on random networks were quite surprising: one would require enormous connectivities (p) to reach fixation on them! A plot of critical connectivity vs. network size for the random networks is shown in Fig. 3. The critical connectivity reaches values close to 0.4, which is enormous. FIGURE 3. Critical connectivity vs. network size for random networks. CONCLUSIONS The modern computer and viruses, with the ability to mutate (some of them), and the absence of a reliable antivirus (for others) call for SIRS epidemiologic models, rather than simply SIR. Simulations of the spread and evolution of such systems in different scale-free topologies show that all three types, (A, B, or C) are present in the network at all times. An attempt made in social network models, shows the presence of a transition to the fixation state for clustering coefficients close to This result would relate to the observed peak and disappearance of epidemics in human communities. Runs performed on random networks shows that the critical connectivities approach 0.4, which is quite an enormous connectivity. Apparently, the computer viral epidemics do not exhibit the same characteristics as human epidemics, because the clustering coefficients for the computer users/ networks cannot achieve the critical values. The clustering coefficients of networks, as measured, do not seem to get high enough to approach the critical values obtained by our simulations. It seems that the pandemics of a virus in the Internet is an unlikely event, unlike pandemics in human social networks. The Internet is threatened more by the side-effect of extreme congestion from the uncontrolled multiplication of viruses. 741
6 REFERENCES 1. S. Milgram, Psych. Today 2, (1967). 2. D.J. Watts and S.H. Strogatz, Nature 393, (1998). 3. R. Albert, H. Jeong and A.-L. Barabási, Nature 401, (1999). 4. M. Faloutsos, P. Faloutsos and C. Faloutsos, Proc. ACM SIGCOMM, Comput. Commun. Rev. 29, (1999). 5. H. Jeong, B. Tombor, R. Albert, Z.N. Oltvai and A.-L. Barabási, Nature 407, (2000). 6. A.-L. Barabási and R. Albert, Science 286, (1999). 7. R. Pastor-Satorras, A. Vázquez and A. Vespignani, Phys. Rev. Let. 87, (2001). 8. M.E.J. Newman, S.H. Strogatz and D.J. Watts, Phys. Rev. E 64, (2001). 9. L.A.N. Amaral, A. Scala, M. Barthélémy and H.A. Stanley, Proc. Nat. Acad. Sci. USA 97, (2000). 10. R. Albert and A.-L. Barabási, Phys. Rev. Lett. 85, (2000). 11. M.E.J. Newman, Proc. Nat. Acad. Sci. USA 98, (2001). 12. M.E.J. Newman, Phys. Rev. E 64, (2001). 13. A.-L. Barabási, H. Jeong, Z. Néda, E. Ravasz, A. Schubert and T. Vicsek, Physica A 311, (2002). 14. S. Redner, Eur. Phys. J. B 4, (1998). 15. F. Liljeros, C.R. Edling, L.A.N. Amaral, H.E. Stanley and Y. Aberg, Nature 411, (2001). 16. M. Ifti and B. Bergersen, Eur. Phys. J. E 10(3), (2003). 17. M. Ifti and B. Bergersen, Eur. Phys. J. B 37, (2004). 18. Y. Togashi and K. Kaneko, Phys. Rev. Let. 86(11), (2001). 19. M. Ifti and B. Bergersen, Proc. Ann. Meeting Alb-Sci. Inst., Tirana 2008 (accepted for publication). 20. M. Ifti and B. Bergersen, Proc. Int. Conf. Biol. Environ. Sci., Tirana 2008, pp L. Frachebourg, P.L. Krapivsky and E. Ben-Naim, Phys. Rev. E 54, (1996). 22. G. Szabó, M.A. Santos and J.F.F. Mendes, Phys. Rev. E 60, (1999). 23. G. Szabó and C. Hauert, Phys. Rev. E 66, (2002). 24. R. Albert and A.-L. Barabási, Rev. Mod. Phys. 74, (2002). 25. H.W. Hethcote, SIAM Review 42, (2000). 26. S.N. Dorogovtsev and J.F.F. Mendes, Adv. Phys. 51(4), (2002). 27. M.E.J. Newman, SIAM Review 45(2), (2003). 28. P. Erdös and A. Rényi, Publ. Math. Debrecen 6, (1959). 29. P. Erdös and A. Rényi, Publ. Math. Inst. Hung. Acad. Sci. 5, (1960). 30. P. Erdös and A. Rényi, Bull. Inst. Int. Stat. 38 no. 4, (1961). 31. R. Cohen, K. Erez, D. ben Avraham, and S. Havlin, Phys. Rev Lett. 85, (2000). 32. S.N. Dorogovtsev, J.F.F. Mendes, and A.N. Samukhin, Phys. Rev E 63, (2001). 33. M. Catanzaro, M. Boguñá, and R. Pastor-Satorras, Phys. Rev E 71, (2005). 34. R. Pastor-Satorras and A. Vespignani, Phys. Rev. Lett. 86, (2001). 35. R. Pastor-Satorras and A. Vespignani, Phys. Rev. E 63, (2001). 36. R. Pastor-Satorras and A. Vespignani, Phys. Rev E 65, (2002). 37. S.H. Strogatz, Nature 410, (2001). 38. J. Davidsen, H. Ebel and S. Bornholdt, Phys. Rev. Lett. 88, (2002). 39. H. Ebel, J. Davidsen and S. Bornholdt, Complexity 8(2), (2003). 40. H. Ebel, L.-I. Mielsch and S. Bornholdt, Phys. Rev E 66, (R) 1-4 (2002). 41. A. Capocci, G. Caldarelli and P. De Los Rios, arxiv:cond-mat/
Universal Behavior of Load Distribution in Scale-free Networks
Universal Behavior of Load Distribution in Scale-free Networks K.-I. Goh, B. Kahng, and D. Kim School of Physics and Center for Theoretical Physics, Seoul National University, Seoul 151-747, Korea (February
More informationImmunization for complex network based on the effective degree of vertex
Immunization for complex network based on the effective degree of vertex Ke Hu and Yi Tang * Department of Physics and Institute of Modern Physics, Xiangtan University, Xiangtan 411105, Hunan, China The
More informationHigher order clustering coecients in Barabasi Albert networks
Physica A 316 (2002) 688 694 www.elsevier.com/locate/physa Higher order clustering coecients in Barabasi Albert networks Agata Fronczak, Janusz A. Ho lyst, Maciej Jedynak, Julian Sienkiewicz Faculty of
More informationAn Evolving Network Model With Local-World Structure
The Eighth International Symposium on Operations Research and Its Applications (ISORA 09) Zhangjiajie, China, September 20 22, 2009 Copyright 2009 ORSC & APORC, pp. 47 423 An Evolving Network odel With
More informationFractal small-world dichotomy in real-world networks
PHYSICA REVIEW E 70, 016122 (2004) Fractal small-world dichotomy in real-world networks Gábor Csányi* TCM Group, Cavendish aboratory, University of Cambridge, Madingley Road, Cambridge CB3 OHE, United
More informationM.E.J. Newman: Models of the Small World
A Review Adaptive Informatics Research Centre Helsinki University of Technology November 7, 2007 Vocabulary N number of nodes of the graph l average distance between nodes D diameter of the graph d is
More informationFailure in Complex Social Networks
Journal of Mathematical Sociology, 33:64 68, 2009 Copyright # Taylor & Francis Group, LLC ISSN: 0022-250X print/1545-5874 online DOI: 10.1080/00222500802536988 Failure in Complex Social Networks Damon
More informationnetworks and the spread of computer viruses
Email networks and the spread of computer viruses M. E. J. Newman, 1 Stephanie Forrest, 1, 2 andjustinbalthrop 2 1 Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, NM 87501 2 Department of Computer Science,
More informationCharacteristics of Preferentially Attached Network Grown from. Small World
Characteristics of Preferentially Attached Network Grown from Small World Seungyoung Lee Graduate School of Innovation and Technology Management, Korea Advanced Institute of Science and Technology, Daejeon
More informationarxiv:cond-mat/ v2 [cond-mat.stat-mech] 1 Sep 2002
APS/123-QED Hierarchical organization in complex networs arxiv:cond-mat/0206130v2 [cond-mat.stat-mech] 1 Sep 2002 Erzsébet Ravasz and Albert-László Barabási Department of Physics, 225 Nieuwland Science
More informationarxiv:cond-mat/ v1 [cond-mat.dis-nn] 3 Aug 2000
Error and attack tolerance of complex networks arxiv:cond-mat/0008064v1 [cond-mat.dis-nn] 3 Aug 2000 Réka Albert, Hawoong Jeong, Albert-László Barabási Department of Physics, University of Notre Dame,
More informationAttack Vulnerability of Network with Duplication-Divergence Mechanism
Commun. Theor. Phys. (Beijing, China) 48 (2007) pp. 754 758 c International Academic Publishers Vol. 48, No. 4, October 5, 2007 Attack Vulnerability of Network with Duplication-Divergence Mechanism WANG
More informationFrom Centrality to Temporary Fame: Dynamic Centrality in Complex Networks
From Centrality to Temporary Fame: Dynamic Centrality in Complex Networks Dan Braha 1, 2 and Yaneer Bar-Yam 2 1 University of Massachusetts Dartmouth, MA 02747, USA 2 New England Complex Systems Institute
More informationThe Establishment Game. Motivation
Motivation Motivation The network models so far neglect the attributes, traits of the nodes. A node can represent anything, people, web pages, computers, etc. Motivation The network models so far neglect
More informationModelling weighted networks using connection count
Home Search Collections Journals About Contact us My IOPscience Modelling weighted networks using connection count This article has been downloaded from IOPscience. Please scroll down to see the full text
More informationResponse Network Emerging from Simple Perturbation
Journal of the Korean Physical Society, Vol 44, No 3, March 2004, pp 628 632 Response Network Emerging from Simple Perturbation S-W Son, D-H Kim, Y-Y Ahn and H Jeong Department of Physics, Korea Advanced
More informationCritical Phenomena in Complex Networks
Critical Phenomena in Complex Networks Term essay for Physics 563: Phase Transitions and the Renormalization Group University of Illinois at Urbana-Champaign Vikyath Deviprasad Rao 11 May 2012 Abstract
More informationSmall World Properties Generated by a New Algorithm Under Same Degree of All Nodes
Commun. Theor. Phys. (Beijing, China) 45 (2006) pp. 950 954 c International Academic Publishers Vol. 45, No. 5, May 15, 2006 Small World Properties Generated by a New Algorithm Under Same Degree of All
More informationComplex Network Metrology
Complex Network Metrology Jean-Loup Guillaume and Matthieu Latapy liafa cnrs Université Paris 7 2 place Jussieu, 755 Paris, France. (guillaume,latapy)@liafa.jussieu.fr Abstract In order to study some complex
More informationTopology and Dynamics of Complex Networks
CS 790R Seminar Modeling & Simulation Topology and Dynamics of Complex Networks ~ Lecture 3: Review based on Strogatz (2001), Barabási & Bonabeau (2003), Wang, X. F. (2002) ~ René Doursat Department of
More informationTopologies and Centralities of Replied Networks on Bulletin Board Systems
Topologies and Centralities of Replied Networks on Bulletin Board Systems Qin Sen 1,2 Dai Guanzhong 2 Wang Lin 2 Fan Ming 2 1 Hangzhou Dianzi University, School of Sciences, Hangzhou, 310018, China 2 Northwestern
More informationStatistical Analysis of the Metropolitan Seoul Subway System: Network Structure and Passenger Flows arxiv: v1 [physics.soc-ph] 12 May 2008
Statistical Analysis of the Metropolitan Seoul Subway System: Network Structure and Passenger Flows arxiv:0805.1712v1 [physics.soc-ph] 12 May 2008 Keumsook Lee a,b Woo-Sung Jung c Jong Soo Park d M. Y.
More information(Social) Networks Analysis III. Prof. Dr. Daning Hu Department of Informatics University of Zurich
(Social) Networks Analysis III Prof. Dr. Daning Hu Department of Informatics University of Zurich Outline Network Topological Analysis Network Models Random Networks Small-World Networks Scale-Free Networks
More informationAttacks and Cascades in Complex Networks
Attacks and Cascades in Complex Networks Ying-Cheng Lai 1, Adilson E. Motter 2, and Takashi Nishikawa 3 1 Department of Mathematics and Statistics, Department of Electrical Engineering, Arizona State University,
More informationSmallest small-world network
Smallest small-world network Takashi Nishikawa, 1, * Adilson E. Motter, 1, Ying-Cheng Lai, 1,2 and Frank C. Hoppensteadt 1,2 1 Department of Mathematics, Center for Systems Science and Engineering Research,
More informationarxiv:cond-mat/ v1 21 Oct 1999
Emergence of Scaling in Random Networks Albert-László Barabási and Réka Albert Department of Physics, University of Notre-Dame, Notre-Dame, IN 46556 arxiv:cond-mat/9910332 v1 21 Oct 1999 Systems as diverse
More informationComplex Networks. Structure and Dynamics
Complex Networks Structure and Dynamics Ying-Cheng Lai Department of Mathematics and Statistics Department of Electrical Engineering Arizona State University Collaborators! Adilson E. Motter, now at Max-Planck
More informationStructural Analysis of Paper Citation and Co-Authorship Networks using Network Analysis Techniques
Structural Analysis of Paper Citation and Co-Authorship Networks using Network Analysis Techniques Kouhei Sugiyama, Hiroyuki Ohsaki and Makoto Imase Graduate School of Information Science and Technology,
More informationThe coupling effect on VRTP of SIR epidemics in Scale- Free Networks
The coupling effect on VRTP of SIR epidemics in Scale- Free Networks Kiseong Kim iames@kaist.ac.kr Sangyeon Lee lsy5518@kaist.ac.kr Kwang-Hyung Lee* khlee@kaist.ac.kr Doheon Lee* dhlee@kaist.ac.kr ABSTRACT
More informationSearch in weighted complex networks
Search in weighted complex networks Hari P. Thadakamalla, R. Albert 2 and S. R. T. Kumara Department of Industrial Engineering, The Pennsylvania State University, University Park, PA 6802 2 Department
More informationDeterministic Hierarchical Networks
Deterministic Hierarchical Networks L. Barrière, F. Comellas, C. Dalfó, M.A. Fiol Departament de Matemàtiques Universitat Politècnica de Catalunya Barcelona (Catalonia) {lali.barriere,francesc.comellas}@upc.edu
More informationTopological properties of integer networks
Physica A 367 (2006) 613 618 www.elsevier.com/locate/physa Topological properties of integer networks Tao Zhou a, Bing-Hong Wang a,, P.M. Hui b, K.P. Chan b a Department of Modern Physics and Nonlinear
More informationModeling Traffic of Information Packets on Graphs with Complex Topology
Modeling Traffic of Information Packets on Graphs with Complex Topology Bosiljka Tadić Jožef Stefan Institute, Box 3000, 1001 Ljubljana, Slovenia Bosiljka.Tadic ijs.si http://phobos.ijs.si/ tadic/ Abstract.
More informationComplex Networks: Ubiquity, Importance and Implications. Alessandro Vespignani
Contribution : 2005 NAE Frontiers of Engineering Complex Networks: Ubiquity, Importance and Implications Alessandro Vespignani School of Informatics and Department of Physics, Indiana University, USA 1
More informationNetworks and Discrete Mathematics
Aristotle University, School of Mathematics Master in Web Science Networks and Discrete Mathematics Small Words-Scale-Free- Model Chronis Moyssiadis Vassilis Karagiannis 7/12/2012 WS.04 Webscience: lecture
More informationFITNESS-BASED GENERATIVE MODELS FOR POWER-LAW NETWORKS
Chapter 1 FITNESS-BASED GENERATIVE MODELS FOR POWER-LAW NETWORKS Khanh Nguyen, Duc A. Tran Department of Computer Science University of Massachusets, Boston knguyen,duc@cs.umb.edu Abstract Many real-world
More informationSecond-Order Assortative Mixing in Social Networks
Second-Order Assortative Mixing in Social Networks 1 arxiv:0903.0687v2 [physics.soc-ph] 23 Nov 2009 Shi Zhou* and Ingemar J. Cox Department of Computer Science, University College London Gower Street,
More informationEmpirical analysis of online social networks in the age of Web 2.0
Physica A 387 (2008) 675 684 www.elsevier.com/locate/physa Empirical analysis of online social networks in the age of Web 2.0 Feng Fu, Lianghuan Liu, Long Wang Center for Systems and Control, College of
More informationThe Complex Network Phenomena. and Their Origin
The Complex Network Phenomena and Their Origin An Annotated Bibliography ESL 33C 003180159 Instructor: Gerriet Janssen Match 18, 2004 Introduction A coupled system can be described as a complex network,
More informationAn introduction to the physics of complex networks
An introduction to the physics of complex networks Alain Barrat CPT, Marseille, France ISI, Turin, Italy http://www.cpt.univ-mrs.fr/~barrat http://www.cxnets.org http://www.sociopatterns.org REVIEWS: Statistical
More informationOnset of traffic congestion in complex networks
Onset of traffic congestion in complex networks Liang Zhao, 1,2 Ying-Cheng Lai, 1,3 Kwangho Park, 1 and Nong Ye 4 1 Department of Mathematics and Statistics, Arizona State University, Tempe, Arizona 85287,
More informationModels and Algorithms for Network Immunization
Models and Algorithms for Network Immunization George Giakkoupis University of Toronto Aristides Gionis, Evimaria Terzi and Panayiotis Tsaparas University of Helsinki Abstract Recently, there has been
More informationNetwork Thinking. Complexity: A Guided Tour, Chapters 15-16
Network Thinking Complexity: A Guided Tour, Chapters 15-16 Neural Network (C. Elegans) http://gephi.org/wp-content/uploads/2008/12/screenshot-celegans.png Food Web http://1.bp.blogspot.com/_vifbm3t8bou/sbhzqbchiei/aaaaaaaaaxk/rsc-pj45avc/
More informationThe network of scientific collaborations within the European framework programme
Physica A 384 (2007) 675 683 www.elsevier.com/locate/physa The network of scientific collaborations within the European framework programme Juan A. Almendral a, J.G. Oliveira b,l.lo pez c, J.F.F. Mendes
More informationAn Exploratory Journey Into Network Analysis A Gentle Introduction to Network Science and Graph Visualization
An Exploratory Journey Into Network Analysis A Gentle Introduction to Network Science and Graph Visualization Pedro Ribeiro (DCC/FCUP & CRACS/INESC-TEC) Part 1 Motivation and emergence of Network Science
More informationLesson 4. Random graphs. Sergio Barbarossa. UPC - Barcelona - July 2008
Lesson 4 Random graphs Sergio Barbarossa Graph models 1. Uncorrelated random graph (Erdős, Rényi) N nodes are connected through n edges which are chosen randomly from the possible configurations 2. Binomial
More informationPhase Transitions in Random Graphs- Outbreak of Epidemics to Network Robustness and fragility
Phase Transitions in Random Graphs- Outbreak of Epidemics to Network Robustness and fragility Mayukh Nilay Khan May 13, 2010 Abstract Inspired by empirical studies researchers have tried to model various
More informationSupplementary Information
1 2 3 4 5 6 7 8 9 10 11 12 Supplementary Information Competition-Based Benchmarking of Influence Ranking Methods in Social Networks Alexandru Topîrceanu Contents 1 Node overlapping correlation change as
More informationOverlay (and P2P) Networks
Overlay (and P2P) Networks Part II Recap (Small World, Erdös Rényi model, Duncan Watts Model) Graph Properties Scale Free Networks Preferential Attachment Evolving Copying Navigation in Small World Samu
More informationPortraits of complex networks
16 15 1 0 13 11 3 8 2 5 9 4 7 12 17 10 14 6 19 18 9 4 8 6 10 5 12 14 17 16 2 0 13 3 18 15 7 1 11 19 March 2008 EPL, 81 (2008) 68004 doi: 10.1209/0295-5075/81/68004 www.epljournal.org Portraits of complex
More informationResearch on Community Structure in Bus Transport Networks
Commun. Theor. Phys. (Beijing, China) 52 (2009) pp. 1025 1030 c Chinese Physical Society and IOP Publishing Ltd Vol. 52, No. 6, December 15, 2009 Research on Community Structure in Bus Transport Networks
More informationWednesday, March 8, Complex Networks. Presenter: Jirakhom Ruttanavakul. CS 790R, University of Nevada, Reno
Wednesday, March 8, 2006 Complex Networks Presenter: Jirakhom Ruttanavakul CS 790R, University of Nevada, Reno Presented Papers Emergence of scaling in random networks, Barabási & Bonabeau (2003) Scale-free
More informationNick Hamilton Institute for Molecular Bioscience. Essential Graph Theory for Biologists. Image: Matt Moores, The Visible Cell
Nick Hamilton Institute for Molecular Bioscience Essential Graph Theory for Biologists Image: Matt Moores, The Visible Cell Outline Core definitions Which are the most important bits? What happens when
More informationComplex Network Metrology
Complex Network Metrology Jean-Loup Guillaume Matthieu Latapy LIAFA CNRS Université Paris 7, 2 place Jussieu, 755 Paris, France In order to study complex networks like the Internet, the World Wide Web,
More informationGraph-theoretic Properties of Networks
Graph-theoretic Properties of Networks Bioinformatics: Sequence Analysis COMP 571 - Spring 2015 Luay Nakhleh, Rice University Graphs A graph is a set of vertices, or nodes, and edges that connect pairs
More informationScience of Networks. Albert-László Barabási. From Society to the Web
Albert-László Barabási Science of Networks From Society to the Web Since the National Science Foundation gave up its stewardship over the internet in 1995, the network appears to be living a life of its
More informationCascade dynamics of complex propagation
Physica A 374 (2007) 449 456 www.elsevier.com/locate/physa Cascade dynamics of complex propagation Damon Centola a,b,,vı ctor M. Eguı luz c, Michael W. Macy b a Department of Sociology, Columbia University,
More informationProperties of Biological Networks
Properties of Biological Networks presented by: Ola Hamud June 12, 2013 Supervisor: Prof. Ron Pinter Based on: NETWORK BIOLOGY: UNDERSTANDING THE CELL S FUNCTIONAL ORGANIZATION By Albert-László Barabási
More informationSmall-World Models and Network Growth Models. Anastassia Semjonova Roman Tekhov
Small-World Models and Network Growth Models Anastassia Semjonova Roman Tekhov Small world 6 billion small world? 1960s Stanley Milgram Six degree of separation Small world effect Motivation Not only friends:
More informationA Generating Function Approach to Analyze Random Graphs
A Generating Function Approach to Analyze Random Graphs Presented by - Vilas Veeraraghavan Advisor - Dr. Steven Weber Department of Electrical and Computer Engineering Drexel University April 8, 2005 Presentation
More informationIn light of extensive evidence that Internet protocol performance
Modeling the Internet s large-scale topology Soon-Hyung Yook*, Hawoong Jeong*, and Albert-László Barabási* *Department of Physics, University of Notre Dame, Notre Dame, IN 46556; and Department of Physics,
More informationSearching for influencers in big-data complex networks
1 Searching for influencers in big-data complex networks Byungjoon Min, Flaviano Morone, and Hernán A. Makse Levich Institute and Physics Department, City College of New York, New York, NY 10031 Abstract.
More informationExample for calculation of clustering coefficient Node N 1 has 8 neighbors (red arrows) There are 12 connectivities among neighbors (blue arrows)
Example for calculation of clustering coefficient Node N 1 has 8 neighbors (red arrows) There are 12 connectivities among neighbors (blue arrows) Average clustering coefficient of a graph Overall measure
More informationCS-E5740. Complex Networks. Scale-free networks
CS-E5740 Complex Networks Scale-free networks Course outline 1. Introduction (motivation, definitions, etc. ) 2. Static network models: random and small-world networks 3. Growing network models: scale-free
More informationECS 253 / MAE 253, Lecture 8 April 21, Web search and decentralized search on small-world networks
ECS 253 / MAE 253, Lecture 8 April 21, 2016 Web search and decentralized search on small-world networks Search for information Assume some resource of interest is stored at the vertices of a network: Web
More informationErdős-Rényi Model for network formation
Network Science: Erdős-Rényi Model for network formation Ozalp Babaoglu Dipartimento di Informatica Scienza e Ingegneria Università di Bologna www.cs.unibo.it/babaoglu/ Why model? Simpler representation
More informationarxiv:cs/ v4 [cs.ni] 13 Sep 2004
Accurately modeling the Internet topology Shi Zhou and Raúl J. Mondragón Department of Electronic Engineering, Queen Mary College, University of London, London, E1 4NS, United Kingdom. arxiv:cs/0402011v4
More informationNDIA 19th Annual System Engineering Conference, Springfield, Virginia October 24-27, 2016
NDIA 19th Annual System Engineering Conference, Springfield, Virginia October 24-27, 2016 Caesar S. Benipayo, PhD Student Under advisement of Dr. Michael Grenn and Dr. Blake Roberts Department of Engineering
More informationIntroduction to Networks and Business Intelligence
Introduction to Networks and Business Intelligence Prof. Dr. Daning Hu Department of Informatics University of Zurich Sep 16th, 2014 Outline n Network Science A Random History n Network Analysis Network
More informationTuning clustering in random networks with arbitrary degree distributions
PHYSICAL REVIEW E 72, 036133 2005 Tuning clustering in random networks with arbitrary degree distributions M. Ángeles Serrano 1 and Marián Boguñá 2 1 School of Informatics, Indiana University, Eigenmann
More informationSelf-organization of collaboration networks
PHYSICAL REVIEW E 70, 036106 (2004) Self-organization of collaboration networks José J. Ramasco, 1, * S. N. Dorogovtsev, 2,3,4 and Romualdo Pastor-Satorras 5 1 Departamento de Física and Centro de Física
More informationMixing navigation on networks. Tao Zhou
Published in "Physica A: Statistical Mechanics and its Applications 387(12): 3025-3032, 2008" which should be cited to refer to this work. Mixing navigation on networks Tao Zhou Department of Modern Physics,
More informationA Realistic Model for Complex Networks
A Realistic Model for Complex Networks Jean-Loup Guillaume, Matthieu Latapy LIAFA, University of Paris 7 2 place Jussieu 75005 Paris France. (guillaume,latapy)@liafa.jussieu.fr Abstract It appeared recently
More information1 Introduction. Russia
Modeling of open network reliability including the Internet based on the theory of percolation in two - dimensional and three-dimensional regular and random network structures D. Zhukov 1, S. Lesko 1,
More informationComplex networks: Dynamics and security
PRAMANA c Indian Academy of Sciences Vol. 64, No. 4 journal of April 2005 physics pp. 483 502 Complex networks: Dynamics and security YING-CHENG LAI 1, ADILSON MOTTER 2, TAKASHI NISHIKAWA 3, KWANGHO PARK
More informationTraffic dynamics based on an efficient routing strategy on scale free networks
Eur. Phys. J. B 49, 205 211 (2006) DOI: 10.1140/epjb/e2006-00040-2 THE EUROPEAN PHYSICAL JOURNAL B Traffic dynamics based on an efficient routing strategy on scale free networks C.-Y. Yin 1,B.-H.Wang 1a,W.-X.Wang
More informationγ : constant Goett 2 P(k) = k γ k : degree
Goett 1 Jeffrey Goett Final Research Paper, Fall 2003 Professor Madey 19 December 2003 Abstract: Recent observations by physicists have lead to new theories about the mechanisms controlling the growth
More informationThe physics of the Web
1 of 9 physics world The internet appears to have taken on a life of its own ever since the National Science Foundation in the US gave up stewardship of the network in 1995. New lines and routers are added
More informationRethinking Preferential Attachment Scheme: Degree centrality versus closeness centrality 1
CONNECTIONS 27(3): 53-59 2007 INSNA http://www.insna.org/connections-web/volume27-3/ko.pdf Rethinking Preferential Attachment Scheme: Degree centrality versus closeness centrality 1 Kilkon Ko 2 University
More informationOn Complex Dynamical Networks. G. Ron Chen Centre for Chaos Control and Synchronization City University of Hong Kong
On Complex Dynamical Networks G. Ron Chen Centre for Chaos Control and Synchronization City University of Hong Kong 1 Complex Networks: Some Typical Examples 2 Complex Network Example: Internet (William
More informationEpidemic spreading on networks
Epidemic spreading on networks Due date: Sunday October 25th, 2015, at 23:59. Always show all the steps which you made to arrive at your solution. Make sure you answer all parts of each question. Always
More informationRandom graphs as models of networks
Random graphs as models of networks M. E. J. Newman Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, NM 87501, U.S.A. arxiv:cond-mat/0202208 v1 12 Feb 2002 Abstract The random graph of Erdős and Rényi
More informationScale-free user-network approach to telephone network traffic analysis
Scale-free user-network approach to telephone network traffic analysis Yongxiang Xia,* Chi K. Tse, WaiM.Tam, Francis C. M. Lau, and Michael Small Department of Electronic and Information Engineering, Hong
More informationReply Networks on Bulletin Board System
APS/123-QED Reply Networks on Bulletin Board System Kou Zhongbao and Zhang Changshui State Key Laboratory of Intelligent Technology and Systems Department of Automation, Tsinghua University Beijing, 100084,
More informationData mining --- mining graphs
Data mining --- mining graphs University of South Florida Xiaoning Qian Today s Lecture 1. Complex networks 2. Graph representation for networks 3. Markov chain 4. Viral propagation 5. Google s PageRank
More informationGlobal dynamic routing for scale-free networks
Global dynamic routing for scale-free networks Xiang Ling, Mao-Bin Hu,* Rui Jiang, and Qing-Song Wu School of Engineering Science, University of Science and Technology of China, Hefei 230026, People s
More informationarxiv:cond-mat/ v1 9 Jan 2003
Search and Congestion in Complex Networks Alex Arenas 1, Antonio Cabrales 2, Albert Díaz-Guilera 3, Roger Guimerà 4, and Fernando Vega-Redondo 5 arxiv:cond-mat/0301124 v1 9 Jan 2003 1 Departament d Enginyeria
More informationSupply chains involve complex webs of interactions among suppliers, manufacturers,
D e p e n d a b l e A g e n t S y s t e m s Survivability of Multiagent-Based Supply Networks: A Topological Perspective Hari Prasad Thadakamalla, Usha Nandini Raghavan, Soundar Kumara, and Réka Albert,
More informationA Big World Inside Small-World Networks
A Big World Inside Small-World Networks Zhihua Zhang, Jianzhi Zhang* Department of Ecology and Evolutionary Biology, University of Michigan, Ann Arbor, Michigan, United States of America Abstract Real
More informationTHE DEPENDENCY NETWORK IN FREE OPERATING SYSTEM
Vol. 5 (2012) Acta Physica Polonica B Proceedings Supplement No 1 THE DEPENDENCY NETWORK IN FREE OPERATING SYSTEM Tomasz M. Gradowski a, Maciej J. Mrowinski a Robert A. Kosinski a,b a Warsaw University
More informationThe missing links in the BGP-based AS connectivity maps
The missing links in the BGP-based AS connectivity maps Zhou, S; Mondragon, RJ http://arxiv.org/abs/cs/0303028 For additional information about this publication click this link. http://qmro.qmul.ac.uk/xmlui/handle/123456789/13070
More informationComplex networks: A mixture of power-law and Weibull distributions
Complex networks: A mixture of power-law and Weibull distributions Ke Xu, Liandong Liu, Xiao Liang State Key Laboratory of Software Development Environment Beihang University, Beijing 100191, China Abstract:
More informationIntroduction to network metrics
Universitat Politècnica de Catalunya Version 0.5 Complex and Social Networks (2018-2019) Master in Innovation and Research in Informatics (MIRI) Instructors Argimiro Arratia, argimiro@cs.upc.edu, http://www.cs.upc.edu/~argimiro/
More informationEvolving Models for Meso-Scale Structures
Evolving Models for Meso-Scale Structures Akrati Saxena Computer Science and Engineering Indian Institute of Technology Ropar, India Email: akrati.saxena@iitrpr.ac.in S. R. S. Iyengar Computer Science
More informationarxiv:cond-mat/ v1 [cond-mat.dis-nn] 7 Jan 2004
Structural Vulnerability of the North American Power Grid Réka Albert 1,2 István Albert 2 and Gary L. Nakarado 3 arxiv:cond-mat/0401084v1 [cond-mat.dis-nn] 7 Jan 2004 1. Department of Physics, Pennsylvania
More informationRandom graph models of social networks
Colloquium Random graph models of social networs M. E. J. Newman*, D. J. Watts, and S. H. Strogatz *Santa Fe Institute, 1399 Hyde Par Road, Santa Fe, NM 87501; Department of Sociology, Columbia University,
More informationA new analysis method for simulations using node categorizations
Soc. Netw. Anal. Min. DOI 10.1007/s13278-012-08-x ORIGINAL ARTICLE A new analysis method for simulations using node categorizations Tomoyuki uasa Susumu Shirayama Received: 28 April 2011 / Revised: 17
More informationHow Do Real Networks Look? Networked Life NETS 112 Fall 2014 Prof. Michael Kearns
How Do Real Networks Look? Networked Life NETS 112 Fall 2014 Prof. Michael Kearns Roadmap Next several lectures: universal structural properties of networks Each large-scale network is unique microscopically,
More informationModelling data networks research summary and modelling tools
Modelling data networks research summary and modelling tools a 1, 3 1, 2 2, 2 b 0, 3 2, 3 u 1, 3 α 1, 6 c 0, 3 v 2, 2 β 1, 1 Richard G. Clegg (richard@richardclegg.org) December 2011 Available online at
More informationExamples of Complex Networks
Examples of Complex Networks Neural Network (C. Elegans) http://gephi.org/wp-content/uploads/2008/12/screenshot-celegans.png Food Web http://1.bp.blogspot.com/_vifbm3t8bou/sbhzqbchiei/aaaaaaaaaxk/rsc-
More information