Reduced graphs obtained by representing communities by a single node, and collapsing all edges between nodes in different communities onto a single, weighted edge. Communities with fewer than 5 neurons are not shown. We re-ran the clustering algorithm with chi = 0.0, 0.05, 0.1 producing results shown in panels from top to bottom, respectively. Thickness of edges corresponds to weighted edge density, defined as the total weight of the edges connecting nodes in one cluster to nodes in another, divided by the number of possible edges between the two clusters. The gray border loops represent the connections between nodes within the cluster. The strength of within-community connections is orders of magnitude stronger than between communities.