lecture2 notes

# If the network is not connected one often checks the

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Average path length is bounded from above by the diameter; in some cases, it can be much shorter than the diameter. If the network is not connected, one often checks the diameter and the average path length in the largest component. 14 Networks: Lecture 2 Properties of Networks Clustering Measures the extent to which my friends are friends with one another. This clustering measure is represented by the overall clustering coeﬃcient Cl (g ), given by Cl (g ) = 3 × number of triangles in the network , number of connected triples of nodes where a “connected triple” refers to a node with edges to an unordered pair of nodes. Note that 0 ≤ Cl (g ) ≤ 1. Cl (g ) measures the fraction of triples that have their third edge ﬁlled in to complete the triangle. Also referred to as network transitivity: measures the extent that a friend of my friend is also my friend. 15 Networks: Lecture 2 Properties of Networks Clustering (Continued) Another measure of clustering is deﬁned on an individual node basis: The individual clustering for a node i is number of triangles con...
View Full Document

## This document was uploaded on 03/18/2014 for the course EECS 6.207J at MIT.

Ask a homework question - tutors are online