cs224 lecture2

Network diameter:
diameter: The maximum (shortest path) distance between any pair of nodes in a graph
Average path length: The average path length for a connected graph or a strongly connected graph

Clustering coefficient:


average clustering coefficient:
Connectivity:
size of largest connected component

Random Graph Model



然而随即图并不能很好的模拟现实生活中的图, which is high clustering but low path length.

Kronecker Graph Model