Lecture 3:
1. Number of vertices, Number of edges, Density,
2. Average degree
3. Global clustering coefficient, Node triangle participation
4. Components
a. Size of the giant component
b. Weakly connected, strongly connected, in-component, out-component,
bow-tie
c. Bi-connectivity, bi-connected components, cut-points
5. Distance based characteristics
a. Characteristic path length = average distance
i. 6 degrees of separation
b. Diameter
c. Hop-plot
6. Degree distribution, power law, ‎scale-free networks,‎
a. Distribution, cumulative distribution
b. Log-plot, log-log-plot,
c. Power law exponent
d. First/second moment of degree distribution, degree variance, average
degree
e. Universality of power law exponent
7. Percolation
a. Percolation threshold
b. Reverse percolation
c. Random damage, targeted attacks