Spectral Complexity of Directed Graphs and Application to Structural Decomposition

Figure 4

Complexity computed using (2) (red), second term in (2) (blue), and first term in (2) (green) as a function of the average degree of the graph. Each graph has 1000 nodes.