Relatively HIGH Clustering Coefficient Relatively LOW Characteristic Path Length
Measure of degree to which vertices in a graph tend to cluster together If A is connected to B and B is connected to C, then theres a heightened probability that A is connected to C.
C = Where: triangles are K graphs connected triples are nonisomorphic paths of length two 3
One Triangle 8 Connected Triples So the Clustering Coefficient is 3/8.
The average number of steps along the shortest paths for all possible pairs of vertices in the graph The median of the means of shortest distances between all pairs of vertices
First, find the distances between all the vertices and each average length. A – 1, 1, 2, 2 mean(A) = 6/4 B – 1, 1, 2, 2mean(B) = 6/4 C – 1, 1, 1, 1mean(C) = 4/4 D – 1, 2, 2, 2mean(D) = 7/4 E – 1, 2, 2, 2mean(E) = 7/4 Next, take the median of the averages. Median ( 4/4, 6/4, 6/4, 7/4, 7/4 ) = 6/4 A C D B E So, the Characteristic Path Length of this graph is 6/4.
Your consent to our cookies if you continue to use this website.