So far, in all the recipes in this chapter, we have learned how to find out the statistical properties of the nodes in a graph, as well as of the overall graph. Gephi also provides metrics that can be run against a graph to understand the statistical properties of its nodes. In this recipe, some of these metrics, the average clustering coefficient and eigenvector centrality to be precise, are covered.
To find the average clustering coefficients and eigenvector centralities for nodes in a graph, follow these steps:
Load the undirected version of the Les Misérables network in Gephi.
In the Statistics panel, under the Node Overview tab, click on Run against Avg. Clustering Coefficient. This opens up the Clustering Coefficient settings window. Select which network version—Directed or UnDirected—you want to use to find the average clustering coefficient:
Hit OK. This opens up the Clustering Coefficient Metric Report window, which displays the average...
