Fig 1.
Snapshots on the shrub-like structure of the Budapest Reference Connectome Server v2.0.
The edges of the smallest graph can be identified easily with using the webserver. For example, the edges that are present in all braingraphs include edges between Right-Caudate and Right-Pallidium, Left-Thalamus-Proper and Brain-Stem, Right-Thalamus Proper and Right-Putamen.
Fig 2.
The comparison of the random simulation and the real buildup of the edges in the Budapest Reference Connectome server v3.0.
Fig 3.
A very small detail from the large component-tree, available at http://pitgroup.org/static/graphmlviewer/index.html?src=connectome_dynamics_component_tree.graphml.
Fig 4.
Let Gk + 1 denote the consensus connectome where each edge is present in at least k+1 graphs, and let Gk denote the consensus connectome where each edge is present in at least k graphs.
Both Gk+1 and Gk have the same set of vertices, all the edges of Gk+1 are also the edges of Gk, but Gk typically has more edges than Gk+1. The (v, u) edge is directed from v to u, if v is not connected to any other vertices in Gk+1, and becomes connected to a vertex u in Gk, where u was connected to other vertices in Gk+1. Then we direct this (v, u) edge from v to u.