< Back to Article

Compression-based inference of network motif sets

Fig 5

Topological properties of motif sets.

Graph measures averaged over the inferred graphlet multiset, , i.e., for a network measure φ, one point corresponds to the quantity . The density (A), reciprocity (B) and number of cycles (C) and are standard properties of directed networks [75]. The graph polynomial root (D) measures the structural symmetry of the motifs [74]. Details can be found in S6 Text. Red squares indicate averages over the connectomes’ inferred motif sets. Blue squares are reference values, computed from average over randomized graphlets with their density conserved. To obtain the fixed-density references per motif set, we generate for each graphlet a collection of a hundred randomized configurations sharing the same density. The black dots of panel (A) show the connectomes’ global density.

doi: https://doi.org/10.1371/journal.pcbi.1012460.g005