Fig. 2

Information graph. The edge between the node \(G_i\) and node \(G_j\) is connected if the information-content of both \(G_i\) and \(G_j\) is more than a certain threshold
Information graph. The edge between the node \(G_i\) and node \(G_j\) is connected if the information-content of both \(G_i\) and \(G_j\) is more than a certain threshold