Skip to main content
Fig. 1 | BMC Bioinformatics

Fig. 1

From: A new method to measure complexity in binary or weighted networks and applications to functional connectivity in the human brain

Fig. 1

Panel a Sierpiński triangle F in the plane. Panel b Extended counting method for F. The scales e 1 and e w for the fine grid and the sliding window (thick frames) are indicated. The window with the maximum number of fine grid boxes intersecting F determines the complexity of the fractal (x-dim). Panels c and d show a fractal graph G with a submaximum (c) and a maximum (d) highlighted k-clique (thick red). The cardinality of a maximum k-clique determines the complexity of G (Ndim(G))

Back to article page