Volumetric brain reconstructions provide an unprecedented opportunity to gain insights into the complex connectivity patterns of neurons in an increasing number of organisms. Here, we model and quantify the complexity of the resulting neural connectomes in the fruit fly, mouse, and human and unveil a simple set of shared organizing principles across these organisms. To put the connectomes in a physical context, we also construct contactomes, the network of neurons in physical contact in each organism. With these, we establish that physical constraints—either given by pairwise distances or the contactome—play a crucial role in shaping the network structure. For example, neuron positions are highly optimal in terms of distance from their neighbors. Yet, spatial constraints alone cannot capture the network topology, including the broad degree distribution. Conversely, the degree sequence alone is insufficient to recover the spatial structure. We resolve this apparent mismatch by formulating scalable maximum entropy models, incorporating both types of constraints. The resulting generative models have predictive power beyond the input data, as they capture several additional biological and network characteristics, like synaptic weights and graphlet statistics.

We investigate the interplay of the spatial and topological structure of millimeter-scale neural connectomes in fly, mouse, and human. As a spatial observation, we demonstrate that the probability of synaptic connection decays exponentially with distance. Additionally, we show that the wiring length in neural connectomes is highly optimal. To quantify the physical constraints on synapse formation, we construct the physical contact network for each organism and demonstrate that contact edge probability follows the same exponential functional form as the connectome. At the same time, we show that spatial constraints are necessary but not sufficient to reconstruct the connectome topology. We present maximum-entropy models capturing key spatial and topological aspects of the connectomes and demonstrate their predictive power beyond the input data.

Network representations of the brain offer a key to relating its multiscale structure to its dynamics and function (D. L. Barabási et al., 2023; Bassett & Sporns, 2017; Telesford, Simpson, Burdette, Hayasaka, & Laurienti, 2011). The widespread availability of the data at the scale of interregional and interareal connections (Chiang et al., 2011; Kötter, 2004; Lanciego & Wouterlood, 2011; Markov et al., 2014; Oh et al., 2014; Scannell, Blakemore, & Young, 1995; Zingg et al., 2014) made it possible to distill fundamental design principles of brain organization (Betzel, Griffa, Hagmann, & Mišić, 2019; Bullmore & Sporns, 2009, 2012; Horvát et al., 2016). Such macroscopic and mesoscopic networks must emerge from cellular-level synaptic networks—neural connectomes. Yet, up until recently, analyses of neural connectomes have been severely limited in their scope (Bassett et al., 2010; Chen, Hall, & Chklovskii, 2006; Gushchin & Tang, 2015; Maertens, Schöll, Ruiz, & Hövel, 2021; Y. Song, Zhou, & Li, 2021; Yan et al., 2017). The advent of volumetric brain reconstructions opens the possibility to map and model brain networks in a bottom-up manner (Haber, Wanner, Friedrich, & Schneidman, 2023; Lynn, Holmes, & Palmer, 2024b). Recent advances and major collaborative efforts in experimental, image analysis, and machine learning techniques have led to an unprecedented amount of nanometer-resolution brain datasets that span a variety of organisms (Dorkenwald et al., 2024; Helmstaedter, 2013; Hildebrand et al., 2017; Motta et al., 2019; Winding et al., 2023).

Here, we aim to quantify and compare the neural connectomes across organisms and understand the common design principles that lead to their complex structure. We focus on the roughly millimeter-scale connectomes of the adult fly, mouse, and human brains (The MICrONS Consortium et al., 2023; Scheffer et al., 2020; Shapson-Coe et al., 2024). These datasets allow us to compare the microscopic structure of the human brain to mammalian and even nonmammalian brains (Van den Heuvel, Bullmore, & Sporns, 2016). As an invertebrate model, we use the fruit fly hemibrain dataset, capturing most of the central brain of the adult female Drosophila melanogaster (Scheffer et al., 2020). As a mammalian model, we use the male mouse brain dataset that spans multiple cortical visual areas (The MICrONS Consortium et al., 2023). Finally, we use the reconstruction of a sample from the temporal lobe of the cerebral cortex in the female human brain (Shapson-Coe et al., 2024) to analyze the microscopic structure of the human connectome. We consider the undirected unweighted versions of the connectome obtained from these three datasets, where each edge represents the presence of some chemical synapses. The basic properties of these networks, each containing thousands of nodes and up to millions of edges (see Figure 1), are summarized in Table 1. The fruit fly neural connectome comprises 13% of the approximately 120,000 fruit fly neurons (Dorkenwald et al., 2024). In comparison, the mouse and human connectomes contain much smaller fractions of roughly 100 billion neurons in the human brain (Azevedo et al., 2009) and 100 million neurons in the mouse brain (Herculano-Houzel, Mota, & Lent, 2006).

Figure 1.

Visualization of the connectomes in the xy plane (axes shown on the left). A–C: subnetworks of fruit fly, mouse, and human neural connectomes. Neurons corresponding to network nodes (black dots) are shown in bright colors. A subset of neighbors of these neurons are shown in dimmer colors. D–F: full connectomes. Node positions correspond to the location of the “center of mesh” of individual neurons—the average position of their mesh vertices, see Synaptic Network Construction: Spatial Properties section. Node color and size correspond to undirected degree k and z position, respectively. Edges are shown in light gray. We also provide the number of nodes (N) and edges (E) in each network.

Figure 1.

Visualization of the connectomes in the xy plane (axes shown on the left). A–C: subnetworks of fruit fly, mouse, and human neural connectomes. Neurons corresponding to network nodes (black dots) are shown in bright colors. A subset of neighbors of these neurons are shown in dimmer colors. D–F: full connectomes. Node positions correspond to the location of the “center of mesh” of individual neurons—the average position of their mesh vertices, see Synaptic Network Construction: Spatial Properties section. Node color and size correspond to undirected degree k and z position, respectively. Edges are shown in light gray. We also provide the number of nodes (N) and edges (E) in each network.

Close modal
Table 1.

Properties of the synaptic and contact networks

 Soma sizeContact thr.# nodesNetwork type# connected nodes# nodes in LCC# edgesDensity, %Max. degreeMean degreeMedian degreeWiring len. ratio
fly 2.47 μ40 nm 16,804 synaptic contact 16,804 16,804 1,936,798 0.34 3,097 230.52 195 0.24 
16,804 16,804 7,747,751 1.37 7,335 922.13 806 
mouse 5.34 μ41 nm 6,548 synaptic contact 6,261 6,224 111,636 0.13 881 34.10 23 0.07 
6,507 6,485 1,373,875 1.60 2,042 419.63 418 
human 7.6 μ46 nm 15,730 synaptic contact 13,579 13,352 74,934 0.0032 138 9.53 0.03 
15,129 15,001 2,049,143 0.41 1,221 260.54 188.5 
 Soma sizeContact thr.# nodesNetwork type# connected nodes# nodes in LCC# edgesDensity, %Max. degreeMean degreeMedian degreeWiring len. ratio
fly 2.47 μ40 nm 16,804 synaptic contact 16,804 16,804 1,936,798 0.34 3,097 230.52 195 0.24 
16,804 16,804 7,747,751 1.37 7,335 922.13 806 
mouse 5.34 μ41 nm 6,548 synaptic contact 6,261 6,224 111,636 0.13 881 34.10 23 0.07 
6,507 6,485 1,373,875 1.60 2,042 419.63 418 
human 7.6 μ46 nm 15,730 synaptic contact 13,579 13,352 74,934 0.0032 138 9.53 0.03 
15,129 15,001 2,049,143 0.41 1,221 260.54 188.5 

To start, connectomes are inherently spatial (Barthélemy, 2011; Bassett & Stiso, 2018; Chklovskii, Schikorski, & Stevens, 2002; Horvát et al., 2016; Markov et al., 2011, 2013). Their structure is expected to be shaped by a balance of minimizing the wiring cost while maintaining complex topology, at least at large enough scales (Bullmore & Sporns, 2012; Ercsey-Ravasz et al., 2013; Horvát et al., 2016; Karbowski, 2001). In addition, neurons are complex fractal-like objects (Ansell & Kovács, 2024; Smith et al., 2021) embedded in three-dimensional space. Thus, they form complex physical networks (Pete, Timár, Stefánsson, Bonamassa, & Pósfai, 2024; Pósfai et al., 2024). To test the impact of physical contact on the connectome, we construct the neural contactome of each dataset (Braitenberg & Schüz, 1991; Kovács, Barabási, & Barabási, 2020; Peters & Feldman, 1976; Rees, Moradi, & Ascoli, 2017; Reimann, King, Muller, Ramaswamy, & Markram, 2015; Stepanyants & Chklovskii, 2005). There are several key open questions to address at the level of the neural connectome and contactome, such as: (a) Are the neural connectomes complex networks in the usual sense? For example, is their degree sequence heavy-tailed (see Degree Distribution and Distance Dependence section)? (b) To what extent is the connectome dictated by the spatial embedding? Specifically, how does the probability of forming connections change with the distance between neurons, and does this explain the neural connectome topology (discussed in the Connectome Models Incorporating Distance Dependence and Degree Sequence section and Degree Distribution and Distance Dependence section)? What aspects of the connectome structure are directly enforced by the contactome constraints (see Modeling the Connectome With Contact Constraints setion)? (c) Do neural connectomes exhibit optimal wiring, given the neuron positions and connectome topology (analyzed in the Degree Distribution and Distance Dependence section)?

As a final question, we ask, (d) Can we design simple generative network models that capture the main topological and spatial features of neural connectomes? Our analyses presented in the Connectome Models Incorporating Distance Dependence and Degree Sequence section and the Modeling the Connectome With Contact Constraints section suggest that a synergistic combination of spatial (e.g., contactome or distance dependence) and topological (e.g., degree sequence) constraints is required to form realistic models of neural connectomes. To incorporate these two types of constraints, we develop a range of scalable generative models using canonical maximum entropy network ensembles (Bianconi, 2021; Dichio & Fallani, 2023; Park & Newman, 2004; Robins, Pattison, Kalish, & Lusher, 2007; see Table 2). The combination of the intrinsically probabilistic nature of maximum entropy models and their ability to preserve local and global constraints makes them versatile for representing neural connectomes. Conceptually, such a framework is capable of capturing stereotypic brain connections together with individual variability in connectome datasets (Hiesinger & Hassan, 2018; Schlegel et al., 2024; Witvliet et al., 2021). In addition to preserving average quantities—soft constraints—we utilize the ability of maximum entropy models to respect hard constraints (Hao & Kovács, 2024; Kovács et al., 2020) by considering a class of models that only allow the formation of synapses between neurons in physical contact (see the Modeling the Connectome With Contact Constraints and Degree Preserving Model With and Without The Contact Constraint sections.

Table 2.

List of maximum entropy models we use throughout the paper. Note that we only consider the maximum entropy models that, on average, preserve the total number of edges in the network

Model nameSoft constraintsHard contact constraint
binned edge probability as a function of distance (p(d)) no 
degree sequence (k1, …, kNno 
k + L degree sequence and total edge length (k1, …, kN, Lno 
– yes 
d + c binned edge probability as a function of distance (p(d)) yes 
k + c degree sequence (k1, …, kNyes 
Model nameSoft constraintsHard contact constraint
binned edge probability as a function of distance (p(d)) no 
degree sequence (k1, …, kNno 
k + L degree sequence and total edge length (k1, …, kN, Lno 
– yes 
d + c binned edge probability as a function of distance (p(d)) yes 
k + c degree sequence (k1, …, kNyes 

Models that aim to accurately represent the connectome need to capture its structure beyond the built-in network constraints. We show that the maximum entropy models that preserve distance and degree-based network features match other network properties, such as clustering, graphlet counts, and measures related to the length of shortest paths (see Figure 2 and Supporting Information Figure S1. Interestingly, our maximum entropy models have predictive power beyond what is dictated by the input data, as illustrated by the correlation between the edge probabilities in the models and the synaptic weights (see Supporting Information Figure S2). Additionally, models that include contact constraints capture the heterogeneity in distance dependence associated with neuron alignment in the mouse and human cortex, as shown in Supporting Information Figure S3. Altogether, we demonstrate the ability of simple network-based models to faithfully represent the connectomes across species, even in the absence of detailed organism-specific biological information.

Figure 2.

Comparing the graphlet counts in empirical connectomes and models based on 100 model realizations. Bar plots show the inverse fold changes (<nmodel>/ntrue) for the counts of the number of undirected triangle and square graphlets. The labels at the bottom correspond to the two-sided p values obtained from z-scores. n.s. (not statistically significant) corresponds to p > 0.05. *, **, *** correspond to p < 0.05, .01, and 0.001, respectively.

Figure 2.

Comparing the graphlet counts in empirical connectomes and models based on 100 model realizations. Bar plots show the inverse fold changes (<nmodel>/ntrue) for the counts of the number of undirected triangle and square graphlets. The labels at the bottom correspond to the two-sided p values obtained from z-scores. n.s. (not statistically significant) corresponds to p > 0.05. *, **, *** correspond to p < 0.05, .01, and 0.001, respectively.

Close modal

Degree Distribution and Distance Dependence

Broad degree distributions are often hallmarks of complex networks, including biological networks (Amaral, Scala, Barthelemy, & Stanley, 2000; A.-L. Barabási & Albert, 1999; Lynn, Holmes, & Palmer, 2024a; Lynn et al., 2024b). As a first observation about the neural connectome topology, we note that the degree distributions of these networks, shown in Figure 3DF, are broad but not scale-free. This contrasts with the distributions of edge weights—here, defined by the number of synapses between each pair of neurons—that are heavy-tailed consistently with the findings of Lynn et al. (2024b), as shown in Supporting Information Figure S4AC. We also show that given the topology, the total wiring length—as quantified by the sum of Euclidean distances between all the pairs of connected neurons—is highly optimal compared with versions with randomly shuffled node positions (see Supporting Information Figure S5).

Figure 3.

Distance and degree distribution of the connectome data and models. For a definition of soma size units used in the d axis, see Methods section. Each model distribution shows the average between 100 realizations, and the error bars represent standard deviations. A–C: distance distribution of the synaptic network data (dark blue), model k (red) and model k + L (purple). The vertical line at dmax corresponds to the largest distance between the neurons in the dataset. The vertical line at df.s. corresponds to the distance between neurons above which the finite size of the experimental volume affects the distance dependence. This distance corresponds to the peaks of the pairwise neuron distance distributions shown in gray in Supporting Information Figure S9. A–C insets: mean interneuron distance between the connected pairs in data (dark blue) and models. D–F: degree distribution of the synaptic network data (dark blue) and model d (light blue). D–F, upper insets: ratio of mean degree to median degree in data and model d. D–F, lower insets: IQR of the degree distribution of data and model d.

Figure 3.

Distance and degree distribution of the connectome data and models. For a definition of soma size units used in the d axis, see Methods section. Each model distribution shows the average between 100 realizations, and the error bars represent standard deviations. A–C: distance distribution of the synaptic network data (dark blue), model k (red) and model k + L (purple). The vertical line at dmax corresponds to the largest distance between the neurons in the dataset. The vertical line at df.s. corresponds to the distance between neurons above which the finite size of the experimental volume affects the distance dependence. This distance corresponds to the peaks of the pairwise neuron distance distributions shown in gray in Supporting Information Figure S9. A–C insets: mean interneuron distance between the connected pairs in data (dark blue) and models. D–F: degree distribution of the synaptic network data (dark blue) and model d (light blue). D–F, upper insets: ratio of mean degree to median degree in data and model d. D–F, lower insets: IQR of the degree distribution of data and model d.

Close modal

To characterize the spatial organization of connectomes, we model each neuron as a node whose position corresponds to the “center” of that neuron, given by the “center of mesh” of its surface, see the Synaptic Network Construction: Spatial Properties section. We then use the Euclidean distance between the neuron positions to represent the relative locations of pairs of neurons. As our first result, we find that the probability that a connectome edge exists between a given pair of neurons decays rapidly as a function of distance between these neurons. This is in line with the findings of exponential distance dependence in the C. elegans connectome (Arnatkeviciūtė, Fulcher, Pocock, & Fornito, 2018), mouse neural cell cultures (Yin et al., 2020), and interareal level connectomes in mammalian brains (Fornito, Arnatkevičiūtė, & Fulcher, 2019; Fulcher & Fornito, 2016; see also Distance Dependence and Model d section).

Qualitatively, the decay appears exponential, as demonstrated in the top row of Figure 3. Quantitatively, assuming exponential decay of a form p(d) ∝ ed/d0, we estimate the constant d0 for the mouse connectome to be ∼0.05 mm. This scale differs from the scale of the exponential decay in interareal connectivity by an order of magnitude—d0 is estimated to be 2.179 mm for the mouse in Fulcher and Fornito (2016), which is larger than the linear dimensions of the mouse dataset studied here. To compare the characteristic distances d0 of the three organisms, we use the soma size as a distance scale. Estimating the soma sizes is discussed in Soma size estimation, and their numerical values are presented in Properties of the synaptic and contact networks. We estimate d0 to be 10, 10, and 12 in terms of some size units for fly, mouse, and human. Therefore, soma sizes set a distance unit that brings the characteristic network distances to the same scale.

Exponential decay is in line with the expectation that establishing and maintaining the synapses in neural connectomes is associated with wiring cost (Ahn, Jeong, & Kim, 2006; Bullmore & Sporns, 2012; Chen et al., 2006), and the wiring cost in empirical connectomes is lower than that of other networks with the same node positions and topology (Ercsey-Ravasz et al., 2013; Horvát et al., 2016). The simplest way to define the total wiring cost of the neural connectome is by summing up the Euclidean distances between the pairs of connected neurons. To assess the optimality of neuron placement without disrupting the network structure, we randomly shuffle the node positions while keeping the network topology fully intact (Ercsey-Ravasz et al., 2013; Horvát et al., 2016). The wiring length obtained from this randomization of the mouse connectome is about 3 times larger than the true wiring length (p < 0.001, see Supporting Information Figure S5 for the distribution of wiring lengths over 200,000 reshuffled samples). Similarly, the wiring length of the shuffled networks is about 2 times the true wiring length in the fly and more than 6 times the true wiring length in the human (p < 0.001), as illustrated in Supporting Information Figure S5. Therefore, we conclude that the observed wiring length is much shorter than expected by chance, given the connectome topology.

Connectome Models Incorporating Distance Dependence and Degree Sequence

Distance dependence, degree sequence, and total wiring length can serve as building blocks (soft constraints) of simple generative models of the neural connectome (see first three models of Table 2). Here, we assess how well such generative models capture the spatial and topological structure of the connectome.

We find that the connectome degree sequence alone (model k, sometimes referred to as soft configuration model, shown in red in Figure 3 and discussed in the Degree Preserving Model With and Without The Contact Constraint section) does not imply the observed distance dependence. For instance, in model k, the average distance between the neighboring mouse neurons is 2.6 times larger than that of the mouse connectome. This means that, unlike the empirical connectome, model k is not as optimal in terms of the wiring cost—an observation that also holds for fly and human.

Next, we demonstrate that distance dependence alone is insufficient to predict the connectome structure. For instance, the observed degree distribution (Figure 3DF, dark blue) is much broader than that coming from a distance-based model (model d) for all three organisms (Figure 3DF, light blue). As an illustration, the interquartile range (IQR) of the degree distribution in the mouse connectome is significantly larger than the IQR in model d, 32.0 versus 20.9 (p < 0.001). Additionally, the mean to median degree ratio is 1.48 in the mouse connectome, compared with the much lower value of 0.95 in model d (p < 0.001). This indicates that the size of hubs—network nodes whose degree greatly exceeds the average—in the data is not fully captured by model d. For example, the number of partners of the highest degree hub—881 in the mouse, which constitutes 13% of the nodes in the network—is about an order of magnitude larger than that expected based on model d. Similarly, the hub degrees (see Table 1 for hub sizes in empirical connectomes) are significantly underestimated by model d in fly and human, as shown in Figure 3DF.

Altogether, our results indicate competing implications of the broad degree distribution and the exponential distance dependence. To construct a network model that resolves this tension, in model k + L, we preserve the total distance L between the pairs of connected neurons—the overall wiring cost—in addition to maintaining the degree sequence (Halu et al., 2014), as discussed in Degree and wiring length preserving randomization. Unlike model k, model k + L leads to distance dependence that is qualitatively similar to what we observe in data (see top row of Figure 3, purple line), especially for the mouse. Note that model k + L requires estimating a distance parameter d0k+L from data. Notably, the values of d0k+L are similar for fly, mouse, and human (see the Degree and Wiring Length Preserving Randomization section) when measured in soma size units, reinforces the finding that soma size sets a natural length scale for neural connectome models.

As the next step, we consider the extent to which models d, k, and k + L generalize beyond the network features explicitly built into them. For example, we consider the counts of different graphlets—small connected subgraphs—of the connectome in data and models (Milo et al., 2002; Pržulj, 2007). Graphlet counts represent the higher-order local network structure beyond degree distribution, thus providing a sensitive measure of similarity between models and data (Pržulj, 2007). In Figure 2, we illustrate the four small undirected graphlets we consider—triangle, square, square with a diagonal edge, and a four-node all-to-all connected graph. As triangle counts indicate if the neighbors of connected neurons tend to be connected, an abundance of triangles can hint at similarity-driven connectivity. Similarly, an overrepresentation of squares with no diagonals suggests complementarity-driven wiring rules (Kovács et al., 2019). In general, the graphlet counts are better matched by the k + L model (violet), than by models d and k (unshaded blue and red, respectively; Figure 2).

In addition to graphlet patterns, we consider other local and global network measures commonly used in network neuroscience (Rubinov & Sporns, 2010) that we summarize in the Network Measures section. Global measures such as the network diameter and average shortest path length are well-captured by model k + L across the board, with model d and even model k often closely capturing these properties as well, as demonstrated in Supporting Information Figure S1. However, the advantage of incorporating a combination of network topology and spatial structure in model k + L is most evident for local network measures such as local efficiency, transitivity, and clustering coefficient. For instance, the average local efficiency—a measure of how fault tolerant the system is with respect to individual node removal (Latora & Marchiori (2001)—is relatively low in models k and d, but matches the empirical connectome better in case of model k + L, demonstrating an especially good agreement for the mouse. In contrast, a global analog of this efficiency measure is slightly overestimated by models k and d.

So far, we discussed how well the connectome models reproduce the empirical network structure and spatial organization. Another relevant question is the extent to which the models d, k, and k + L capture the existence of individual synapses—a question relevant to network link prediction. In other words, what is the performance of our models in a binary classification task of predicting whether two neurons form a synapse? To address this question, we first present the receiver-operating characteristic (ROC) curve, which demonstrates the relationship between the true and false positive rates, in Supporting Information Figure S6AC. Additionally, we provide the precision-recall curve for this classification task, as shown in Supporting Information Figure S6DF. This curve is a useful tool to assess the performance of our models given the severe data imbalance—synapses are only present between a small fraction of the available pairs of neurons. A higher area under the curve (AUC) corresponds to better performance in the classification task for both the ROC and precision-recall curves. As demonstrated in Supporting Information Table S2, the best performance is achieved in model k + L across datasets. Similarly, the likelihood of the observed connectome—as calculated using the corresponding maximum entropy model parameters—is the highest for model k + L (see Supporting Information Table S3).

Models d, k, and k + L do not explicitly preserve the physical contact constraint. For the mouse, 18%, 51%, and 64% of edges created by models d, k, and k + L, respectively, are contained in the contactome. The edge overlap arising from these models is larger than expected from Erdős-Rényi model—for example, 6.4% for the mouse. Similarly, model k + L preserves the contact constraint to a larger extent than other models in mouse and human, but the average fraction of overlap varies across the contactomes—being 32% for the fly, and 53% for the human.

To further assess the accuracy of models d, k, and k + L in capturing the contactome edges, we consider how well these models perform on a binary classification task that determines whether two neurons are in physical contact. We demonstrate the ROC curves and the precision-recall curves for this edge classification task in Supporting Information Figure S7, with the AUC values provided in Supporting Information Table S2. Model k performs better than chance, but worse than models d and k + L. For the mouse dataset, models d and k + L demonstrate similar performance in retrieving the contactome edges—AUC-ROC is 0.95, and AUC is 0.62 for the precision-recall curve—while for human and fly, model k + L clearly performs best. As we show in the Modeling the Connectome With Contact Constraints section, the maximum entropy framework also allows us to explicitly include the contact constraint to enforce that the connectome is a subnetwork of the contactome.

So far, we have shown that maximum entropy models with minimal inputs generalize to the properties of binary networks that are not explicitly included in the model. In addition to that, our models are also able to capture the “edge weights”—as defined by the number of synapses between pairs of neurons—similarly to the models in Haber et al. (2023). This is evident from Spearman’s rank correlation coefficients between edge probabilities pij and edge weights wij, shown in Supporting Information Figure S2AC. Models d, k, and k + L show positive statistically significant (p < 0.001) correlation with the empirical edge weights across datasets. When restricted to pij among the neural connectome edges (Supporting Information Figure S2DF), model k +L shows the highest correlation with edge weights in fly, mouse, and human among the three models.

Modeling the Connectome With Contact Constraints

The biological mechanisms required to form and maintain synapses might be different from those allowing neurons to be in physical contact. While synapses can be only observed between neurons in physical contact, physical contact alone might not dictate synapse formation, as parts of neurons could get in close proximity in passing. As a step toward decoupling physical contact from the effect of additional biological mechanisms, we construct neural contactomes from volumetric neuron reconstructions. First, we calculate the distances between pairs of neurons using their high-resolution mesh representation, as discussed in the Contact Network Construction section. Then, we use the distance threshold that recovers the edges of neural connectomes (see Supporting Information Figure S8) to construct contactomes. Thus, by construction, neural connectomes are subnetworks of the neural contactomes. The structure of a subset of the multilayer (multiplex network) human connectome-contactome network is illustrated in Figure 4A. To put that constraint in context, we note that the number of edges in the contactome Econt is much larger than that in the connectome, Esyn—specifically, Econt/Esyn ≈ 4, 12, and 27 for fly, mouse, and human. Still, contactome edges comprise less than 2% of all possible neuron pairs (see Table 1), thus significantly narrowing down the space of potential synaptic connections.

Figure 4.

Relationship between the connectome and the contactome. A, from left to right: xy projection of mesh vertices of five human neurons and their center of mesh positions (black circles). Spatial contactome, or contact network, edges shown in dark yellow. Spatial connectome, or synaptic network, edges are shown in dark blue. The synaptic network and contact network have the same nodes, while synaptic edges are a subset of the contact network edges. The resulting network is naturally multilayer (multiplex) (Kivelä et al., 2014), as illustrated by connecting the representations of the same nodes with dashed lines. B: distance distribution of the contactome (dark yellow) and distance distribution of the connectome restricted to contactome edges (dark olive). Only the data points corresponding to at least 10 edges at a given distance bin are shown. C: degree distribution of the contactome. C, insets: degree of the node in the contactome (x-axis, kcont) versus its degree in the connectome (y-axis, ksyn), shown in gray. Red circles represent the average values of ksyn corresponding to a binned range of kcont. We also provide the Spearman’s rank correlation coefficient rs between the kcont and ksyn variables.

Figure 4.

Relationship between the connectome and the contactome. A, from left to right: xy projection of mesh vertices of five human neurons and their center of mesh positions (black circles). Spatial contactome, or contact network, edges shown in dark yellow. Spatial connectome, or synaptic network, edges are shown in dark blue. The synaptic network and contact network have the same nodes, while synaptic edges are a subset of the contact network edges. The resulting network is naturally multilayer (multiplex) (Kivelä et al., 2014), as illustrated by connecting the representations of the same nodes with dashed lines. B: distance distribution of the contactome (dark yellow) and distance distribution of the connectome restricted to contactome edges (dark olive). Only the data points corresponding to at least 10 edges at a given distance bin are shown. C: degree distribution of the contactome. C, insets: degree of the node in the contactome (x-axis, kcont) versus its degree in the connectome (y-axis, ksyn), shown in gray. Red circles represent the average values of ksyn corresponding to a binned range of kcont. We also provide the Spearman’s rank correlation coefficient rs between the kcont and ksyn variables.

Close modal

We find that the connectome and contactome exhibit similar exponential distance dependence (see Figure 4B and Supporting Information Table S1). Thus, distance dependence in neural connectomes appears to largely be a consequence of physical constraints. However, connectomes are not a random subset of contactomes, as indicated by the nonlinear relationship between the connectome and contactome degrees of individual neurons (see Figure 4 bottom row insets). Thus, the contactome constraints alone are insufficient to obtain accurate connectome models.

To further uncover the impact of physicality alone on the connectome in more detail (Pósfai et al., 2024), we consider random subnetworks of the contactome that preserve the number of edges in the connectome as a soft constraint (model c). This model does not explicitly preserve the distance dependence, wiring cost, or degree sequence. The average distance between neighboring neurons in model c is only 1.12 times larger than the true connectome wiring distance for the mouse. That indicates an improvement in capturing the wiring cost optimization compared to model k—another model that does not explicitly preserve distance dependence. The degree distribution of model c is still less broad (IQR of 29.0 for the mouse) and less dominated by hubs (mean to median degree ratio of 1.0 for the mouse) compared to the empirical connectome (IQR of 32.0, mean to median degree ratio of 1.48 for the mouse). This is an improvement compared to model d—another model that does not explicitly preserve the degree sequence. However, model c still underestimates the largest hubs.

The node degrees in the connectome and contactome (ksyn and kcont, ksynkcont, shown in Figure 4C insets) are not independent. The Spearman’s rank correlation coefficient is large and positive for the three organisms: for example, its value is 0.87 for the mouse (p < 0.001), which shows that the neurons with high contactome degree kcont tend to have high connectome degree ksyn. However, the relationship between kcont and ksyn appears to be superlinear (see the insets in Figure 4)—the nodes with many contact partners have a disproportionately large number of synaptic partners. Again, this demonstrates that the connectome is not a random subnetwork of the contactome, as in the random case, we would observe a linear relation.

Yet, we find that the distance dependence in synaptic networks is largely captured by the contactome in all three organisms. As an illustration, the probability of a connectome edge given the contactome edge between a pair of neurons exists (olive line in Figure 4B) appears largely independent of distance. The quantitative agreement between the connectome and contactome distance dependence can be assessed by comparing the characteristic distance d0 assuming exponential decay p(d) =αed/d0—we estimate d0 to be 10 and 12 soma sizes in mouse connectome and contactome. A similar level of agreement in d0 estimates is observed in the fly and human (see the values provided in Supporting Information Table S1). To summarize, the distance dependence of connectomes follows the same trends as that of contactomes. As a result, model d + c—a model that preserves the distance dependence while respecting the contact constraint—does not perform better than model c in terms of capturing the degree distribution of the connectome (see Figure 5). Model d + c and model d have similar likelihoods of the empirical network (see Supporting Information Table S3), which is another indicator of distance dependence and contact constraints being highly redundant. Models c and d + c also underestimate the graphlet counts, as demonstrated in Figure 2.

Figure 5.

Distance and degree distribution of connectome data and models with contact constraints. Each model distribution shows the average between 100 realizations. A–C: distance distribution of the synaptic network data (dark blue), model c (gray) and model k + c (red). The vertical line at dmax corresponds to the largest distance between the neurons in the dataset. The vertical line at df.s. corresponds to the distance between neurons above which the finite size of the experimental volume affects the distance dependence. This distance corresponds to the peaks of the pairwise neuron distance distributions shown in grey in Supporting Information Figure S9. A–C insets: mean interneuron distance between the connected pairs in data ans models. D–F: degree distribution of the synaptic network data (dark blue), model c (gray) and model d + c (light blue). D–F, upper insets: ratio of mean degree to median degree in data and model d. D–F, lower insets: IQR of the degree distribution of data and model d.

Figure 5.

Distance and degree distribution of connectome data and models with contact constraints. Each model distribution shows the average between 100 realizations. A–C: distance distribution of the synaptic network data (dark blue), model c (gray) and model k + c (red). The vertical line at dmax corresponds to the largest distance between the neurons in the dataset. The vertical line at df.s. corresponds to the distance between neurons above which the finite size of the experimental volume affects the distance dependence. This distance corresponds to the peaks of the pairwise neuron distance distributions shown in grey in Supporting Information Figure S9. A–C insets: mean interneuron distance between the connected pairs in data ans models. D–F: degree distribution of the synaptic network data (dark blue), model c (gray) and model d + c (light blue). D–F, upper insets: ratio of mean degree to median degree in data and model d. D–F, lower insets: IQR of the degree distribution of data and model d.

Close modal

Next, we introduce the model k + c that combines topological—in the form of degree sequence—and physical contact constraints. The average distance between the neighboring neurons in this model is 1.15 larger than that in the empirical mouse connectome. Thus, model k + c does not capture wiring cost constraints. The mismatch in wiring cost is significantly (p < 0.001) larger than that in model c—therefore, there is a trade-off between accurately capturing the wiring cost and preserving the degree sequence. However, model k + c improves on models k and c by better representing the higher-order connectome structure in fly, mouse, and human, as demonstrated by the graphlet counts in Figure 2. Similarly, model k + c is more accurate at reproducing other local connectome properties, such as local efficiency, transitivity, and clustering coefficient, as shown in Supporting Information Figure S1.

As an alternative way to assess the performance of models d + c and k + c, we determine whether they can predict which contactome edge is also present in the connectome. We again consider the ROC and precision-recall curves (see Supporting Information Figure S10), together with their AUC values (demonstrated in Supporting Information Table S2). We find that model k + c performs better in this classification task, as indicated by the AUC values. Model k + c also yields a higher likelihood of the empirical network than models c and d + c (see Supporting Information Table S3).

Similarly to models d, k, and k + L in the Connectome Models Incorporating Distance Dependence and Degree Sequence section, contact-based models partially capture the edge weights (number of synapses between pairs of neurons), even though no weight information is built into the models. Edge probabilities in model k + c show stronger Spearman’s rank correlation rs with the number of synapses than the edge probabilities in d + c for all three organisms. For example, within the mouse connectome edges, rs = 0.18 for model d + c and 0.36 for model k + c (p < 0.001 in both cases), as shown in Supporting Information Figure S2E. In general, models k + c and k + L are consistently the top models in capturing edge weights for the three organisms (see Supporting Information Figure S2AF). Therefore, we conclude that among the considered models, models k + c and k + L are the best-performing models of the connectome across metrics. Both models reproduce the correct form of distance dependence, while exponential distance dependence is not explicitly built in.

However, distance dependence in neural connectomes is not fully homogeneous. For instance, the mouse and human connectomes we use come from cortical datasets, each containing several cortical layers (The MICrONS Consortium et al., 2023; Shapson-Coe et al., 2024), and the distance dependence within the layers can be different from distance dependence across the layers along the cortical columns. To treat the three datasets in a consistent way, we find the principal component vectors corresponding to the neuron alignment (see Supporting Information Table S1, Supporting Information Figure S3, and their captions). The details of distance dependence p(di), where di is the distance along a specified component, differ across principal components (i = 1,2,3) (see Supporting Information Figure S3, panels B, E, H). Assuming p(di) ∝ edi/di, by construction it is true that d1 > d2 > d3. For example, we find d1 = 15, d2 = 10, and d3 = 8 in the mouse in soma size units (see Supporting Information Table S1). Likewise, we estimate the orientation-dependent distance scale in fly and human. In the human data, we find similar heterogeneity in d1 and d2—with a caveat that d3 is very small since the human brain sample is comparatively very thin. In the fly data—where, unlike in cortical layers of mouse and human, the neuron orientation is more radial, see Supporting Information Figure S11A—we also observe that distance dependence varies across the principal component directions. In the fruit fly, in contrast to other datasets, d1 appears to have a different functional form from d2 and d3.

Last, we compare the performance of the considered models on capturing the heterogeneity of distance dependence in empirical connectomes. As shown in Supporting Information Figure S3, panels C, F, and I, contactome (model c) qualitatively exhibits similar orientation dependence as the connectome, and the orientation dependence is also evident in model k + c. On the other hand, model k + L does not capture the heterogeneities in orientation dependence. Quantitatively, this is demonstrated in panels J–L of Supporting Information Figure S3. Thus, using the contactome constraint facilitates capturing the details of distance dependence, which are not captured even by model k + L that performs well based on other metrics.

Connectomes are shaped by an interplay between spatial constraints and the need for complex topology that is essential to brain function (Bullmore & Sporns, 2012). To quantify the shared spatial properties of connectomes, we establish that distance dependence in undirected unweighted millimeter-scale neural connectomes is exponential. We also demonstrate that the characteristic distance scales are similar across species when expressed in soma-size units. Moreover, we show that the neuron positions are highly optimal in terms of minimizing the wiring cost. Driven by a biological hypothesis, we construct physical contact networks from volumetric data and show that exponential decay follows from the contactome structure. Similarly, the contactome captures the orientation dependence in the connectome. Thus, establishing accurate spatial or physical (Pete et al., 2024) generative models of the contactome can help elucidate the origin of the exponential distance dependence across species.

Recently, signatures of structural criticality—with critical exponents consistent across organisms—were observed in the three volumetric brain datasets we analyze here (Ansell & Kovács, 2024). Such universal properties of the brain anatomy are expected to have a profound impact on the spatial and topological organization of the contactome—and, consequently, connectome—and lead to similarities across species. Models of brain anatomy that belong to the same universality class also lead to models of the contactome, a direct input for some of our models. At this point, it remains an intriguing open question to determine whether structural criticality is required for the complex contactome structure presented here, and how it relates to brain function.

The contactomes we constructed for three organisms are useful beyond serving as spatial constraints for the connectome models. The contactomes can aid in predicting still missing chemical synapses in the reconstructions. In addition to chemical synapses, contactomes must contain electrical synapses—also known as gap junctions—that are much smaller and therefore hard to detect in raw volumetric data (Maeda et al., 2009). Thus, contactomes could serve as a useful constraint in gap junction prediction as well (Kovács et al., 2020). As detailed and accurate classification of neurites into axons and dendrites becomes routinely available in high-resolution volumetric datasets (Shapson-Coe et al., 2024), contactomes can become useful in analyzing the effects of subcellular wiring specificity on the connectome structure. Additionally, as directly comparing individual connectomes within the same species is already becoming feasible for complex organisms such as the fruit fly (Schlegel et al., 2024), the structure of the corresponding contactomes can be used as an extra measure of intraspecies variability. Last but not least, the novel approach of considering the multilayer connectome-contactome network goes beyond the standard spatial network framework and thus could ignite new research in network science.

As a first step in neural connectome topology analysis, we establish that the degree distribution is broad across datasets, yet not scale free. However, the degree distribution of the empirical connectomes does not follow from spatial constraints alone. Similarly, distance dependence is not implied by the connectome degree sequence. However, the models that resolve the mismatch by using a combination of spatial constraints and degree sequence—k + c and k + L—capture the connectome properties such as graphlet counts, efficiency, and distance dependence across species. These models demonstrate predictive power for connectome properties not explicitly built into them. For instance, the number of synapses—a proxy for edge weight—between the neurons is positively correlated with the edge probabilities implied by our models. The authors of Schlegel et al. (2024) demonstrate that in the fly brain, the connections with higher weight are significantly more likely to be found across hemispheres and across different organisms than edges with smaller weights—thus, more stereotyped edges are expected to be more likely to be captured by our maximum entropy models. Thus, our models have the potential to reliably capture the edges that are crucial to network function as well as the individual variability in lower-weight edges.

Note that the details of model performance vary across organisms—consistently with the findings of Haber et al. (2023). For instance, model k + L appears to be the best model to capture the basic structural features of mouse and human connectomes, while model k + c appears to demonstrate better performance on the fly data. The empirical distance dependence is not explicitly built into models k + L and k + c, but in both cases, it is well reproduced across organisms. However, model k + L does not capture the distance dependence heterogeneity that is picked up by model k + c. We conjecture that just like in the fruit fly, model k + c will perform better than model k + L once multiple brain regions are captured by the datasets. The discrepancies between models k + c and k + L and the empirical connectomes are evident from the statistically significant differences in their graphlet counts and network measures (see Figure 2 and Supporting Information Figure S1). These discrepancies can be informative of the wiring rules missing from our models, for example, wiring specificity based on neuron type, gene expression profiles, or the type of neurites in physical contact (Haber et al., 2023; Kovács et al., 2020; Udvary et al., 2022).

Exponential distance dependence arises naturally in models k + c and k + L. However, we use the empirical neural connectome degrees to obtain the appropriate neuron-level parameters that we then use in these generative models. At the same time, node degrees—and therefore the node-level model parameters—are nontrivially linked to structural properties of corresponding neurons (e.g., surface area, linear span, and their morphology in general). For instance, larger neurons are capable of forming synapses far away from their soma or center of mesh locations and, therefore, have more neighbors, while the location of positions of neighbors of small neurons is confined to a relatively smaller neighborhood. Linking the node-level parameters of generative models to observable structural and biological properties of neurons is a promising direction for future exploration that could link maximum entropy models to the bottom-up models of brain structure and development (Kaiser & Hilgetag, 2004; Oldham et al., 2022).

Our approach to analyzing volumetric brain data is in line with comparative connectomics (Van den Heuvel et al., 2016)—an emerging field that aims to uncover the general principles of brain network architecture and identify species-specific features of connectomes. The models we establish can serve as baselines to compare different neural connectome datasets. For instance, they can be useful in comparing different brain regions within the species, instances of the same brain region across healthy individuals, or differentiating the structure of the brain in healthy and diseased states.

Our analysis sets the stage for a thorough investigation of the existing and forthcoming high-quality volumetric brain reconstructions. The maximum entropy models we introduce are scalable, as they can be accurately solved using a simple iterative procedure (Vallarano et al., 2021). This property, as well as the ability to directly sample the models without using Markov-chain Monte Carlo sampling, makes applying our methodology feasible even for larger connectomes—for instance, the existing fruit fly brain reconstruction (Dorkenwald et al., 2024) or regions of the proposed complete reconstruction of the mouse brain (Abbott et al., 2020). In addition, maximum entropy models are flexible and can be in principle extended to include additional important features of connectome edges—for instance, directionality (Haber et al., 2023; S. Song, Sjöström, Reigl, Nelson, & Chklovskii, 2005), weight (e.g., the number of synapses between the neurons or synapse sizes) (Bianconi, 2009; Lynn et al., 2024b), sign (excitatory or inhibitory) (Gallo, Garlaschelli, Lambiotte, Saracco, & Squartini, 2024; Hao & Kovács, 2024), the type of neurites involved in synapse formation, or even multiway interactions between the neurons (Saracco, Petri, Lambiotte, & Squartini, 2022; Scheffer et al., 2020)—as well as their combinations. Incorporating these extra features as maximum entropy model constraints increases computational requirements, and incompleteness and biases in constraints may lead to biases in the maximum entropy models. However, analyzing the graphlet signatures of these more nuanced models provides an opportunity to gain additional insights into the structure of the connectome, as well as its relation to brain dynamics and function (Haber et al., 2023; Lizier et al., 2023). The graphlet analysis itself can also be generalized to explicitly include spatial information (Kim et al., 2012) in addition to topology, as well as node and edge labels, representing biologically relevant information. More detailed biological input could capture neuron gene expressions or cell types, or even different types of cell labels, such as neurons and glial cells (Fields et al., 2015), potentially incorporated into the maximum entropy models to reveal the effect of wiring specificity on connectome structure (Haber et al., 2023; Schneider-Mizell et al., 2023).

Synaptic Network Construction: Topology

General considerations.

To construct a neuronal connectome, we need to define the nodes and edges of the network. In general, we want the nodes to correspond to individual neurons, while the edges should represent the presence of at least one synaptic connection. In practice, the fly, mouse, and human datasets we analyze contain reconstructed segments corresponding to parts of individual cells. Thus, each neuron can be present in more than one segment. To avoid representing a single neuron as multiple nodes, we restrict ourselves to segments that contain a soma in the experimental volume—this ensures each neuron is only counted once. Moreover, we only consider the cells with a single identified soma to avoid picking up cell merging errors. We present the basic properties of the connectomes we obtain in Table 1. Below, we discuss the specific steps we took to obtain the fly, mouse, and human neuron connectomes.

We use neuron meshes to define the positions (centers of mesh) of individual neurons, filter out the neurons cropped by the boundaries of the experimental volume, and define the contactome edges. The meshes of the fly, mouse, and human data sets we use are defined at different levels of detail (lod). Lod = 0 corresponds to the finest mesh, while lod = 3 corresponds to the coarsest representation of neuron surfaces.

Fly (see Scheffer et al., 2020).

We use the neurons that are labeled as “traced” and “uncropped” and whose soma positions within the experimental volume are available (16,804 neurons). The relevant part of the synaptic network is obtained from the compact connection matrix summary v1.2 release available at https://www.janelia.org/project-team/flyem/hemibrain. We use the version of the network with all of the detected synapses, which results in a total of 9,123,275 synapses in our connectome.

Mouse (see Elabbady et al., 2024; The MICrONS Consortium et al., 2023).

Note that the mouse data we used—including neuron ids, the meshes representing their volumetric structure, and synapse information—were obtained in September 2022. Since then, the datasets have been edited and improved, as discussed in The MICrONS Consortium et al. (2023). We start by obtaining soma information from the “nucleus_neuron_svm” table using CAVE, as discussed in https://github.com/AllenInstitute/MicronsBinder/blob/master/notebooks/mm3_intro/CAVEsetup.ipynb (Elabbady et al., 2024). We then filter the cells by having exactly one labeled soma. Finally, we only consider the cells labeled as “neuron.” There are 64,360 cells in the mouse dataset that satisfy these conditions. However, many neurons in the resulting connectome are cropped by the experimental volume boundaries, hindering our ability to assess their size and full spatial extent. To make the network similar to the fly dataset and avoid the effects of cropping the neurons on the spatial and topological properties of the connectome, we identify and use the uncropped neurons.

To find the uncropped neurons, we first define the volume boundary by finding the regions in space where no cells are detected for each slice in z dimension and finding the boundaries of each region using the MATLAB Image Processing Toolbox. Then, we thicken the boundary (the thickness of the boundary we use is larger than the largest distance between mesh vertices for lod = 1 to ensure all the boundary crossing neurons are filtered out) and remove any “holes” that appear due to misalignment of different imaged z slices. As our next step, we identify the meshes that do not have any vertices on the boundary at lod = 1. The resulting 9,118 cells become our uncropped neuron candidates.

Some of the segments among the uncropped neuron candidates do not appear to correspond to neurons. Specifically, some cells labeled as “neurons” in the dataset appear to be glial cells (e.g., see the purple cell in Supporting Information Figure S12, left panel). Other cells appear to only contain a fraction of the cell (e.g., see the blue object that looks like a soma in Supporting Information Figure S12, left panel) or arise from other segmentation errors. Plotting two spatial properties of neurons—their span and number of mesh vertices at lod = 3 (a proxy for their surface area)—reveals that the neuron candidates form clusters in this 2D space. To obtain the cluster boundaries numerically, we use the DBSCAN algorithm with parameters ε =.1 and min_samples = 30 (Pedregosa et al., 2011). This leads to five categories (shown in Supporting Information Figure S12)—two with relatively short span and relatively low number of mesh vertices (“small” and “incomplete” cells), one with a large number of mesh vertices and moderate cell span (“glia-like” cells), a large cluster containing 6,489 “neuron-like” cells, and unclassified cells that were not assigned to any of the clusters.

To validate our selection of the largest cluster as the one corresponding to neurons, we consider the 78 proofread neurons with extended axons and somas. While none of the proofread neurons are uncropped, their positions on the span versus number of mesh vertices plot (black triangles in Supporting Information Figure S12) overlaps with the location of the “neuron-like” cluster. Finally, we use the cells in “neuron-like” cluster together with 59 additional segments that were originally unclassified but are closest to the center of mass of the “neuron-like” cluster as the nodes of the connectome (6,548 nodes total). We obtain the synapses—163,188 in total—associated with these 6,548 neurons from https://bossdb-open-data.s3.amazonaws.com/iarpa_microns/minnie/minnie65/synapse_graph/synapses_pni_2.csv.

Furthermore, we assess the effect of only using the connections between the uncropped neurons on the connectome structure by considering our connectome degrees as a lower limit on node degrees. The “medium” and “upper” bound degree distributions are provided in Supporting Information Figure S13A—both of them are broad and nonpower law. The “intermediate” degree sequence—where we include all single-soma neuron neighbors of our fully contained neurons—shows high Pearson correlation with node degrees in our connectome (see Supporting Information Figure S13B).

Human (see Shapson-Coe et al., 2024).

We obtained the soma labels for individual neurons from gs://h01-release/data/20210601/c3/tables/somas.csv. For our analysis, we select the neurons that have a single labeled soma—15,730 cells in total. We acquired the list of synapses from the files in gs://h01-release/data/20210601/c3/synapses/exported/json. The synapse dataset also includes the labels of parts of the neuron involved in synapse formation (e.g., axon to dendrite). However, we do not perform any filtering based on this information and use the entire dataset containing 115,165 synapses.

The shape of human brain experimental volume is qualitatively different from that of the mouse or fly dataset. Namely, the size of the experimental volume in z dimension is much smaller than that in x and y. We can still identify the neurons that do not cross the experimental volume boundary (967 cells). Alternatively, we can also identify the neurons that do not cross the xy boundary while possible intersecting the boundaries of the experimental volume in z (7,176 cells). However, in both of cases, much of the network structure is lost (330 and 24,144 edges are preserved in a network with neurons fully contained within the xy boundary and the full experimental boundary, respectively) and the network is largely disconnected. Thus, we keep the entire human network in our analysis.

Synaptic Network Construction: Spatial Properties

The connectome is inherently spatial. Individual neurons are complex objects embedded in physical space, whose spatial organization relative to other neurons affects who they can form synapses with. The simplest way to capture the neuron location is via its soma position, as illustrated by node positions in Supporting Information Figure S11. Then, the relative locations of neurons can be represented by the Euclidean distance between their somas. This connectome representation leads to the edge probability that clearly decreases with distance in mouse and human connectomes (see Supporting Information Figure S11 purple dash-dotted line, see the Soma Size Estimation for the definition of soma size units). However, the fly edge probability decreases very slowly at larger distances (approximately 20 to 120 soma sizes, as shown in Supporting Information Figure S11). This is largely the result of the distinct spatial organization of neurons in the fruit fly brain, where the somas (dots in Supporting Information Figure S11A and Figure S14) occupy the periphery of the brain, and the neurites are located closer to the center of the brain (Supporting Information Figure S11, see example neurons shown in green and purple) (Scheffer et al., 2020). Thus, the soma position in the fly is not representative of the neuron location as a whole.

To represent the neuron positions more effectively, we use the “center of mesh”—the center of mass of mesh vertices of individual neurons that we calculated at lod = 1 for the three organisms. This center of mesh can be thought of as the center of mass of the surface of individual neurons. Defining the distance between neurons as the Euclidean distance between the centers of mesh leads to a more rapid decay of the fly distance dependence and a narrower range of distances between the neurons in synaptic contact (Supporting Information Figure S11, dark blue dashed line). To a lesser extent, similar trends are seen in the mouse and human.

Note that the spatial connectomes we analyze are cropped—thus, distance dependence for d above a certain threshold does not represent the full neural connectome distance dependence at those distances d. To obtain a distance threshold, we consider the pairwise distances between all pairs of neurons for each organism (shown in gray in Supporting Information Figure S9). The peaks of these distance distributions roughly correspond to the distance threshold we seek—for example, we estimate it to be dthr = 56 soma sizes for the mouse.

The spatial connectome we constructed can be used to estimate the distance scale d0 of the exponential decay p(d) ∝ ed/d0 in the three organisms. Using the distance data below dthr, we estimate d0 = 10, 10, and 12 soma sizes for fly, mouse, and human respectively—the values are close across organisms. Without the distance threshold, these estimates become d0 = 9, 9, and 15 for fly, mouse, and human. We also expect the distance dependence to not be uniform—for example, distance dependence along the cortical columns could be different than distance dependence within the cortical layer in mouse and human datasets. This is quantified and illustrated in Supporting Information Table S1 and Supporting Information Figure S3.

Finally, we consider the effect of only including the edges between the uncropped neurons in the estimated mouse d0 value. To do so, we compare the distance dependence in the connectome with the distance dependence in a network that includes the edges between the uncropped neurons and cropped neurons with a soma in the volume, see Supporting Information Figure S13A inset. Here, we define distance as the Euclidean distance between somas. We get similar values for the two networks—d0 = 11 and 12 soma sizes.

Soma Size Estimation

We define the soma size as a quantity roughly corresponding to the typical soma radius. To estimate the fly and mouse soma sizes from data, we collected the distances d from the center of the soma to physical contact locations. Using physical contact locations instead of synapse positions enables using more data points and ensures that the soma size is correctly estimated for the fruit fly, where no synapses are formed directly on the soma (Scheffer et al., 2020). We expect the typical soma size to be located at the peak of the distance distribution (shown as a histogram in gray in Supporting Information Figure S15).

The approach outlined above did not result in a clear peak in the human dataset (gray histogram, right panel in Supporting Information Figure S15). Fortunately, synaptic contacts in the human dataset are classified based on which parts of the pair of neurons (e.g., axon and soma) were involved in the formation of the synapse (Shapson-Coe et al., 2024). Once we restricted the data to only include the synapses connecting axons or dendrites of the presynaptic neuron to the soma of the postsynaptic neuron, a peak emerged.

To estimate the soma size rsoma from data, we perform kernel density estimation with linear kernel form and the bandwidth parameter of 0.2, 0.5, and 1.5 for fly, mouse, and human (dark blue line in Supporting Information Figure S15), and find the location of the peak of this function (rsoma ≈ 2.47μm, 5.34μm, and 7.6μm for fly, mouse, and human respectively, shown in red in Supporting Information Figure S15) (Pedregosa et al., 2011). The fly soma size obtained using our methodology is in excellent agreement with the average of the soma radii provided in the janelia hemibrain dataset https://www.janelia.org/project-team/flyem/hemibrain for the neurons we consider (see the Synaptic Network Construction: Topology section): 2.467μm.

Soma size units define a scale that unifies the three connectomes. For instance, the characteristic distance d0 obtained from the degree and wiring length-preserving maximum entropy model is approximately nine soma sizes across organisms (see the Degree and Wiring Length Preserving Randomization section), and the average distance between synaptically connected neurons is approximately 20 soma sizes (20.27 for fly, 21.19 for mouse, and 20.42 for human). Similarly, the scale of the distance dependence in both connectome and contactome—labeled as dtr and dtrc in Supporting Information Table S1—is of the same order of magnitude for the three organisms.

Contact Network Construction

Establishing synapses between neurons relies on their surfaces being in close spatial proximity. This spatial constraint can be expressed by constructing physical contact networks—contactomes. We obtain the contactomes using the vertices of neuron meshes at lod = 1 for all three organisms. For each pair of neurons, we calculated the smallest pairwise distance dij,min. Then, we applied the distance threshold dij,min < dthr under which more than 99% of the synaptic edges are contained in the contact network, see the magenta line in Supporting Information Figure S8. Rounding up to the nearest nanometer, we get the thresholds of dthr,fly = 40 nm, dthr,mouse = 41 nm, and dthr,human = 46 nm. All the edges representing pairs of neurons at a distance under this distance threshold are assigned to the contact network. Additionally, we add the 1% of the synaptic edges that are not currently contained in the contact network.

As expected from our procedure, the data-driven distance thresholds we obtained are in the order of magnitude of the size of the synaptic clefts in chemical synapses (Zuber, Nikonenko, Klauser, Muller, & Dubochet, 2005). These thresholds are much larger than the size of the intercellular space in gap junctions (Maeda et al., 2009). Thus, contactome edges contain more than one important mode of interneuronal communication. On the other hand, the thresholds we impose are significantly smaller than micrometer-level thresholds in Reimann et al. (2015)—there, the distance corresponds to the linear dimension of the dendritic spines. Even at the strict threshold values we imposed, most of the contactome edges do not correspond to the presence of a chemical synapse, as demonstrated by the network densities in Table 1. The connectome edges comprise 25%, 8%, and 0.8% of the contactome edges in fly, mouse, and human respectively.

The distance dependence in the contactomes is well approximated by an exponential. We estimate the distance scale d0, assuming p(d) ∝ ed/d0, in the three organisms: d0 = 12, 12, and 15 soma sizes for fly, mouse, and human respectively. Remarkably, these distance values are similar to those estimated for the connectome (see the Synaptic Network Construction: Spatial Properties section and Supporting Information Table S1).

The contact networks we constructed are undirected and unweighted, but their construction can be generalized to account for these important structural aspects. For instance, weights could be assigned based on the area of the physical contact or the number of disconnected cell subregions in contact with each other for each pair of cells.

Distance Dependence and Model d

Model d assigns the edge probability for a pair of nodes [i, j] based on the distance between them to match the empirical distance dependence p(d). Specifically, to approximate p(d), we bin the Euclidean distances between the neuron centers of mesh using 50 linear bins. For each bin b = [dmin, dmax], we calculate pb=Nedges,bNpairs,b—the fraction of pairs of neurons at a distance within bin b that are connected by an edge in the empirical connectome. Then, for each pair of neurons [i, j] in the data set, we determine the distance bin b and form an edge with probability pb..

Note that the definition of p(d) we use is different from the p(d) defined in some of the seminal spatial brain network literature (Ercsey-Ravasz et al., 2013; Horvát et al., 2016) formalizing the exponential distance rule (EDR) as a fundamental organizing principle in mammalian brain structure. In that body of work, the distance d is defined as a projection length along axon bundles—while in this manuscript, we consider the Euclidean distance between individual neurons’ centers of mesh (see gray and magenta lines in Supporting Information Figure S16). Additionally, they define p(d) as the distribution of axon length—in contrast, we consider the connection probability for neurons at a distance d, as discussed above. In our case, whether a pair of neurons is considered connected is defined by the presence or absence of synapses between them. In contrast, EDR does not explicitly account for interneuronal connections—instead, the number of axons between brain areas can indirectly account for the number of pairwise connections between corresponding neurons. EDR can be used to create weighted interareal connectomes. Similarly, the neuron-level data we use allows us to construct weighted neural connectomes. We demonstrate the weighted and unweighted distribution of Euclidean distances between pairs of connected neurons in Supporting Information Figure S16, magenta and teal lines. While the tail of these distributions looks similar to that of our distance dependence p(d), the behavior of these distributions is quantitatively different from p(d) at small distances d—namely, the region where the finite size of the experimental volume does not affect the inferred distance dependence (see Supporting Information Figure S9 and caption).

Degree Preserving Model With and Without the Contact Constraint

The entropy of a network ensemble is defined as
(1)
where the network ensemble assigns a probability P(G) to each network G. Maximum entropy network ensembles are a useful tool in network science. Inspired by information theory and statistical physics, they represent our partial knowledge of the network by preserving a set of constraints—for example, degree sequence—without making any assumptions about any other aspects of its structure.
As synaptic network data may be noisy, incomplete, and variable in time due to synaptic plasticity, we capture its structural properties by using the canonical ensemble that preserves network constraints on average. For instance, let soft constraints be the degree sequence k1*,,kN* (model k, referred to as soft configuration model in literature). Then,
(2)
where A(G)ij stands for the elements of the adjacency matrix A of a network G. Another constraint comes from the fact that probabilities P(G) should add up to 1. Maximizing the entropy in Equation (1) with these constraints using the method of Lagrange multipliers (Park & Newman, 2004), we arrive at
(3)
where HGiθikiG=i<jθi+θjAGij is the Hamiltonian, and ZGeHG=i<j1+eθiθj is the partition function. From Equation (2), the explicit expressions for the Lagrange multipliers for the maximum entropy model can be obtained from ki*=1ZZθi. Explicitly,
(4)
where pij is the probability of i and j forming an edge. Note that these edge probabilities are independent of each other—thus, the network ensemble can be sampled by forming each edge ij with probability pij. The parameters θi can be calculated using a simple and efficient iterative scheme with an update rule
(5)
where xieθi, for ki*>0 (Vallarano et al., 2021). If ki*=0, pij = 0 in this ensemble.

Contact constraints can be explicitly incorporated into the maximum entropy framework as hard constraints (model k + c): no edges (synapses) can exist between the nodes (neurons) that are not in physical contact. There, we explicitly take the hard contact constraint into account by forcing pij to be zero where no edge exists in the contact network. Then, the partition function is Z=i<j,ij1+eθiθj, where ij indicates the existence of an edge in the contactome (Kovács et al., 2020). The Lagrange multipliers θi and edge probabilities pij between the nodes in physical contact can then be obtained in the same way as for model k.

Degree and Wiring Length Preserving Randomization

In spatial networks such as the brain, forming and maintaining edges is often associated with a wiring cost (Bullmore & Sporns, 2012). Possibly the simplest cost function is the linear function f(dij) =dij, where dij is the distance between the nodes. Following Halu et al. (2014), in our model k + L we impose soft constraints on the total wiring cost L in addition to preserving the degree distribution Equation (2):
(6)
Maximizing the entropy of the network ensemble (Equation (1)) with constraints (Equation (6) and Equation (2)) using the method of Lagrange multipliers similarly Degree Preserving Model With and Without The Contact Constraint we arrive at
(7)
To identify the parameters d0 and θi (via xieθi), we ran the iterative procedure
(8)
for a range of length scales d0 and found the parameter that preserves the total edge length (error below .01% of the total edge length for all three organisms). The distance dependence is not a soft or hard constraint that is explicitly preserved in this case, but the distance dependence at the optimal d0 value (purple line in Figure 3) is similar to the one obtained from data (dark blue line in Figure 3), especially for the mouse. This suggests that restricting the total wiring length might be an important mechanism in shaping the structure of the connectome and that f(dij) =dij is a meaningful representation of the wiring cost.

Interestingly, the parameter d0 that matches the total cost of edges is similar in the fly, mouse, and human (d0 = 9, 9, and 10 soma size units, respectively). That confirms that soma sizes define a spatial scale relevant to synapse formation.

Network Measures

Here, we discuss the network measures we use to determine how well the models generalize beyond the explicitly built-in features (Dichio & Fallani, 2024). We show the values of these measures for the connectome datasets in Supporting Information Table S4 and compare them to models by plotting the inverse fold change in Supporting Information Figure S1. In this section, instead of the Euclidean distance between the nodes, we use the geodesic distance δij, defined as the length of the paths between nodes i and j that contain the minimal number of edges. For example, if node i is not connected to node j, but they share a common neighbor k, δij = 2.

We use the following measures:

  • Size of the largest connected component (# nodes in LCC in Supporting Information Table S4)—the largest set of nodes connected by paths.

  • Network diameter (Supporting Information Table S4)—the largest shortest distance between the nodes in the network max(δij).

  • Average shortest path (average sh. path in Supporting Information Table S4) refers to the average geodesic distance 1Nijδij.

  • Global efficiency—a quantity related to the harmonic mean of the geodesic distance defined as Eg=1NN1ij1δij.

  • Local efficiency—an average of the global efficiencies of the subgraphs induced by the neighbors of each node, defined as Eloc=1NiEgGi.

Additionally, we use the following network measures related to triadic closure that compare the number of triangles nΔ to the number of triplets nΛ:

  • Transitivity—the ratio of the number of triangles and the number of triplets for the entire network: T=nΔnΛ.

  • Average clustering coefficient (Supporting Information Table S4)—the average C=iCi of the clustering coefficients Ci of individual nodes. The individual clustering coefficients are defined as Ci=nΔinΛi—the ratio of the number of triangles involving node i to the number of pairs of its neighbors. If the node has less than two neighbors (ki < 2), its clustering coefficient is assigned to zero.

The measures we use are standard tools in network neuroscience (Rubinov & Sporns, 2010) and beyond (Latora, Nicosia, & Russo, 2017). Their calculation is implemented in the NetworkX Python package (Hagberg, Swart, & Schult, 2008).

We thank Helen S. Ansell for providing the physical boundaries for the volumetric mouse and human datasets and for valuable discussions. We also thank Márton Pósfai, Ivan Bonamassa, and Bingjie Hao for useful discussions. We gratefully acknowledge the support of the NSF-Simons National Institute for Theory and Mathematics in Biology via grants NSF DMS-2235451 and Simons Foundation MP-TMPS-00005320.

Supporting information for this article is available at https://doi.org/10.1162/netn_a_00428.

Anastasiya Salova: Conceptualization; Formal analysis; Investigation; Methodology; Writing – original draft; Writing – review & editing. István A. Kovács: Conceptualization; Funding acquisition; Investigation; Methodology; Supervision; Writing – original draft; Writing – review & editing.

Anastasiya Salova: NSF DMS, Award ID: DMS-2235451. Simons Foundation (https://dx.doi.org/10.13039/100000893), Award ID: MP-TMPS-00005320.

A repository containing the preprocessed data, model outputs, and model code is available at https://zenodo.org/records/13376416.

Neural connectome:

Is a network where nodes represent individual neurons and edges correspond to the synaptic connections between pairs of nodes.

Physical networks:

Are networks whose nodes and edges are nonoverlapping physical entities embedded in 3D space.

Neural contactome:

Is a network where nodes correspond to individual neurons and edges correspond to neurons being in close enough proximity to form synapses.

Maximum entropy ensembles:

Network ensembles preserve select properties of the network while keeping the rest of its structure maximally random. The ensemble is specified by a probability P(G) of the occurrence of network G.

Soft constraints:

Network constraints that retain the specified network properties (e.g., degree sequence) on average over the network ensemble.

Graphlet (induced subgraph):

A small pattern of connectivity within a larger network. To define a graphlet, both the presence and absence of edges must be specified.

Configuration model:

Is a maximum entropy model that preserves the degree sequence of the network. Here, we use the “soft” configuration model that preserves the average degree sequence over the network ensemble.

Erdős-Rényi model:

Is a network model where each edge has a fixed probability of being present or absent. Here, we use the G(n, p) version where each pair of nodes in a network of size n is assigned an edge with probability p.

Abbott
,
L. F.
,
Bock
,
D. D.
,
Callaway
,
E. M.
,
Denk
,
W.
,
Dulac
,
C.
,
Fairhall
,
A. L.
, …
Van Essen
,
D. C.
(
2020
).
The mind of a mouse
.
Cell
,
182
(
6
),
1372
1376
. ,
[PubMed]
Ahn
,
Y.-Y.
,
Jeong
,
H.
, &
Kim
,
B. J.
(
2006
).
Wiring cost in the organization of a biological neuronal network
.
Physica A: Statistical Mechanics and its Applications
,
367
,
531
537
.
Amaral
,
L. A.
,
Scala
,
A.
,
Barthelemy
,
M.
, &
Stanley
,
H. E.
(
2000
).
Classes of small-world networks
.
Proceedings of the National Academy of Sciences
,
97
(
21
),
11149
11152
. ,
[PubMed]
Ansell
,
H. S.
, &
Kovács
,
I. A.
(
2024
).
Unveiling universal aspects of the cellular anatomy of the brain
.
Communications Physics
,
7
(
1
),
184
.
Arnatkevic̆iūtė,
A.
,
Fulcher
,
B. D.
,
Pocock
,
R.
, &
Fornito
,
A.
(
2018
).
Hub connectivity, neuronal diversity, and gene expression in the Caenorhabditis elegans connectome
.
PLoS Computational Biology
,
14
(
2
),
e1005989
. ,
[PubMed]
Azevedo
,
F. A. C.
,
Carvalho
,
L. R. B.
,
Grinberg
,
L. T.
,
Farfel
,
J. M.
,
Ferretti
,
R. E. L.
,
Leite
,
R. E. P.
, …
Herculano-Houzel
,
S.
(
2009
).
Equal numbers of neuronal and nonneuronal cells make the human brain an isometrically scaled-up primate brain
.
Journal of Comparative Neurology
,
513
(
5
),
532
541
. ,
[PubMed]
Barabási
,
A.-L.
, &
Albert
,
R.
(
1999
).
Emergence of scaling in random networks
.
Science
,
286
(
5439
),
509
512
. ,
[PubMed]
Barabási
,
D. L.
,
Bianconi
,
G.
,
Bullmore
,
E.
,
Burgess
,
M.
,
Chung
,
S.
,
Eliassi-Rad
,
T.
, …
Buzsáki
,
G.
(
2023
).
Neuroscience needs network science
.
Journal of Neuroscience
,
43
(
34
),
5989
5995
. ,
[PubMed]
Barthélemy
,
M.
(
2011
).
Spatial networks
.
Physics Reports
,
499
(
1–3
),
1
101
.
Bassett
,
D. S.
,
Greenfield
,
D. L.
,
Meyer-Lindenberg
,
A.
,
Weinberger
,
D. R.
,
Moore
,
S. W.
, &
Bullmore
,
E. T.
(
2010
).
Efficient physical embedding of topologically complex information processing networks in brains and computer circuits
.
PLoS Computational Biology
,
6
(
4
),
e1000748
. ,
[PubMed]
Bassett
,
D. S.
, &
Sporns
,
O.
(
2017
).
Network neuroscience
.
Nature Neuroscience
,
20
(
3
),
353
364
. ,
[PubMed]
Bassett
,
D. S.
, &
Stiso
,
J.
(
2018
).
Spatial brain networks
.
Comptes Rendus Physique
,
19
(
4
),
253
264
.
Betzel
,
R. F.
,
Griffa
,
A.
,
Hagmann
,
P.
, &
Mišić
,
B.
(
2019
).
Distance-dependent consensus thresholds for generating group-representative structural brain networks
.
Network Neuroscience
,
3
(
2
),
475
496
. ,
[PubMed]
Bianconi
,
G.
(
2009
).
Entropy of network ensembles
.
Physical Review E
,
79
(
3
),
036114
. ,
[PubMed]
Bianconi
,
G.
(
2021
).
Information theory of spatial network ensembles
. In
Handbook on entropy, complexity and spatial dynamics
(pp.
61
96
).
Edward Elgar Publishing
.
Braitenberg
,
V.
, &
Schüz
,
A.
(
1991
).
Peters' rule and White's exceptions
.
Anatomy of the Cortex: Statistics and Geometry
,
109
112
.
Bullmore
,
E.
, &
Sporns
,
O.
(
2009
).
Complex brain networks: Graph theoretical analysis of structural and functional systems
.
Nature Reviews Neuroscience
,
10
(
3
),
186
198
. ,
[PubMed]
Bullmore
,
E.
, &
Sporns
,
O.
(
2012
).
The economy of brain network organization
.
Nature Reviews Neuroscience
,
13
(
5
),
336
349
. ,
[PubMed]
Chen
,
B. L.
,
Hall
,
D. H.
, &
Chklovskii
,
D. B.
(
2006
).
Wiring optimization can relate neuronal structure and function
.
Proceedings of the National Academy of Sciences
,
103
(
12
),
4723
4728
. ,
[PubMed]
Chiang
,
A.-S.
,
Lin
,
C.-Y.
,
Chuang
,
C.-C.
,
Chang
,
H.-M.
,
Hsieh
,
C.-H.
,
Yeh
,
C.-W.
, …
Hwang
,
J.-K.
(
2011
).
Three-dimensional reconstruction of brain-wide wiring networks in Drosophila at single-cell resolution
.
Current Biology
,
21
(
1
),
1
11
. ,
[PubMed]
Chklovskii
,
D. B.
,
Schikorski
,
T.
, &
Stevens
,
C. F.
(
2002
).
Wiring optimization in cortical circuits
.
Neuron
,
34
(
3
),
341
347
. ,
[PubMed]
Dichio
,
V.
, &
Fallani
,
F. D. V.
(
2023
).
Statistical models of complex brain networks: A maximum entropy approach
.
Reports on Progress in Physics
,
86
(
10
). ,
[PubMed]
Dichio
,
V.
, &
Fallani
,
F. D. V.
(
2024
).
Exploration-exploitation paradigm for networked biological systems
.
Physical Review Letters
,
132
(
9
),
098402
. ,
[PubMed]
Dorkenwald
,
S.
,
Matsliah
,
A.
,
Sterling
,
A. R.
,
Schlegel
,
P.
,
Yu
,
S.-C.
,
McKellar
,
C. E.
, …
FlyWire Consortium
.
(
2024
).
Neuronal wiring diagram of an adult brain
.
Nature
,
634
(
8032
),
124
138
. ,
[PubMed]
Elabbady
,
L.
,
Seshamani
,
S.
,
Mu
,
S.
,
Mahalingam
,
G.
,
Schneider-Mizell
,
C.
,
Bodor
,
A. L.
, …
Collman
,
F.
(
2024
).
Perisomatic features enable efficient and dataset wide cell-type classifications across large-scale electron microscopy volumes
.
bioRxiv
.
Ercsey-Ravasz
,
M.
,
Markov
,
N. T.
,
Lamy
,
C.
,
Van Essen
,
D. C.
,
Knoblauch
,
K.
,
Toroczkai
,
Z.
, &
Kennedy
,
H.
(
2013
).
A predictive network model of cerebral cortical connectivity based on a distance rule
.
Neuron
,
80
(
1
),
184
197
. ,
[PubMed]
Fields
,
R. D.
,
Woo
,
D. H.
, &
Basser
,
P. J.
(
2015
).
Glial regulation of the neuronal connectome through local and long-distant communication
.
Neuron
,
86
(
2
),
374
386
. ,
[PubMed]
Fornito
,
A.
,
Arnatkevičiūtė
,
A.
, &
Fulcher
,
B. D.
(
2019
).
Bridging the gap between connectome and transcriptome
.
Trends in Cognitive Sciences
,
23
(
1
),
34
50
. ,
[PubMed]
Fulcher
,
B. D.
, &
Fornito
,
A.
(
2016
).
A transcriptional signature of hub connectivity in the mouse connectome
.
Proceedings of the National Academy of Sciences
,
113
(
5
),
1435
1440
. ,
[PubMed]
Gallo
,
A.
,
Garlaschelli
,
D.
,
Lambiotte
,
R.
,
Saracco
,
F.
, &
Squartini
,
T.
(
2024
).
Testing structural balance theories in heterogeneous signed networks
.
Communications Physics
,
7
(
1
),
154
.
Gushchin
,
A.
, &
Tang
,
A.
(
2015
).
Total wiring length minimization of C. elegans neural network: A constrained optimization approach
.
PLOS ONE
,
10
(
12
),
e0145029
. ,
[PubMed]
Haber
,
A.
,
Wanner
,
A. A.
,
Friedrich
,
R. W.
, &
Schneidman
,
E.
(
2023
).
The structure and function of neural connectomes are shaped by a small number of design principles
.
bioRxiv
.
Hagberg
,
A.
,
Swart
,
P. J.
, &
Schult
,
D. A.
(
2008
).
Exploring network structure, dynamics, and function using NetworkX
.
Los Alamos, NM
:
Los Alamos National Lab (LANL)
.
Halu
,
A.
,
Mukherjee
,
S.
, &
Bianconi
,
G.
(
2014
).
Emergence of overlap in ensembles of spatial multiplexes and statistical mechanics of spatial interacting network ensembles
.
Physical Review E
,
89
(
1
),
012806
. ,
[PubMed]
Hao
,
B.
, &
Kovács
,
I. A.
(
2024
).
Proper network randomization is key to assessing social balance
.
Science Advances
,
10
(
18
),
eadj0104
. ,
[PubMed]
Helmstaedter
,
M.
(
2013
).
Cellular-resolution connectomics: Challenges of dense neural circuit reconstruction
.
Nature Methods
,
10
(
6
),
501
507
. ,
[PubMed]
Herculano-Houzel
,
S.
,
Mota
,
B.
, &
Lent
,
R.
(
2006
).
Cellular scaling rules for rodent brains
.
Proceedings of the National Academy of Sciences
,
103
(
32
),
12138
12143
. ,
[PubMed]
Hiesinger
,
P. R.
, &
Hassan
,
B. A.
(
2018
).
The evolution of variability and robustness in neural development
.
Trends in Neurosciences
,
41
(
9
),
577
586
. ,
[PubMed]
Hildebrand
,
D. G. C.
,
Cicconet
,
M.
,
Torres
,
R. M.
,
Choi
,
W.
,
Quan
,
T. M.
,
Moon
,
J.
, …
Engert
,
F.
(
2017
).
Whole-brain serial-section electron microscopy in larval zebrafish
.
Nature
,
545
(
7654
),
345
349
. ,
[PubMed]
Horvát
,
S.
,
Gămănuț
,
R.
,
Ercsey-Ravasz
,
M.
,
Magrou
,
L.
,
Gămănuț
,
B.
,
Van Essen
,
D. C.
, …
Kennedy
,
H.
(
2016
).
Spatial embedding and wiring cost constrain the functional layout of the cortical network of rodents and primates
.
PLoS Biology
,
14
(
7
),
e1002512
. ,
[PubMed]
Kaiser
,
M.
, &
Hilgetag
,
C. C.
(
2004
).
Modelling the development of cortical systems networks
.
Neurocomputing
,
58–60
,
297
302
.
Karbowski
,
J.
(
2001
).
Optimal wiring principle and plateaus in the degree of separation for cortical neurons
.
Physical Review Letters
,
86
(
16
),
3674
3677
. ,
[PubMed]
Kim
,
M.-S.
,
Kim
,
J.-R.
,
Kim
,
D.
,
Lander
,
A. D.
, &
Cho
,
K.-H.
(
2012
).
Spatiotemporal network motif reveals the biological traits of developmental gene regulatory networks in Drosophila melanogaster
.
BMC Systems Biology
,
6
,
31
. ,
[PubMed]
Kivelä
,
M.
,
Arenas
,
A.
,
Barthelemy
,
M.
,
Gleeson
,
J. P.
,
Moreno
,
Y.
, &
Porter
,
M. A.
(
2014
).
Multilayer networks
.
Journal of Complex Networks
,
2
(
3
),
203
271
.
Kötter
,
R.
(
2004
).
Online retrieval, processing, and visualization of primate connectivity data from the CoCoMac database
.
Neuroinformatics
,
2
(
2
),
127
144
. ,
[PubMed]
Kovács
,
I. A.
,
Barabási
,
D. L.
, &
Barabási
,
A.-L.
(
2020
).
Uncovering the genetic blueprint of the C. elegans nervous system
.
Proceedings of the National Academy of Sciences
,
117
(
52
),
33570
33577
. ,
[PubMed]
Kovács
,
I. A.
,
Luck
,
K.
,
Spirohn
,
K.
,
Wang
,
Y.
,
Pollis
,
C.
,
Schlabach
,
S.
, …
Barabási
,
A.-L.
(
2019
).
Network-based prediction of protein interactions
.
Nature Communications
,
10
(
1
),
1240
. ,
[PubMed]
Lanciego
,
J. L.
, &
Wouterlood
,
F. G.
(
2011
).
A half century of experimental neuroanatomical tracing
.
Journal of Chemical Neuroanatomy
,
42
(
3
),
157
183
. ,
[PubMed]
Latora
,
V.
, &
Marchiori
,
M.
(
2001
).
Efficient behavior of small-world networks
.
Physical Review Letters
,
87
(
19
),
198701
. ,
[PubMed]
Latora
,
V.
,
Nicosia
,
V.
, &
Russo
,
G.
(
2017
).
Complex networks: Principles, methods and applications
.
Cambridge University Press
.
Lizier
,
J. T.
,
Bauer
,
F.
,
Atay
,
F. M.
, &
Jost
,
J.
(
2023
).
Analytic relationship of relative synchronizability to network structure and motifs
.
Proceedings of the National Academy of Sciences
,
120
(
37
),
e2303332120
. ,
[PubMed]
Lynn
,
C. W.
,
Holmes
,
C. M.
, &
Palmer
,
S. E.
(
2024a
).
Emergent scale-free networks
.
PNAS Nexus
,
3
(
7
),
pgae236
. ,
[PubMed]
Lynn
,
C. W.
,
Holmes
,
C. M.
, &
Palmer
,
S. E.
(
2024b
).
Heavy-tailed neuronal connectivity arises from Hebbian self-organization
.
Nature Physics
,
20
,
484
491
.
Maeda
,
S.
,
Nakagawa
,
S.
,
Suga
,
M.
,
Yamashita
,
E.
,
Oshima
,
A.
,
Fujiyoshi
,
Y.
, &
Tsukihara
,
T.
(
2009
).
Structure of the connexin 26 gap junction channel at 3.5 Å resolution
.
Nature
,
458
(
7238
),
597
602
. ,
[PubMed]
Maertens
,
T.
,
Schöll
,
E.
,
Ruiz
,
J.
, &
Hövel
,
P.
(
2021
).
Multilayer network analysis of C. elegans: Looking into the locomotory circuitry
.
Neurocomputing
,
427
,
238
261
.
Markov
,
N. T.
,
Ercsey-Ravasz
,
M.
,
Lamy
,
C.
,
Gomes
,
A. R. R.
,
Magrou
,
L.
,
Misery
,
P.
, …
Kennedy
,
H.
(
2013
).
The role of long-range connections on the specificity of the macaque interareal cortical network
.
Proceedings of the National Academy of Sciences
,
110
(
13
),
5187
5192
. ,
[PubMed]
Markov
,
N. T.
,
Ercsey-Ravasz
,
M. M.
,
Ribeiro Gomes
,
A. R.
,
Lamy
,
C.
,
Magrou
,
L.
,
Vezoli
,
J.
, …
Kennedy
,
H.
(
2014
).
A weighted and directed interareal connectivity matrix for macaque cerebral cortex
.
Cerebral Cortex
,
24
(
1
),
17
36
. ,
[PubMed]
Markov
,
N. T.
,
Misery
,
P.
,
Falchier
,
A.
,
Lamy
,
C.
,
Vezoli
,
J.
,
Quilodran
,
R.
, …
Knoblauch
,
K.
(
2011
).
Weight consistency specifies regularities of macaque cortical networks
.
Cerebral Cortex
,
21
(
6
),
1254
1272
. ,
[PubMed]
Milo
,
R.
,
Shen-Orr
,
S.
,
Itzkovitz
,
S.
,
Kashtan
,
N.
,
Chklovskii
,
D.
, &
Alon
,
U.
(
2002
).
Network motifs: Simple building blocks of complex networks
.
Science
,
298
(
5594
),
824
827
. ,
[PubMed]
Motta
,
A.
,
Berning
,
M.
,
Boergens
,
K. M.
,
Staffler
,
B.
,
Beining
,
M.
,
Loomba
,
S.
, …
Helmstaedter
,
M.
(
2019
).
Dense connectomic reconstruction in layer 4 of the somatosensory cortex
.
Science
,
366
(
6469
),
eaay3134
. ,
[PubMed]
Oh
,
S. W.
,
Harris
,
J. A.
,
Ng
,
L.
,
Winslow
,
B.
,
Cain
,
N.
,
Mihalas
,
S.
, …
Zeng
,
H.
(
2014
).
A mesoscale connectome of the mouse brain
.
Nature
,
508
(
7495
),
207
214
. ,
[PubMed]
Oldham
,
S.
,
Fulcher
,
B. D.
,
Aquino
,
K.
,
Arnatkevičiūtė
,
A.
,
Paquola
,
C.
,
Shishegar
,
R.
, &
Fornito
,
A.
(
2022
).
Modeling spatial, developmental, physiological, and topological constraints on human brain connectivity
.
Science Advances
,
8
(
22
),
eabm6127
. ,
[PubMed]
Park
,
J.
, &
Newman
,
M. E. J.
(
2004
).
Statistical mechanics of networks
.
Physical Review E
,
70
(
6
),
066117
.
Pedregosa
,
F.
,
Varoquaux
,
G.
,
Gramfort
,
A.
,
Michel
,
V.
,
Thirion
,
B.
,
Grisel
,
O.
, …
Duchesnay
,
É.
(
2011
).
Scikit-learn: Machine learning in Python
.
Journal of Machine Learning Research
,
12
,
2825
2830
.
Pete
,
G.
,
Timár
,
Á.
,
Stefánsson
,
S. Ö.
,
Bonamassa
,
I.
, &
Pósfai
,
M.
(
2024
).
Physical networks as network-of-networks
.
Nature Communications
,
15
(
1
),
4882
. ,
[PubMed]
Peters
,
A.
, &
Feldman
,
M. L.
(
1976
).
The projection of the lateral geniculate nucleus to area 17 of the rat cerebral cortex. I. General description
.
Journal of Neurocytology
,
5
(
1
),
63
84
. ,
[PubMed]
Pósfai
,
M.
,
Szegedy
,
B.
,
Bačić
,
I.
,
Blagojević
,
L.
,
Abért
,
M.
,
Kertész
,
J.
, …
Barabási
,
A.-L.
(
2024
).
Impact of physicality on network structure
.
Nature Physics
,
20
,
142
149
.
Pržulj
,
N.
(
2007
).
Biological network comparison using graphlet degree distribution
.
Bioinformatics
,
23
(
2
),
e177
e183
. ,
[PubMed]
Rees
,
C. L.
,
Moradi
,
K.
, &
Ascoli
,
G. A.
(
2017
).
Weighing the evidence in Peters' rule: Does neuronal morphology predict connectivity?
Trends in Neurosciences
,
40
(
2
),
63
71
. ,
[PubMed]
Reimann
,
M. W.
,
King
,
J. G.
,
Muller
,
E. B.
,
Ramaswamy
,
S.
, &
Markram
,
H.
(
2015
).
An algorithm to predict the connectome of neural microcircuits
.
Frontiers in Computational Neuroscience
,
9
,
120
. ,
[PubMed]
Robins
,
G.
,
Pattison
,
P.
,
Kalish
,
Y.
, &
Lusher
,
D.
(
2007
).
An introduction to exponential random graph (p*) models for social networks
.
Social Networks
,
29
(
2
),
173
191
.
Rubinov
,
M.
, &
Sporns
,
O.
(
2010
).
Complex network measures of brain connectivity: Uses and interpretations
.
Neuroimage
,
52
(
3
),
1059
1069
. ,
[PubMed]
Saracco
,
F.
,
Petri
,
G.
,
Lambiotte
,
R.
, &
Squartini
,
T.
(
2022
).
Entropy-based random models for hypergraphs
.
arXiv
.
Scannell
,
J. W.
,
Blakemore
,
C.
, &
Young
,
M. P.
(
1995
).
Analysis of connectivity in the cat cerebral cortex
.
Journal of Neuroscience
,
15
(
2
),
1463
1483
. ,
[PubMed]
Scheffer
,
L. K.
,
Xu
,
C. S.
,
Januszewski
,
M.
,
Lu
,
Z.
,
Takemura
,
S.-Y.
,
Hayworth
,
K. J.
, …
Plaza
,
S. M.
(
2020
).
A connectome and analysis of the adult Drosophila central brain
.
eLife
,
9
,
e57443
. ,
[PubMed]
Schlegel
,
P.
,
Yin
,
Y.
,
Bates
,
A. S.
,
Dorkenwald
,
S.
,
Eichler
,
K.
,
Brooks
,
P.
, …
Jefferis
,
G. S. X. E.
(
2024
).
Whole-brain annotation and multi-connectome cell typing of Drosophila
.
Nature
,
634
(
8032
),
139
152
. ,
[PubMed]
Schneider-Mizell
,
C. M.
,
Bodor
,
A. L.
,
Brittain
,
D.
,
Buchanan
,
J.
,
Bumbarger
,
D. J.
,
Elabbady
,
L.
, …
Maçarico da Costa
,
N.
(
2023
).
Cell-type-specific inhibitory circuitry from a connectomic census of mouse visual cortex
.
bioRxiv
. ,
[PubMed]
Shapson-Coe
,
A.
,
Januszewski
,
M.
,
Berger
,
D. R.
,
Pope
,
A.
,
Wu
,
Y.
,
Blakely
,
T.
, …
Lichtman
,
J. W.
(
2024
).
A petavoxel fragment of human cerebral cortex reconstructed at nanoscale resolution
.
Science
,
384
(
6696
),
eadk4858
. ,
[PubMed]
Smith
,
J. H.
,
Rowland
,
C.
,
Harland
,
B.
,
Moslehi
,
S.
,
Montgomery
,
R. D.
,
Schobert
,
K.
, …
Taylor
,
R.
(
2021
).
How neurons exploit fractal geometry to optimize their network connectivity
.
Scientific Reports
,
11
(
1
),
2332
. ,
[PubMed]
Song
,
S.
,
Sjöström
,
P. J.
,
Reigl
,
M.
,
Nelson
,
S.
, &
Chklovskii
,
D. B.
(
2005
).
Highly nonrandom features of synaptic connectivity in local cortical circuits
.
PLoS Biology
,
3
(
3
),
e68
. ,
[PubMed]
Song
,
Y.
,
Zhou
,
D.
, &
Li
,
S.
(
2021
).
Maximum entropy principle underlies wiring length distribution in brain networks
.
Cerebral Cortex
,
31
(
10
),
4628
4641
. ,
[PubMed]
Stepanyants
,
A.
, &
Chklovskii
,
D. B.
(
2005
).
Neurogeometry and potential synaptic connectivity
.
Trends in Neurosciences
,
28
(
7
),
387
394
. ,
[PubMed]
Telesford
,
Q. K.
,
Simpson
,
S. L.
,
Burdette
,
J. H.
,
Hayasaka
,
S.
, &
Laurienti
,
P. J.
(
2011
).
The brain as a complex system: Using network science as a tool for understanding the brain
.
Brain Connectivity
,
1
(
4
),
295
308
. ,
[PubMed]
The MICrONS Consortium
,
Bae
,
J. A.
,
Baptiste
,
M.
,
Bishop
,
C. A.
,
Bodor
,
A. L.
,
Brittain
,
D.
, …
Zhang
,
C.
(
2023
).
Functional connectomics spanning multiple areas of mouse visual cortex
.
bioRxiv
.
Udvary
,
D.
,
Harth
,
P.
,
Macke
,
J. H.
,
Hege
,
H.-C.
,
de Kock
,
C. P. J.
,
Sakmann
,
B.
, &
Oberlaender
,
M.
(
2022
).
The impact of neuron morphology on cortical network architecture
.
Cell Reports
,
39
(
2
),
110677
. ,
[PubMed]
Vallarano
,
N.
,
Bruno
,
M.
,
Marchese
,
E.
,
Trapani
,
G.
,
Saracco
,
F.
,
Cimini
,
G.
, …
Squartini
,
T.
(
2021
).
Fast and scalable likelihood maximization for exponential random graph models with local constraints
.
Scientific Reports
,
11
(
1
),
15227
. ,
[PubMed]
van den Heuvel
,
M. P.
,
Bullmore
,
E. T.
, &
Sporns
,
O.
(
2016
).
Comparative connectomics
.
Trends in Cognitive Sciences
,
20
(
5
),
345
361
. ,
[PubMed]
Winding
,
M.
,
Pedigo
,
B. D.
,
Barnes
,
C. L.
,
Patsolic
,
H. G.
,
Park
,
Y.
,
Kazimiers
,
T.
, …
Zlatic
,
M.
(
2023
).
The connectome of an insect brain
.
Science
,
379
(
6636
),
eadd9330
. ,
[PubMed]
Witvliet
,
D.
,
Mulcahy
,
B.
,
Mitchell
,
J. K.
,
Meirovitch
,
Y.
,
Berger
,
D. R.
,
Wu
,
Y.
, …
Zhen
,
M.
(
2021
).
Connectomes across development reveal principles of brain maturation
.
Nature
,
596
(
7871
),
257
261
. ,
[PubMed]
Yan
,
G.
,
Vértes
,
P. E.
,
Towlson
,
E. K.
,
Chew
,
Y. L.
,
Walker
,
D. S.
,
Schafer
,
W. R.
, &
Barabási
,
A.-L.
(
2017
).
Network control principles predict neuron function in the Caenorhabditis elegans connectome
.
Nature
,
550
(
7677
),
519
523
. ,
[PubMed]
Yin
,
C.
,
Xiao
,
X.
,
Balaban
,
V.
,
Kandel
,
M. E.
,
Lee
,
Y. J.
,
Popescu
,
G.
, &
Bogdan
,
P.
(
2020
).
Network science characteristics of brain-derived neuronal cultures deciphered from quantitative phase imaging data
.
Scientific Reports
,
10
(
1
),
15078
. ,
[PubMed]
Zingg
,
B.
,
Hintiryan
,
H.
,
Gou
,
L.
,
Song
,
M. Y.
,
Bay
,
M.
,
Bienkowski
,
M. S.
, …
Dong
,
H.-W.
(
2014
).
Neural networks of the mouse neocortex
.
Cell
,
156
(
5
),
1096
1111
. ,
[PubMed]
Zuber
,
B.
,
Nikonenko
,
I.
,
Klauser
,
P.
,
Muller
,
D.
, &
Dubochet
,
J.
(
2005
).
The mammalian central nervous synaptic cleft contains a high density of periodically organized complexes
.
Proceedings of the National Academy of Sciences
,
102
(
52
),
19192
19197
. ,
[PubMed]

Competing Interests

Competing Interests: The authors have declared that no competing interests exist.

Author notes

Handling Editor: Olaf Sporns

This is an open-access article distributed under the terms of the Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. For a full description of the license, please visit https://creativecommons.org/licenses/by/4.0/legalcode.

Supplementary data