Eur. Phys.J. B 38, 147–162 (2004) THE EUROPEAN DOI:10.1140/epjb/e2004-00110-5 PHYSICAL JOURNAL B Complex networks Augmenting the framework for the study of complex systems L.A.N. Amarala and J.M. Ottino Department of Chemical and Biological Engineering, Northwestern University,Evanston, IL 60208, USA Received 12 November2003 Published online 14 May 2004 – (cid:1)c EDP Sciences, Societ`a Italiana di Fisica, Springer-Verlag2004 Abstract. Webrieflydescribethetoolkitusedforstudyingcomplexsystems:nonlineardynamics,statistical physics, and network theory. We place particular emphasis on network theory—the topic of this special issue—and its importance in augmenting the framework for the quantitative study of complex systems. In order to illustrate the main issues, we briefly review several areas where network theory has led to significantdevelopmentsinourunderstandingofcomplexsystems.Specifically,wediscusschanges,arising from network theory,in ourunderstandingof (i) theInternetand other communication networks, (ii) the structure of natural ecosystems, (iii) the spread of diseases and information, (iv) the structure of cellular signalling networks, and (v) infrastructure robustness. Finally, we discuss how complexity requires both newtoolsandanaugmentationoftheconceptualframework—includinganexpandeddefinitionofwhatis meant bya “quantitative prediction.” PACS. 89.75.Fb Structuresandorganizationincomplexsystems–89.75.Da Systemsobeyingscalinglaws 1 Introduction tweenthecomplexityofthedynamicsgeneratedbysimple systems and that of complex systems [1]. What do metabolic pathways and ecosystems, the Inter- Simplesystemshaveasmallnumberofcomponentswhich net, and propagation of HIV infection have in common? act according to well understood laws—Consider what is Until a few years ago, the answer would have been very perhaps the prototypical simple system; the pendulum. little.Thefirsttwoexamplesarebiologicalandshapedby Thenumberofpartsissmall,infact,one.Thesystemcan evolution, the third is a human creation, and the fourth bedescribedintermsofwell-knownlaws—Newton’sequa- is an unwieldy mixture of biology and sociological com- tions. The example of the pendulum raises an important ponents. However, in the last few years the answer that point: The need to distinguish between complex systems has emerged is that they all share similar network archi- and complex dynamics: It takes little for a simple system tectures. Seemingly out of nowhere, in the span of a few such as the pendulum to generate “complex” dynamics. years, network theory has become one of the most visi- A forced pendulum—with gravity being a periodic func- ble pieces of the body of knowledge that can be applied tion of time—is chaotic. In fact one can argue that the to the description, analysis, and understanding of com- driven pendulum contains everything that one needs to plex systems. New applications are developed at an ever- knowaboutchaos;theentiredynamicalsystemstextbook increasing rate and the promise for future growthis high: by Baker and Gollub [2] is built around this theme. And Networktheoryisnowanessentialingredientinthestudy a pendulum hanging from another pendulum—a double of complex systems. pendulum—is also chaotic (Fig. 1a). However,before delving into networksthemselves it is importanttoputtheoverallsubjectincontext,attempta Complicated systems have a large number of components definition of complexity itself, and present a brief review which have well-defined roles and are governed by well- ofthe othertools thatareusedinthe analysisofcomplex understood rules—A Boeing 747-400 has, excluding fas- systems. teners, 3×106 parts (Fig. 1b). In complicated systems, Thediscussionhastostartwithtwoimportantdistinc- such as the Boeing, parts have to work in unison to ac- tions:Firstadifferentiationbetweenwhatiscomplexand complish a function. One key defect (in one of the many what is merely complicated. Second a differentiation be- critical parts) brings the entire system to a halt. This is why redundancy is built into the design when system a e-mail: [email protected] failure is not an option. More importantly, complicated 148 The European Physical Journal B whichthe Boeing is not.The flockresponds to changesin the environment—that is indeed why it migrates—more- over,and unlike what one may naively guess, the migrat- ing geese self-organize without the need for a leader or maestro to tell the rest of the flock what to do. This is clearlyrevealedbyobservingthedynamicunrepeatedpat- ternsgeneratedbythegeeseastheyadjusttheirflyingfor- mations. Roles in the flock are fluid and one goose at the headoftheformationwillquicklybereplacedbyanother. Thisfeatureofthe flockgivesitagreatdealofrobustness asnosinglegooseisessentialfortheflock’ssuccessduring the migration. The stock market, a termite colony, cities, or the hu- manbrain,arealsocomplex.As fortheflockofgeese,the number of parts is not the critical issue. The key charac- teristic is adaptability—the systems respond to external conditions. Complex systems: Self-organization and emergence—It is far from trivial to come up with an all-encompassing def- inition of complex systems. Nevertheless let us attempt one:Acomplexsystemisasystemwithalargenumberof elements,buildingblocksoragents,capableofinteracting with each other and with their environment. The inter- action between elements may occur only with immediate Fig. 1. Simple, complicated and complex systems. (a) The neighborsorwithdistantones;the agentscanbe alliden- double pendulum—a pendulum hanging from another tical or different; they may move in space or occupy fixed pendulum—isanexampleofasimplesystem.Allpartscanbe positions, and can be in one of two states or of multiple well characterized and the equations describing their motion states.The commoncharacteristicof allcomplex systems are also well known. (b) The Boeing 747-400 has on excess is that they display organizationwithout anyexternal or- of 3×106 parts. (c) A flock of migrating geese. The Boeing ganizingprinciple being applied.The wholeis muchmore 747-400 is not a complex system because all its parts have that the sum of its parts. strictly defined roles and prescribed interactions. This is typ- ical of complicated systems, in which robustness is achieved Examples of complex systems are among some of the through redundancy, i.e., including several copies of the same mostelusiveandfascinatingquestionsinvestigatedbysci- part in parallel. In contrast, for complex systems, robustness entists nowadays: how consciousness arises out of the in- is achieved by enabling the parts to adapt and adopt differ- teractions of the neurons in the brain and between the entroles.Themigratinggeeseprovideagood exampleofsuch brain and its environment, how humans create and learn strategy,theubiquitous“V”formationsofthemigratinggeese societal rules, or how DNA orchestrates processes in our arenotstaticstructureswithaleaderatthehead,insteadthe cells. structuresarefluidwithanumberofbirdsoccupyingthehead position at different times. Organizationofthe manuscript—InSection2wedescribe the challenges faced when studying complex systems and describehowscientists frommany differentareashavere- sponded to these challenges. We then, in Section 3, de- systems have a limited range of responses to environ- scribethetoolkitusedforstudyingcomplexsystems:non- mental changes. Even the most advanced mechanical linear dynamics, statistical physics, and network theory. chronometers can only adjust to a small range of changes Nonlinearinteractions,oneofthegreatestchallengesin in temperature, pressure and humidity before they loose thestudyofcomplexsystems,areatthecoreoftheemer- accuracy.And aBoeing without its crew is notable to do gence of qualitatively different states, new states that are much of anything to adjust to something extraordinary. notmerecombinationsofthestatesoftheindividualunits Complex systems typically have a large number of com- comprising the system. Indeed, the role of nonlinear dy- ponentswhichmayactaccordingtorulesthatmaychange namicsintheunderstandingofcomplexsystemshasbeen over time and that may not be well understood; the con- important for more than two decades. Statistical physics nectivityofthecomponentsmaybequiteplasticandroles providesthe studyofcomplexsystemswith,ononehand, maybefluid—ContrasttheBoeing747-400withaflockof techniques particularly suited for study of systems with a migrating geese (Figs. 1b–c). Superficially, the geese are large number of units and, on the other hand, with two all similar and the flock has far fewer members than the fundamental concepts for the quantitative characteriza- Boeing has parts, so one might be tempted to think that tion of complex systems—scaling and universality. the Boeing is more complex than the flock of geese. How- Notwithstanding the importance of nonlinear dynam- ever, the flock of migrating geese is an adaptable system, ics and statistical physics, we place particular emphasis L.A.N.Amaral and J.M. Ottino: Complex networks 149 onnetworktheorydue toitbeing the centraltopicofthis – Poorlycharacterizedtemporalandspatialcorrelations specialissue andtothe explosiverate ofadvance thatthe of external perturbations; fieldhasexperiencedinthelastfiveyears.InSection4we – Non-stationarity of external perturbations. reviewsomeofthemostsignificantadvancesinourunder- standingofthemechanismsresponsiblefortheemergence of real-world networks. 3 Tools for the study of complex systems In Section 5, we briefly review several cases where research on networks has lead to new insights into the emergence,organizationandbehaviorofcomplexsystems. Inaroughsense,thecurrenttoolboxusedintacklingcom- Specifically, we summarize a selection of results on four plex systems involves three main areas: (i) nonlinear dy- topics:(i)theInternetandothercommunicationnetworks, namics, (ii) statistical physics, including discrete models, (ii)the structureofnaturalecosystems,(iii)the spreadof and (iii) network theory. Elements of nonlinear dynamics diseasesandinformation,(iv)thestructureofcellularsig- should be familiar to most of the readers of this journal. nalling networks, and (v) infrasrtucture robustness. The one with perhaps the greatest degree of novelty— Finally, in Section 6, we discuss the need for a “new”, because of the recent nature (and the speed) of most of or at very least, expanded definition of the meaning of the significant advances—is network theory. First, how- predictioninthecontextofthestudyofcomplexsystems. ever, we will quickly comment on (i) and (ii). We end with a short discussion on the challenges ahead for researchers from different areas in contributing to the creation of a theory of complex systems. 3.1 Nonlinear dynamics and chaos 2 Challenges in the study of complex systems Nonlinear dynamics and chaos in deterministic systems are now an integral part of science and engineering. The Thechallengesonefaceswhenstudyingacomplexsystem theoretical foundations are on firm mathematical footing occur at various levels: and there are well agreed upon mathematical definitions of chaos,many of them formally equivalent.However,be- The nature of the units—Complexsystems typicallycom- cause of its relative novelty and, in many case, counter- prisealargenumberofunits,however,unlikethesituation intuitivenature,therearestillmanymisconceptionsabout in many physical and chemical problems, the units need chaos and its implications. Extreme sensitivity to initial not to be neither structureless nor identical. conditions does not mean that prediction is impossible. Challenges at the unit level: Memory of initial conditions is lost within attractors but – Units have complex internal structures; theattractoritselfmaybeextremelyrobust.Inparticular – Units are not identical; chaotic does not mean unstable. – Units do not have strictly defined roles. Chaos means that simple systems are capable of pro- ducing complex outputs. Simple 1D mappings can do The nature of the interactions— Complex systems typi- this—the logistic equation being the most celebrated ex- callyhaveunitsthatinteractstrongly,ofteninanonlinear ample. The flip side is that complex looking outputs fashion. Moreover,there are frequently stochastic compo- neednothavecomplexorevencomplicatedorigins;seem- nents to the interaction and external noise acting on the inglyrandom-lookingoutputs canbedue to deterministic system. An additional and crucial challenge is posed by causes. Many techniques have been developed to analyze the fact that the units are connected in a complex web of signals and to determine if fluctuations stem from deter- interactions that may be mostly unknown. ministic components. Challenges at the interaction level: Nonlinear dynamics is now firmly embedded through- – Nonlinear interactions; outresearch;applicationsariseinvirtuallyallbranchesof – Noise; engineering and physics—from quantum physics to celes- – Complex network of interactions. tial mechanics. There are numerous applications in geo- physics, physiology and neurophysiology [3]. Even sub- The nature of the forcing or energy input—Complex sys- applications have developed into full-fledged areas. For tems are typically out-of-equilibrium. For example, living example, mixing is one of the most successful areas of organisms are in a constant struggle with their environ- applications of nonlinear dynamics [4]. ment to remain in a particular out-of-equilibrium state, It is clear that nonlinear dynamics does not exist in namelyalive.Socialandeconomicsystemsarealsodriven isolation but it is now a platform competency in science out-of-equilibriumsystems;anew technologychangesthe and engineering. This does not mean that all theoretical balance of power between companies, a terrorist attack questions have been answered and that all ideas are un- changes economic expectations, etc. controversial. For example there is significant discussion Challenges at the forcing level: aboutthepresenceofchaosinphysicsandthe roleitmay – Poorlycharacterizeddistributionofexternalperturba- play in determining the universe’s “arrow of time”, the tions; irreversible flow from the past to the future. 150 The European Physical Journal B 3.2 Statistical physics: Universality and scaling Of the three revolutionary new areas of physics born at the turn of the 20th century—statistical physics, relativ- ity,andquantummechanics—itisfairtosaythatstatisti- calphysicshasbeentheonethathasleastcaughtpeople’s imagination.The reasonmaybe that,onthe surface,sta- tistical physics most resembles pre-20th century physics. However,statisticalphysicsbroughtthree veryimportant conceptual and technical advances: 1. Itleadtoanewconceptionofprediction(weshallhave more to say about this later in the paper). 2. It circumvented classical mechanics and the impossi- bility to solve the three-body problem by tackling the many-bodyproblem.Indoingso,itcastedsolutionsin terms of ensembles. 3. It introduced the concept of discrete models—ranging from the Ising model to cellular automata [5] and agent-based models [6]. Fig. 2. Visualizing universality. (a) Lascaux cave paint- ings, beginning of Magdalenian Age (approximately 15,000 to In the 1960s and 1970s, fundamental advances oc- 13,000 B.C.); (b) Apis bull, Egypt (3,000–500 B.C.); (c) Bull- curredinourunderstanding ofphase transitionsandcrit- fight: Suerte de vara (detail), Francisco de Goya y Lucientes ical phenomena leading to the development of two im- (1824); oil on canvas (50×61 cm), The J. Paul Getty Mu- portant new concepts: universality and scaling [7,8]. The seum,LosAngeles.Despitethedifferenceindetails,styles,and finding, in physical systems, of universal properties that medium, all images are easily identified as depictions of bulls. are independent of the specific form of the interactions Clearly, all images capture the essential characteristics of the gives rise to the intriguing hypothesis that universal laws animal. However, for a computer program, the task of classi- orresultsmayalsobepresentincomplexsocial,economic fyingthesubjectmatterofallpicturesasbeingidenticalisfar and biological systems (see Fig. 2). from trivial. The concept of universality in statistical physics Indeed, it has recently come to be appreciated that and complex systems may aspires to the same goal as such a many complex systems obey universallaws that are inde- computer program would: to capture the essence of different pendent of the microscopic details: Findings in one sys- systems and to classify them into distinct classes. tem translateinto understanding of the behaviorof many others. For example, fluctuations in physiologic outputs of healthy individuals display universal degree of correla- 3.2.2 Universality tions [9–12], as do fluctuations of financial assets [13–16]. Similarly, it has been recently shown that scaling and universality hold for a broad range of human organiza- Another fundamental concept arising from the study of tions [17–23]. criticalphenomenaisuniversality.Forsystemsinthesame universalityclass,exponentsandscalingfunctionsarethe same in the vicinity of the critical point. This fact sug- 3.2.1 Scaling gests than when studying a given problem, one may pick the most tractable system to study and the results one The scaling hypothesis which arose in the context of the obtainswill holdfor allothersystems inthe same univer- study of critical phenomena led to two categories of pre- salityclass[7,8].Theproblem,clearly,istoidentifywhich dictions,bothofwhichhavebeenremarkablywellverified systems belong to a given universality class. by a wealth ofexperimentaldata on diversesystems.The The universality of critical behavior motivated the firstcategoryis asetofrelations,calledscaling laws, that search for the features of the microscopic inter-particle serve to relate the various critical-point exponents char- force which are important for determining critical-point acterizing the singular behavior of the order parameter exponentsandscalingfunctions,andwhichonesareunim- and of response functions. The second category is data portant. These questions were answered by numerous collapsing. works on the renormalization group [27]. These studies Thepredictionsofthescalinghypothesisaresupported led to the idea that when the scale changes, the equa- byawiderangeofexperimentalwork,andalsobynumer- tions which describe the system also change accordingly ous calculations on model systems. Moreover,the general and that in the macroscopic limit only a few “relevant” principles of scale invariance have proved useful in inter- features remain. When one uncovers universality in a preting a number of other phenomena, ranging from ele- given system, it means that some profound, usually sim- mentary particle physics [24] and galaxy structure [25] to ple, mechanisms are at work. This conceptual framework finance and sociology [11,23,26]. hasguidedmanyphysicistsintoforaysininterdisciplinary L.A.N.Amaral and J.M. Ottino: Complex networks 151 research yielding insights across seemingly dissimilar dis- Other clear-cut examples are the Internet, a network of ciplines. servers,andtheWorldWideWeb,anetworkofwebpages connected by hyperlinks [46–48]. The two limiting network topologies typically con- 3.2.3 Discrete models sidered are: (i) d-dimensional graphs—a lattice, for example—where every node connects with a well-defined Discrete-spaceanddiscrete-timemodelingisbasedonthe setofclosestneighbors,and(ii)randomgraphs,whereev- assumptionthatsomephenomenacanandshouldbemod- ery node has the same probability of being connected to eled directly in terms of computer programs (algorithms) anyothernode.Quantitiesusedtoquantitativelydescribe rather than in terms of equations. Cellular automata— networks include [69]: whichcanbetracedtoJohnvonNeumann[28]andStanis- lawUlam[29]andwerefurtherdevelopedandpopularized – The minimum number of links that must be traversed in Conway’s “game of life” [30] and, more recently, Wol- to travel from node i to node j is called the shortest fram [5]—are the simplest example of discrete time and path length or distance between i and j. A graph is space models that were developed with the computer in connected if any node can be reached from any other mind. node; otherwise the graph is disconnected. The aver- Examples of the application of cellular automata ex- agepathlengthistheaverageoftheminimumnumber ist in physical, chemical, biological and social sciences; of steps necessary to connect any two nodes in a con- they can be as simple as propagation of fire and simple nected network. predator-preymodels betweenahandfulofspeciesandas – The local clustering is (roughly) the number of actual complex as the evolution of artificial societies. The cen- links in a local sub-network divided by the number of tral idea is to have agents that live on the cells of reg- possible links.It quantifies the factthat if PersonA is ular d-dimensional lattices and interact with each other good friend with both B and C, then there is a good according to prescribed rules. The basic building blocks chance B and C are also friends [70]. may be identical or may differ in important characteris- – The degreedistribution, p(k),which is the probability tics;moreoverthesecharacteristicsmaychangeovertime, of finding a node with k links. In a lattice p(k) is a as the agents adapt to their environment and learn from delta-Kroneckerfunctionwhileinarandomgraphitis their experiences—see e.g. Epstein and Axtell [6] in the a Poisson distribution. context of the social sciences. Real networks, however, are not well described by ei- Discrete,oragent-based,modelinghasbeenextremely ther model [31–35,66]. Real networks are both clustered successful because of the intuition-building capabilities it (high degree of local connectivity) and small-worlds (it provides and the speed with which it permits the investi- takes only a small number of steps to connect any two gationofmultiplescenarios.Forthisreasondiscretemod- nodes). eling has led in some cases to a replacement of equation- based approaches in disciplines such as ecology, traffic optimization, supply networks, and behavior-based eco- 4.1 Network theory: A short history nomics. The surge of interest in networks is recent, however, the history of network has a distinguished past: The birth 4 Networks of network (or graph) theory links together two famous mathematicians: Euler and Erdo¨s. The “conception” of Thethirdelementinthetoolboxisnetworks.Anetworkis the theory is universally attributed to Euler [65] and his a systemofnodes with connectinglinks.Once one adopts solution of the celebrated Ko¨nigsberg bridge puzzle. As thisviewpoint,networksappeareverywhere[31–35].Con- stated in Euler’s manuscript: “In the town of K¨onigsberg sider the following examples from the biological science: in Prussia there is an island A, called “Kneiphoff”, with – food webs, a network of species connected by trophic the two branches of the river (Pregel) flowing around it. There are seven bridges, a, b, c, d, e, f, and g, crossing interactions [49–53], – autonomous nervous systems of complex organisms, a the two branches. The question is whether a person can plan a walk in such a way that he will cross each of these network of neurons connected by synapses [54,55], – generegulationnetworks,anetworkofgenesconnected bridges once but not more than once. [...] On the basis of the above I formulated the following very general problem by cross-regulationinteractions [56–58], – protein networks, a network of protein connected by for myself: Given any configuration of the river and the branches into which it may divide, as well as any number participation in the same protein complexes [59–61], – metabolic networks, a network of metabolites con- of bridges, to determine whether or not it is possible to cross each bridge exactly once.” nected by chemical reactions [62–64]. Euler’ssolutionoftheKo¨nigsbergbridgepuzzledevel- Social networks are also ubiquitous [36–43]: Individu- oped naturally from his formulation of the problem, once als exchanging e-mails is one example [44,45]. Person A again showing that formulation of a problem is as impor- sendsande-mailtoB;ifBrepliesAandBareconnected. tant, if not more than, the solution itself. Euler noticed 152 The European Physical Journal B Fig.4. Aminimalmodelforgeneratingsmall-worldnetworks. Fig. 3. The K¨onigsberg bridge puzzle [65]. (a) The town of WattsandStrogatzconstructnetworksthatexhibitthesmall- K¨onigsberg, now Kaliningrad, Russia, had at the time seven world phenomenon by randomizing a fraction p of the links bridges connecting the island of Kneiphoff to the margins of connecting nodes in an ordered lattice. In the case displayed, theriverPregel.(b)Schematicrepresentationoftheareawith the ordered lattice is one-dimensional with 4 connections per the bridges. (c) Euler’s representation of the problem. Euler node.After [70]. realized that physical distance was of no importance in this problem, only topology matters. For this reason the bridges canberepresentedaslinksinagraphconnectingnodesrepre- important results, including the identification of the per- senting thedifferent margins and islands. colation threshold—that is, the average number of links pernodenecessaryinorderforarandomgraphtobefully thatphysicaldistance isofnoimportanceinthis problem connected—orthe typicalnumberofintermediatelinksin and represented the topological constraints of the prob- the shortest path between any two nodes in the graph. lem in the form of a graph—a set of nodes and the set of links connecting pairs of nodes (Fig. 3). Euler divided the nodes into odd and even based on the parity of the 4.2 Small-world networks degree of the node, that is, the number of links directly connected to the node. He then demonstrated that: Kochen and Pool’s work, which was widely circulated in 1. The sum of degrees of the nodes of a graph is even; preprint form before it finally was published in 1981 [66], 2. Every graphmust have an even number of odd nodes. was a precursor to experimental work that lead to the discovery of the so-called six-degrees of separation phe- These results enabled Euler to show that: nomenon, later popularized in a homonym play by John Guare. The six-degree of separation phenomenon is typ- 1. If the number of odd nodes is greater than 2 no Eu- ically referred to in the scientific literature as the small- ler walk exists—a Euler walk being a walk between world phenomenon [67,68]. two arbitrary nodes for which every link in the graph A recurrentcharacteristicof networks in complex sys- appears exactly once; tems is the small-world phenomenon, which is defined by 2. Ifthenumberofoddnodesis2,Eulerwalksexiststart- the co-existence of two apparently incompatible condi- ing at either of the odd nodes; tions,(i)thenumberofintermediariesbetweenanypairof 3. With no odd nodes, Euler walks can start at an arbi- nodes in the network is quite small—typically referred to trary node. asthesix-degreesofseparationphenomenon—and(ii)the Therefore,sinceallfournodesintheK¨onigsbergbridge largelocal“cliquishness”orredundancy ofthe network— problem are odd, Euler demonstrated that there was no i.e.,thelargeoverlapofthecirclesofneighborsoftwonet- solutiontothepuzzle,thatis,therewasnopathtransvers- work neighbors. The latter property is typical of ordered ingeachbridgeonlyonce.Euler’sworkwasofseminalim- lattices,while theformeristypicalofrandomgraphs[69]. portance becauseit identified topologyas the keyissue of Recently,Watts andStrogatz[70]proposedaminimal theproblem,thusenablinghislaterworkontopologyand model for the emergence of the small-world phenomenon the establishment of, e.g. relations among the numbers of in simple networks. In their model, small-world networks edges, vertices and faces of polyhedrons. emerge as the result of randomly rewiring a fraction p of If the conception of network theory is due to Euler, the links in a d-dimensional lattice (Fig. 4). The parame- its “delivery” is due in great part to Erdo¨s. As in Eu- ter p enables one to continuously interpolate between the ler’s case, Erd¨os interest on network theory was initially two limiting cases of a regular lattice (p = 0) and a ran- linked to a social puzzle: What is the structure of social dom graph (p=1). networks? This problem was formalized by Kochen and WattsandStrogatzprobedthestructureoftheirsmall- Pool in the 50’s, leading them to the definition of ran- worldnetworkmodelandofrealnetworksviatwoquanti- dom graphs [66]—graphs in which the existence of a link ties: (i) the mean shortest distance L between all pairs of betweenanypairofnodeshasprobabilityp.Erdo¨s,incol- nodes in the network, and (ii) the mean clustering coeffi- laborationwithR´enyi,pursuedthe theoreticalanalysisof cient C of the nodes in the network. For a d-dimensional the properties of random graphs obtaining a number of lattice one has L ∼ N1/d and C = O(1), where N is the L.A.N.Amaral and J.M. Ottino: Complex networks 153 Fig. 5. Ubiquity of small-world networks. (a) Dependence of LandC onpforthesmall-worldmodelofWattsandStrogatz. Theemergenceof thesmall-world regime isclear for p>0.01, as L(p) quickly converges to the random graph value, while C(p) remains in the ordered graph range. After [70]. (b) De- pendence of L on p for different network sizes. The numerical resultsshow that theemergence of thesmall-world regime oc- cursforavalueofpthatapproacheszeroasN diverges[71,72]. After [72]. number of nodes in the network. In contrast, for a ran- dom graph one has L ∼ lnN and C ∼ 1/N. Figure 5a Fig.6. Ubiquityofscale-freenetworks.Doublelogarithmplot shows the dependence of L and C on p for the for the of (a) the degree distribution of the network of movie-actor small-worldmodelof Watts and Strogatz.The emergence collaborations (each node corresponds to an actor and links ofthesmall-worldregimeisclearforp>0.01,asLquickly between actors indicated that they collaborated on at least convergesto the random graph value, while C remains in onemovie); (b)thedegreedistribution ofthewebpagesin the the ordered graph range, this two characteristics defin- nd.edu domain (each node is a webpage and links between ing a small-worldnetwork.Watts andStrogatz [70]found webpages indicate hyperlinks pointing to the other webpage). After[73].(c)DegreedistributionoftheWWW.Notethetrun- clear evidence of the small-world phenomenon in (a) the cation of the power law regime. After [78]. (d) Distribution of electric-power grid for Southern California, (b) the net- numberofsexualpartnersforSwedishfemalesandmales.Note work of movie-actor collaborations, and (c) the neuronal thepowerlawdecayinthetailsofthedistributions.After[39]. network of the worm C. elegans. A question is prompted by the results of Figure 5a: distributions,i.e.,onecanclearlyidentifyatypicaldegree “Under which conditions does the small-world regime of the nodes comprising the network. emerge?” Specifically, does the small-world behavior Against this theoreticalbackground,Baraba´siand co- emergeforafinitevalueofpwhenN approachesthether- workersfound that a number of real-worldnetworks have modynamic limit? [71]. Numerical results and theoretical a scale-free degree distribution with tails that decay as arguments show that the emergence of the small-world a power law [47,73]. As shown in Figures 6a–c, the net- regime occurs for a value of p that approaches zero as N work of movie-actor collaborations, the webpages in the diverges [71,72]; cf. Figure 5b. The implications of this nd.edu domain, and the power grid of Southern Califor- finding are quite important: Consider a system for which nia,allappearto obeydistributions thatdecayinthe tail there is a finite probability p of random connections. It asa powerlaw [73].Moreover,othernetworkssuchasthe thenfollowsthat independently ofthe value ofp,the net- network of citations of scientific papers also are reported work will be in the small-world regime for systems with to be scale-free [74,75]. size N ∼1/p, the reasonbeing that to have a finite num- Barab´asiandAlbert[73]suggestedthatscale-freenet- ber of random links, i.e., that Np must be of O(1). This works emerge in the context of growing network in which impliesthatmostlargenetworksaresmall-worlds.Impor- new nodes connect preferentially to the most connected tantly, the nodes will be “un-aware” of this fact as the nodes already in the network. Specifically, vast majority of them has no long-rangeconnections [71]. 4.3 Scale-free networks pi(n+1)= (cid:1)ni=−kni0(+n1)ki(n), (1) An important characteristic of a graph that is not taken where n is the time and number of nodes added to the into considerationin the small-world model of Watts and network, n0 is the number of initial nodes in the network Strogatz is the degree distribution, i.e., the distribution at time zero, ki is the degree of node i and pi(n+1) is of number of connections of the nodes in the network. theprobabilityofanewnode,addedattimen+1linking The Erdo¨s-R´enyi class of random graphs has a Poisson to node i. As illustrated in Figure 7, as time ticks by the degree distribution [69], while lattice-like networks have degree distribution of the nodes becomes more and more even more strongly peaked distributions—a perfectly or- heterogeneous since the nodes with higher degree are the dered lattice has a delta-Dirac degree distribution. Sim- most likely to be the ones new nodes link to. ilarly, the small-world networks generated by the Watts Significantly,scale-freenetworksprovideextremely ef- and Strogatz model also have peaked, single-scale,degree ficient communication and navigability as one can easily 154 The European Physical Journal B Fig. 7. Threestagesinthetimeevolutionofaminimalmodel for generating scale-free networks [73]. (a) We start with a network comprising two nodes linked by a bi-directional con- nection (black full line). Then, we add a new node which can linktoeitheroftheexistingnodes(greendashedline).Because both existing nodes have degree one, there is an equal prob- ability of linked to each of them (which is represented by the thicknessofthedashedline).(b)Atthefollowingtimestep,we add a new node to the network. As before, this node can link to any of the existing nodes. However, now the probability of linking to each of the existing nodes is no longer identical be- causeoneofthenodeshashigherdegreethantheothers.(c)As timesgoesby,aheterogeneousdegreedistributionemergesbe- cause nodes with higher degree have a higher probability of Fig.8. Evidenceforexistenceofsinglescalenetworks.(a)De- being linked to new nodes. gree distribution of the nematode C. elegans. Each of the 302 neurons of C. elegans and their connections has been mapped. Note that the plot is semi-logarithmic, so a straight reach any other node in the network by sending infor- lineindicatesanexponentialdependence.After[77].(b)Semi- mation through the “hubs”, the highly-connected nodes. logarithmic plot of the cumulative degree distribution of the The efficiency ofthe scale-freetopologyand the existence powergridofSouthernCalifornia (eachnodeisatransmission of a simple mechanism leading to the emergence of this station and links are power lines connecting the stations). Af- topology led many researchers to believe in the complete ter [77]. (c) Double-logarithmic the degree distribution of the ubiquity of scale-free network. As it often happens, one power grid of Southern California. After [73]. Note that the finds what one is looking for (Figs. 8a–c). powerlawfitprovidesapoordescriptionofthedatawhilethe Note that scale-freenetworksareasubsetofallsmall- exponential fit matches the data remarkably well for all de- gree values. (d) Truncation of scale-free degree of the nodes worldnetworksbecause(i)themeandistancebetweenthe by adding constraints to the model of reference [73]. Effect of nodes in the network increases extremely slowly with the cost of adding links on the degree distribution. These results size of the network [73,76], and (ii) the clustering coeffi- indicate that the cost of adding links also leads to a cut-off cient is larger than for random networks. of the power-law regime in the degree distribution, and that for a sufficiently large cost the power-law regime disappears altogether. After[77]. 4.4 Classes of small-world networks An important aspect question prompted by the work of Barab´asi and Albert is how to connect the findings of Watts and Strogatz on small-world networks with the Cost of adding links and limited capacity—This effect can the new finding of scale-free structures. Specifically, one be illustratedwiththe networkofworldairports.Forrea- may ask “Under what conditions will growing networks sons of efficiency, commercial airlines prefer to have a be scale-free?”or,more to the point, “Under what condi- small number of hubs through which many routes con- tions will the action of the preferential attachment mech- nect. To first approximation,this is indeed what happens anism be hindered?” Recall that preferential attachment for individual airlines, but when we consider all airlines gives rise to a scale-free degree distribution in growing together, it becomes physically impossible for an airport networks [73], hence if preferential attachment is not the to become a hub to all airlines. Due to space and time onlyfactordeterminingthelinkingofincomingnodesone constraints, each airport will limit the number of land- mayobserveothertopologies.Amaralandco-workershave ings/departures per hour, and the number of passengers demonstrated that preferential attachment can be hin- in transit. Hence, physical costs of adding links and lim- dered by at least three classes of factors: ited capacity of a node will limit the number of possible links attaching to a given node [77]. Aging—This effect can be illustrated with the network of actors.Intime,everyactressoractorstopsacting.Forthe Limitsoninformationandaccess—Thiseffectcanbeillus- network, this implies that even a very highly connected tratedwiththeselectionofoutgoinglinksfromawebpage node will eventually stop receiving new links. The node in the world-wide-web:Eventhough there is no meaning- may still be part of the network and contributing to net- ful cost associated with including a hyperlink to a given workstatistics,butitnolongerreceiveslinks.Theagingof webpage in one’s own webpage, there may be constraints thenodesthuslimitsthepreferentialattachmentprevent- effectively blocking the inclusion of some webpages, no ingascale-freedistributionofdegreesfromemerging[77]. matter how popular and well connected they may been. L.A.N.Amaral and J.M. Ottino: Complex networks 155 Anexampleofsuchconstraintsisdistinctinterestareas— a webpage on granular mixing is unlikely to include links to webpages discussing religion [78]. These different constraints can be formalized by adding terms to 1. Specifically, pi(n+1)= (cid:1)ni=−kni0(+n1)fk(i(kni()nf)(,kni(,ni,).,.n.),i,...), (2) wheref(ki(n),n,i,...)isacostfunctionthatmaydepende on the degree of node i, on its age, on time, and on a number of other factors. As can be seen in Figure 8, the presence of constraints leads to a cut-off of the power- law regime in the degree distribution, and that for a suf- Fig. 9. Measuring Internet traffic. (a) Schematic representa- ficiently strong constraints the power-law regime disap- tion of Internet topology. The Internet comprises links and pearsaltogether[77].Empiricaldatasuggesttheexistence nodes (routers and hosts), which are connected in a scale-free ofthreeclassesofsmall-worldnetworks[77]:(a)scale-free structure[46,106].Supposethatonedownloadsafileonaweb networks;(b)broad-scaleortruncatedscale-freenetworks, pageinahostataaa.edufrom ahostinNTTlaboratories. In characterized by a degree distribution that has a power- this case, a connection is established between the two hosts, law regime followed by a sharp cut-off that is not due to and the packets encoding the file travel from the source host the finite size of the network; (c) single-scale networks, to the destination host via routers. The connection is based on a feedback control, so that the duration of the connection characterized by a degree distribution with a fast decay- for transferring the file strongly depends on the current net- ing tail, such as exponential or Gaussian. It is important work traffic conditions; if the network is congested, it takes tonoteagainthatscale-freenetworksaresmall-worldnet- longertofinishthetransfer.(b)Measuringthenumberofcon- works but the inverse may not be true! nections. In the top panel, each line represents a connection passing through the observation link. For example, the first connection starts at 0.5 s (black circle) and finishes at 3.5 s 4.5 Network modelling (open circle). We count the number of connections within a one second interval and obtain a time series of the number of The previous sections merely skim the surface of all the connections (bottom panel). (c) A typical data set, showing workbeingdoneinmodellingthestructureandemergence thenumberof connections between NTTlaboratories and the of complex networks. This is an extremely active field of Internet for each of the 3,600 one second intervals between research with hundreds of papers having been written, 13:00 and 14:00 on July 19, 2001. After [97]. and published, in the last four years. Clearly, this paper is not the forum to discuss in detail all of those mod- due to excess demand, the router will discard incoming elling efforts and we direct the readers to the excellent packets,asituationcorrespondingtocongestion.Arouter reviews [32,34,35,79]and books [31,80] available. can only control incoming traffic by discarding arriving packets, so that in order to know and adjust to the cur- rent network traffic condition, each host has the ability 5 Brief review of a selection of complex to control its traffic by using a feedback-based flow con- systems’ research with a network focus trol [87] for the communication between the sender and the receiver. Even though the rules controlling traffic flow were 5.1 The topology of the Internet and the dynamics programmed by humans, the dynamics of Internet traf- of Internet traffic fic [88–95] are difficult to predict due to the complex in- teractions between routers, the flow control mechanisms, The Internet [81,82]—a large communication network that now connects more than 108 hosts—is a prime ex- and the diversity of applications running in the Internet. Moreover, the traffic flow is also highly correlated with ample of a self-organizing complex system [83–86], hav- human activity. ing grown mostly in the absence of centralized control or direction. In this network, information is transferred in A number of studies has probed the topology of the the form of packets from the sender to the receiver via Internet and its implications for traffic dynamics. It has routers,computerswhicharespecializedto transferpack- been reported that Internet traffic fluctuations are sta- ets to another router “closer” to the receiver (Fig. 9a). A tistically self-similar [88–90] and that the traffic displays router decides the route of the packet using only local in- twoseparatephases,congestedandnon-congested.Atthe formation obtained from its interaction with neighboring point separating the two phases, traffic fluctuations are routers, not by following instructions from a centralized characterizedby 1/f–correlations[91–95]. server.Thus,itcanbeviewedasasimpleandautonomous Fukuda and co-workers recorded every packet flowing entity. A router stores packets in its finite queue and pro- throughthe link between NTT laboratoriesin Tokyo and cesses them sequentially. However, if the queue overflows theInternetduring4daysinJuly2001(Figs.9b,c).They 156 The European Physical Journal B found that time series of number of connections are non- example, the recommended limits on consumption of fish stationary, and are characterized by different mean val- withunacceptable levels ofpollutants, the selectionofar- ues depending on the observation period; the mean num- easforestablishmentofprotectedecosystems,ortheman- ber of connections is ≈50 connections/s during the night, agementofboundaryareasbetweenprotectedecosystems and ≈700 connections/s during the day. Moreover, they and agro-businesses. found that the distribution of durations of stationary pe- The study of such questions is extremely challeng- riods [96] display tails decaying as power-laws for both ing for a number of reasons. First, the characterization night and day—implying that the duration of stationary of the topology of a given ecosystem is a very cumber- periods has no typical scale [97]. some and expensive task, which a priori may be of value Eriksen et al. [98] studied the spectral properties of only for the particular environment considered. Second, a diffusion process taking place on the Internet network the precise modelling of the nonlinear interactions be- focusing onthe slowestdecayingmodes. These modes en- tween the numerous individuals belonging to each of the abled them to identify modules in the topology of the many species comprising the ecosystem and their separa- Internet. Eriksen et al. were able to map those modules tion from stochastic external variables (such as the cli- to individual countries. For example, the slowest decay- mate) affecting the ecosystem may be impossible. ing mode corresponds to a diffusion current flowing from Recently, Amaral and co-workers studied the topology Russia to US military sites [98]. of food webs from a number of distinct environments— Barth´el´emy et al. analyzed data from the French na- including freshwater habitats, marine-freshwater inter- tional “Renater” network which comprises 30 intercon- faces, deserts, and tropical islands—and found that this nected routers located in difference regions of France and topology may be identical across environments and de- is used by approximately 2 million individuals [99]. They scribed by simple analytical expressions [51,52,108].This found that the Internet flow is strongly localized: most finding is demonstrated in Figure 10, where, as an ex- of the traffic takes place on a spanning network connect- ample,wepresentthedistributionsofnumberofpreyand ing a small number of routers which can be classified ei- numberofpredatorsforthespeciescomprisingtwelvedis- ther as “activecenters,”whichare gatheringinformation, tinct food webs [108]. or “databases,” which provide information. Interestingly, In the same spirit, a recent paper in Nature reports Barth´el´emy and co-workers also found that the Internet ona study of food webs as transportationnetworks[109]. activityofaregionincreaseswiththenumberofpublished The underlying idea is that the directionality of the links papers by laboratories of that region [99]. (pointingfrompreytopredator)definesa“flow”ofresour- A number of groups have also demonstrated that the ces—energy, nutrients, prey—between the nodes of the Internetdisplaysanumberofpropertiesthatdistinguishes network.Becauseeveryspeciesfeedsdirectlyorindirectly it from random graphs: wiring redundancy and cluster- onenvironmentalresources,foodwebsareconnected(that ing, [46,100–102], non-trivial eigenvalue spectra of the is, every species can be reachedby starting from an addi- connectivity matrix [46], and a scale-free degree distribu- tional “source” node representing the environment. This tion [46,101–104]. fact enabled Garlaschelli et al. [109] to define a spanning Vespignani, Pastor-Satorras and collaborators under- tree on any food web—i.e., a loop-less subset of the links took a systematic study of the evolution of the topology ofthewebsuchthat,startingfromtheenvironment,every of the Internet by analyzing Internet maps collected by species can be reached. Importantly, they find that those the National Laboratory for Applied Network Research spanningtrees arecharacterizedby universalscalingrela- (NLANR) for the period 1997–2000 [105]. Their stud- tions. ies demonstrated that most quantities characterizing the These results are of great practical and fundamen- topology of the network have reached stationary values tal importance because they support the hypothesis that and that the Internet has an hierarchical structure re- scaling and universality hold for ecosystems—i.e., food flected in non-trivial scale-free betweenness and degree webs display universal patterns in the way trophic rela- correlationsfunctions[106].Theyalsofoundthatthetime tionsareestablisheddespiteapparentlysignificantlydiffer- evolution of the Internet topology reveals the presence of ences in factors such as environment (e.g. marine versus growth dynamics with aging features [107]. terrestrial), ecosystem assembly, and past history. This fact suggests that a general treatment of the problems considered in environmental engineering, with reasonable 5.2 The topology of natural ecosystems caveats,may be within reach. Species in natural ecosystems are organized into complex webs [49]. Ecologists have studied these webs from the 5.3 Spread of epidemics in complex networks perspectiveofnetworktheory.Everyspeciesintheecosys- tem being a node in a network and the existence of a trophic link—i.e., a prey-predator relationship—between Someinfectiousagentsarebeneficial—thespreadofideas, two species indicating the existence of a directed link be- technologies, or domesticated animals and some kinds of tweenthem.Wearefarfromthisideal,butunderstanding plants. Others clearly are not: human or animal infec- the structure of these food webs should be of fundamen- tious diseases [26,110], email virus and other computer tal importance in guiding policy decisions concerning, for virus [111,112]. A third class may involve those with no
Description: