Unformatted text preview: use the notation G (n, p ) to denote the undirected Erd¨sRenyi
o
graph.
Every edge is formed with probability p ∈ (0, 1) independently of
every other edge.
Expected degree of a node i is E[di ] = (n − 1)p 13 Networks: Lecture 2 Properties of Networks Properties of Networks
While a small network can be visualized directly by its graph (N , g ),
larger networks can be more diﬃcult to envision and describe.
Therefore, we deﬁne a set of summary statistics or quantitative
p erformance measures to describe and compare networks (focus on
undirected graphs):
Diameter and average path length
Clustering
Centrality
Degree distributions A Simple Random Graph Model—Erd¨sRenyi model
o
We use the notation G (n, p ) to denote the undirected Erd¨sRenyi
o
graph.
Every edge is formed with probability p ∈ (0, 1) independently of
every other edge.
Expected degree of a node i is E[di ] = (n − 1)p
Expected number of edges is E[number of edges] =
13 Networks: Lecture 2 Properties of Networks Properties of Networks
While a small network can be visualized d...
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