Metrics 2/3 Clustering  Indicates whether two neighbors of the same node are also connected with each other  Clustering coefficient for each node i is: Assortativity coefficient  In real networks the degrees in the endpoints of any edge tend not to be independent  This feature can be captured by computing the assortativity coefficient:  Where m is the average degree of the graph
{}