This preview shows page 1. Sign up to view the full content.
Unformatted text preview: nected to vertex i
Cli (g ) =
.
number of triples centered at i
The average clustering coeﬃcient is Cl Avg (g ) = 1
n ∑i Cli (g ). Figure: The overall clustering coeﬃcient for this network is 3/8. The individual
clustering for the nodes are 1, 1, 1/6, 0, and 0. What is the individual clustering for a node in the Erd¨sRenyi model? o
16 Networks: Lecture 2 Properties of Networks Centrality
A micro measure that captures the importance of a node’s position in
the network.
Diﬀerent measures of centrality
Degree centrality: for node i ,
di (g )/n − 1, where di (g ) is the degree of node i Closeness centrality: Tracks how close a given node is to any other
node: for node i , one such measure is
n−1
,
∑ j � =i l (i , j ) where l (i , j ) is the distance between i and j Betweenness centrality: Captures how well situated a node is in terms
of paths that it lies on (see the Florentine marriages example from the
previous lecture). 17 Networks: Lecture 2 Properties of Networks Deg...
View
Full
Document
This document was uploaded on 03/18/2014 for the course EECS 6.207J at MIT.
 Fall '09
 Acemoglu

Click to edit the document details