Presentation is loading. Please wait.

Presentation is loading. Please wait.

Networks, Complexity and Economic Development Class 2: Scale-Free Networks Cesar A. Hidalgo PhD.

Similar presentations


Presentation on theme: "Networks, Complexity and Economic Development Class 2: Scale-Free Networks Cesar A. Hidalgo PhD."— Presentation transcript:

1

2 Networks, Complexity and Economic Development Class 2: Scale-Free Networks Cesar A. Hidalgo PhD

3 Erdös-Rényi model (1960) Lattice Poisson distribution WATTS & STROGATZ

4 High school friendship James Moody, American Journal of Sociology 107, 679-716 (2001)

5 High school dating network Data: Peter S. Bearman, James Moody, and Katherine Stovel. American Journal of Sociology 110, 44-91 (2004) Image: M. Newman

6 6 Previous Lecture Take Home Messages NETWORKS -Networks can be used to represent a wide set of systems -The properties of random networks emerge suddenly as a function of connectivity. -The distance between nodes in random networks is small compared to network size L log(N) -Networks can exhibit simultaneously: short average path length and high clustering (SMALL WORLD PROPERTY) -The coexistence of these last two properties cannot be explained by random networks -The small world property of networks is not exclusive of social networks. BONUS -Deterministic Systems are not necessarily predictable. -But you shouldnt always blame the butterfly.

7 Degree (k) P(k) k Degree Distribution

8 The Crazy 1990s

9

10 Internet www Autonomous System i.e. Harvard.edu

11 "On Power-Law Relationships of the Internet Topology", Michalis Faloutsos, Petros Faloutsos, Christos Faloutsos, ACM SIGCOMM'99, Cambridge, Massachussets,pp 251-262, 1999

12 Internet-Map

13 Over 3 billion documents ROBOT: collects all URLs found in a document and follows them recursively Nodes: WWW documents Links: URL links R. Albert, H. Jeong, A-L Barabasi, Nature, 401 130 (1999). WWW Expected P(k) ~ k - Found Scale-free Network Exponential Network

14

15 Coauthorship Nodes: scientist (authors) Links: write paper together (Newman, 2000, A.-L. B. et al 2001) SCIENCE COAUTHORSHIP

16 SCIENCE CITATION INDEX ( = 3) Nodes: papers Links: citations (S. Redner, 1998) P(k) ~k - 1078... 25 H.E. Stanley,... 1736 PRL papers (1988) Citation

17 Swedish sex-web Nodes: people (Females; Males) Links: sexual relationships Liljeros et al. Nature 2001 4781 Swedes; 18-74; 59% response rate.

18 Metabolic Network Nodes : chemicals (substrates) Links : bio-chemical reactions Metab-movie

19 Metabolic network Organisms from all three domains of life have scale-free metabolic networks! H. Jeong, B. Tombor, R. Albert, Z.N. Oltvai, and A.L. Barabasi, Nature, 407 651 (2000) Archaea Bacteria Eukaryotes Meta-P(k)

20 Protein interaction network H. Jeong, S.P. Mason, A.-L. Barabasi, Z.N. Oltvai, Nature 411, 41-42 (2001) Prot P(k) Nodes: proteins Links: physical interactions (binding)

21 2,800 Y2H interactions 4,100 binary LC interactions (HPRD, MINT, BIND, DIP, MIPS) Human Interaction Network Rual et al. Nature 2005; Stelze et al. Cell 2005

22

23 Scale-free model Barabási & Albert, Science 286, 509 (1999) BA model (1) Networks continuously expand by the addition of new nodes WWW : addition of new documents Citation : publication of new papers GROWTH: add a new node with m links PREFERENTIAL ATTACHMENT: the probability that a node connects to a node with k links is proportional to k. (2) New nodes prefer to link to highly connected nodes. WWW : linking to well known sites Citation : citing again highly cited papers Web application: http://www-personal.umich.edu/~ladamic/NetLogo/PrefAndRandAttach.html

24 Mean Field Theory γ = 3, with initial condition A.-L.Barabási, R. Albert and H. Jeong, Physica A 272, 173 (1999) MFT

25 Model A growth preferential attachment Π(k i ) : uniform

26 Model B growth preferential attachment P(k) : power law (initially) Gaussian

27

28 Yule process Price Model

29

30 Lada A Adamic, Bernardo A Huberman Technical Comments Power-Law Distribution of the World Wide Web Science 24 March 2000: Vol. 287. no. 5461, p. 2115 DOI: 10.1126/science.287.5461.2115a WWW A-L Barabasi, R Albert, H Jeong, G Bianconi Technical Comments Power-Law Distribution of the World Wide Web Science 24 March 2000: Vol. 287. no. 5461, p. 2115 DOI: 10.1126/science.287.5461.2115a Movie Actors

31 Can Latecomers Make It? Fitness Model SF model: k(t)~t ½ (f irst mover advantage) Real systems: nodes compete for links -- fitness Fitness Model: fitness ( k(,t)~t where = C G. Bianconi and A.-L. Barabási, Europhyics Letters. 54, 436 (2001).

32

33 Local Rules Random Walk Model qeqe A Vazquez Growing network with local rules: Preferential attachment, clustering hierarchy, and degree correlations Physical Review E 67, 056104 (2003) 1-q e qvqv

34 The easiest way to find a hub? Ask for a friend!!! Pick a random person and ask that person to name a friend.

35 Pick a link! Distribution of degrees on the edge of a link is = kP(k) P(k)=1/k Picking a link and looking for a node at the edge of it gives you a uniform distribution of degrees!

36 More models R. Albert, A.-L. Barabasi, Rev. Mod. Phys 2002

37 Why scale-free? F(ax)=bF(x) What functions satisfy this functional relationship? F(x)=x P (ax) P =a P x P =bx p

38

39 Tokyo~30 million in metro area New York~18 million in metro area Santiago ~ 6 million metro area Curico~100k people

40 Size of Cities Number of Cities Tokyo 30 million New York, Mexico City 15 million 4 x 8 million cities 16 x 4 million cities P 1/x There is an equivalent number of people living in cities of all sizes!

41 $50 billion After Bill enters the arena the average income of the public ~ 1,000,000

42 Power laws everywhere Power-law distributions in empirical dataPower-law distributions in empirical data, Aaron Clauset, Cosma Rohilla Shalizi, and M. E. J. Newman, submitted to SIAM Review.

43 Power laws everywhere Power-law distributions in empirical dataPower-law distributions in empirical data, Aaron Clauset, Cosma Rohilla Shalizi, and M. E. J. Newman, submitted to SIAM Review.

44

45

46 Power-Laws are dominated by largest value AVERAGES

47 Power-Laws are dominated by largest value MEDIANS

48 Power-Laws are dominated by largest value COMPARING MEDIANS AND AVERAGES

49 Power-Laws have diverging VARIANCE

50

51 F=-GMm/r 2

52

53

54 Self-Organized Criticality Bak, P.Bak, P., Tang, C. and Wiesenfeld, K. (1987). "Self-organized criticality: an explanation of 1 / f noise". Physical Review Letters 59: 381–384.Tang, C.Wiesenfeld, K.Physical Review Letters

55

56 Robustness Complex systems maintain their basic functions even under errors and failures (cell mutations; Internet router breakdowns) node failure fcfc 01 Fraction of removed nodes, f 1 S Robustness

57 Robustness of scale-free networks 1 S 0 1 f fcfc Attacks 3 : f c =1 (R. Cohen et al PRL, 2000) Failures Robust-SF Albert, Jeong, Barabasi, Nature 406 378 (2000) C

58 Achilles Heel of complex networks Internet failure attack Achilles Heel R. Albert, H. Jeong, A.L. Barabasi, Nature 406 378 (2000)

59

60 SIS Model (compartmental model) ds/dt = -asi+bi di/dt =asi-bi ds/dt = -rsi+i di/dt =rsi-i r=a/b S+I=1 di/dt =r(1-i)i-i di/dt =ri-ri 2 -i di/dt=i(r-ri-1) di/dt=0 i=1-1/r

61 r= 1 dS/dt > 0 dI/dt <0 dS/dt < 0 dI/dt > 0 Epidemic Threshold I Stable solution Unstable solution I=1-1/r

62 R. Pastor-Satorras and A. Vespignani. Epidemic spreading in scale-free networks. Physical Review Letters 86, 3200-3203 (2001). di k /dt =-i k +rk(1-i k ) i k P(k,k) di k /dt =-i k +rk(1-i k ) i k =rk /(1+rk ) (1) k -1 i k kP(k) (2) (1) (2) k -1 kP(k) rk /(1+rk ) We now have many compartments S k, I k

63 k -1 kP(k) rk /(1+rk )=f( ) f f f f df/d | =0 1 r k 2 k 1 r k k 2 R. Pastor-Satorras and A. Vespignani. Epidemic spreading in scale-free networks. Physical Review Letters 86, 3200-3203 (2001).

64 rcrc Infected There is no epidemic threshold!!!

65 Take home messages -Networks might look messy, but are not random. -Many networks in nature are Scale-Free (SF), meaning that just a few nodes have a disproportionately large number of connections. -Power-law distributions are ubiquitous in nature. -While power-laws are associated with critical points in nature, systems can self-organize to this critical state. - There are important dynamical implications of the Scale-Free topology. -SF Networks are more robust to failures, yet are more vulnerable to targeted attacks. -SF Networks have a vanishing epidemic threshold.

66

67

68 Generating Koch Curve Measuring the Dimension of Koch Curve

69

70

71 White Noise Pink Noise Brown Noise

72 Extra Bonus Mandelbrot and Julia Set

73 X n+1 =X n 2 +C (Mandelbrot set X 0 =0) Main Bulb Decoration Antenna

74


Download ppt "Networks, Complexity and Economic Development Class 2: Scale-Free Networks Cesar A. Hidalgo PhD."

Similar presentations


Ads by Google