Download presentation

Presentation is loading. Please wait.

Published byEvan Corbett Modified over 4 years ago

2
Networks, Complexity and Economic Development Characterizing the Structure of Networks Cesar A. Hidalgo PhD

3
Over 3 billion documents R. Albert, H. Jeong, A-L Barabasi, Nature, 401 130 (1999). WWW Expected P(k) ~ k - Found Scale-free Network Exponential Network

4
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.

5
Local Measures

6
CENTRALITY MEASURES Measure the importance of a node in a network.

8
8 Rod Steiger Click on a name to see that person's table. Steiger, RodSteiger, Rod (2.678695) Lee, Christopher (I)Lee, Christopher (I) (2.684104) Hopper, DennisHopper, Dennis (2.698471) Sutherland, Donald (I)Sutherland, Donald (I) (2.701850) Keitel, HarveyKeitel, Harvey (2.705573) Pleasence, DonaldPleasence, Donald (2.707490) von Sydow, Maxvon Sydow, Max (2.708420) Caine, Michael (I)Caine, Michael (I) (2.720621) Sheen, MartinSheen, Martin (2.721361) Quinn, AnthonyQuinn, Anthony (2.722720) Heston, CharltonHeston, Charlton (2.722904) Hackman, GeneHackman, Gene (2.725215) Connery, SeanConnery, Sean (2.730801) Stanton, Harry DeanStanton, Harry Dean (2.737575) Welles, OrsonWelles, Orson (2.744593) Mitchum, RobertMitchum, Robert (2.745206) Gould, ElliottGould, Elliott (2.746082) Plummer, Christopher (I)Plummer, Christopher (I) (2.746427) Coburn, JamesCoburn, James (2.746822) Borgnine, ErnestBorgnine, Ernest (2.747229) Hollywood Revolves Around

9
XXX Most Connected Actors in Hollywood (measured in the late 90s) A-L Barabasi, Linked, 2002 Mel Blanc 759 Tom Byron 679 Marc Wallice 535 Ron Jeremy 500 Peter North 491 TT Boy 449 Tom London 436 Randy West 425 Mike Horner 418 Joey Silvera 410

10
DEGREE CENTRALITY K= number of links Where A ij = 1 if nodes i and j are connected and 0 otherwise

11
BETWENNESS CENTRALITY BC= number of shortest Paths that go through a node. A BH I J K D G E C F BC(G)=0 N=11 BC(D)=9+1/2=9.5BC(B)=4*6=24BC(A)=5*5+4=29

12
CLOSENESS CENTRALITY C= Average Distance to neighbors A BH I J K D G E C F N=11 C(G)=1/10(1+2*3+2*3+4+3*5) C(G)=3.2 C(A)=1/10(4+2*3+3*3) C(A)=1.9 C(B)=1/10(2+2*6+2*3) C(B)=2

13
EIGENVECTOR CENTRALITY Consider the Adjacency Matrix A ij = 1 if node i is connected to node j and 0 otherwise. Consider the eigenvalue problem: Ax= x Then the eigenvector centrality of a node is defined as: where is the largest eigenvalue associated with A.

14
PAGE RANK PR=Probability that a random walker with interspersed Jumps would visit that node. PR=Each page votes for its neighbors. A EF G H I B K C J D PR(A)=PR(B)/4 + PR(C)/3 + PR(D)+PR(E)/2 A random surfer eventually stops clicking PR(X)=(1-d)/N + d( PR(y)/k(y))

15
PAGE RANK PR=Probability that a random Walker would visit that node. PR=Each page votes for its neighbors.

16
CLUSTERING MEASURES Measure the density of a group of nodes in a Network

17
Clustering Coefficient A BH I J K D G E C F C i =2 /k(k-1) C A =2/12=1/6 C C =2/2=1C E =4/6=2/3

18
Topological Overlap Mutual Clustering A BH I J K D G E C F TO(A,B)=Overlap(A,B)/NormalizingFactor(A,B) TO(A,B)=N(A,B)/max(k(A),k(B)) TO(A,B)=N(A,B)/ (k(A)xk(B)) 1/2 TO(A,B)=N(A,B)/min(k(A),k(B)) TO(A,B)=N(A,B)/(k(A)+k(B))

19
Topological Overlap Mutual Clustering A BH I J K D G E C F TO(A,B)=N(A,B)/max(k(A),k(B)) TO(A,B)=0 TO(A,D)=1/4 TO(E,D)=2/4

20
MOTIFS

21
Motifs

23
Structural Equivalence

24
Global Measures

25
The Distribution of any of the previously introduced measures

27
Giant Component Components S=NumberOfNodesInGiantComponent/TotalNumberOfNodes

28
Diameter

29
A BH I J K D G E C F Diameter= Maximum Distance Between Elements in a Set Diameter= D(G,J)=D(C,J)=D(G,I)=…=5

30
A B D G E C F Average Path Length A B C D E F G ABCDEFGABCDEFG 1 2 1 1 1 2 3 2 2 2 3 1 1 3 2 1 2 1 2 2 3 D(1)=8 D(2)=9 D(3)=4 L=(8+2x9+3x4)/(8+9+4) L=1.8

31
Degree Correlations Are Hubs Connected to Hubs?

32
Phys. Rev. Lett. 87, 258701 (2001)

36
Wait: are we comparing to the right thing

38
Compared to what? Randomized Network A B H I J K D G E C F A B H I J K D G E C F A B H I J K D G E C F

39
Internet Randomized Network Physica A 333, 529-540 (2004)

40
Connectivity Pattern/RandomizedZ-score Connectivity Pattern/Randomized

42
Data Models

43
After Controlling for Randomized Network Data Models

44
Fractal Networks

45
Mandelbrot BB

46
Generating Koch Curve Measuring the Dimension of Koch Curve

49
White Noise Pink Noise Brown Noise

51
Attack Tolerance Fractal Network Non Fractal Network

52
Take Home Messages -To characterize the structure of a Network we need many different measures -This measures allow us to differentiate between the different networks in nature Today we saw: Local Measures Centrality measures (degree, closeness, betweenness, eigenvector, page-rank) Clustering measures (Clustering, Topological Overlap or Mutual Clustering) Motifs Global Measures Degree Correlations, Correlation Profile. Hierarchical Structure Fractal Structure Connections Between Local and Global Measures

Similar presentations

OK

Importance Measures on Nodes Lecture 2 Srinivasan Parthasarathy 1.

Importance Measures on Nodes Lecture 2 Srinivasan Parthasarathy 1.

© 2018 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google