More than Just Lines on a Map: Best Practices for U.S Bike Routes
CSE5656 Complex Networks - Clustering
1. Clustering Coefficient
Given a graph G with n vertices, the clustering coefficient can be
computed as:
•RATIO OF MEANS
!!!
if Li is the number of links of vertex i, then:
!!
•MEAN OF RATIOS
!!!
if Li is the number of links of vertex i, L is the number of links in the
subgraph GN containing vertex i and its neighbors, and N is the
number of neighbors of vertex i, then:
!!
2. Graphs 1 and 2
if we enumerate vertices clockwise, starting from the top-left corner:
if we enumerate vertices by rows, from top to bottom (note that there are no
triangles, so C = 0 either way):
3. Graphs 3 and 4
if we enumerate vertices by row, from top to bottom:
if we enumerate vertices by row, from top to bottom: