Open the teaching deck, worksheet, and editable slide source.
Interactive Lab
Practice in short loops: checkpoint quiz, microtask decision, and competency progress tracking.
Proofreading Triage Microtask
How should correction queues be prioritized?
Progress Tracker
State is saved locally in your browser for this module.
0% complete
Capability target
Design one hypothesis test with metric, null model, and interpretation boundary statement.
Concept set
1) What makes a connectomics hypothesis testable?
A testable connectomics hypothesis must specify: (a) a structural feature that can be measured from the reconstructed data (e.g., synapse count, motif frequency, path length), (b) a comparison or null expectation (e.g., “more frequent than in a degree-preserving random graph”), and (c) an interpretation boundary (what the result does and does not prove). Many fascinating biological questions (“How does the cortex generate consciousness?”) are not directly testable with connectomics because they lack measurable structural endpoints.
Good hypothesis example: “Reciprocal connections between L2/3 pyramidal cells are enriched ≥2× compared to a degree-preserving null model.” — Measurable (synapse counts), has a null model, makes a specific quantitative prediction.
Poor hypothesis example: “The connectome explains how the brain processes language.” — No measurable endpoint, no null model, no interpretation boundary. This is an aspiration, not a hypothesis.
2) Choosing the right metric
The metric must match the hypothesis. Common connectomics metrics include:
Synapse count (between specific neuron pairs or classes)
Motif frequency (3-node or 4-node subgraph patterns)
Degree distribution (in-degree, out-degree, or total degree)
Path length (shortest path between neuron pairs)
Clustering coefficient (local circuit density)
Convergence/divergence ratio (fan-in vs fan-out)
Metric mismatch trap: Using a global metric (mean degree) to test a local hypothesis (microcircuit-specific wiring rule). The global metric may be normal even if the local pattern is highly abnormal. Always match the metric’s spatial and biological scope to the hypothesis.
3) Null models are the foundation of interpretation
Every connectomics claim requires comparison to a null model. Without a null, you cannot distinguish specific wiring rules from generic statistical properties.
Erdos-Renyi (same density): Too simple — doesn’t preserve degree distribution. Almost everything looks “enriched.”
Degree-preserving rewiring (Maslov & Sneppen 2002): Standard baseline. Preserves each neuron’s in-degree and out-degree.
Spatially constrained: Preserves distance-dependent connection probability. Critical because nearby neurons connect more often simply due to arbor overlap.
Cell-type-stratified: Preserves E→E, E→I, I→E, I→I connection rates. Important because excitatory-inhibitory structure creates motif biases even without specific wiring rules.
Key rule: Use the most stringent null model that is relevant to your claim. If your finding survives the spatially constrained null but not the degree-preserving null, it may reflect spatial proximity rather than specific wiring.
4) Interpretation boundaries: what you can and cannot claim
Structure constrains possible computation but does not determine function. A connectomics result can say “this wiring pattern is consistent with function X” or “this wiring pattern is more common than expected,” but it cannot say “this circuit computes X” without functional evidence. Always state both the supported claim and the explicit non-claim.
Misconception guardrails
Each of these is a belief a learner plausibly holds on arriving. Name it, then check your own work against it.
Misconception guardrail: a significant result against a random-graph null is evidence of biological structure.
Misconception guardrail: the statistical test is the scientific step, when the choice of null model is.
Misconception guardrail: a metric can be chosen after seeing the data without cost to the inference.
Misconception guardrail: reporting the tests that worked is sufficient without reporting how many were run.
Worked example: the feed-forward loop that shrank as the null grew up
The numbers below are illustrative — they show the shape of the reasoning, not results from a specific published dataset.
A student proposes: “Feed-forward loops are enriched in this L4-to-L2/3-to-L5 circuit, supporting a temporal-filtering function.” The dataset is a 300-neuron subgraph with 2,100 directed edges at a stated synapse threshold and a pinned materialization version. Here is how the hypothesis earns, and then loses, its claim.
Step 1 — Make it testable before touching data. As written, the hypothesis has no comparison. Rewrite: “In this subgraph, the A→B, A→C, B→C triad is more frequent than expected under a degree-preserving null.” Now it names a metric (triad count), a null, and implicitly a test. The functional clause — “supporting temporal filtering” — is moved out of the hypothesis and into the interpretation section, where it belongs as a consistency statement, not a claim.
Step 2 — Count, and compare to the weakest null first as a sanity bound. Observed: 84 feed-forward loop instances. An Erdos-Renyi null with matched density expects about 22, a 3.8x enrichment. Write that down as an upper bound on how impressive this can possibly look, and do not report it as a finding — almost everything beats ER in a degree-heterogeneous graph.
Step 3 — Preserve degree. 1,000 degree-preserving rewirings give a null mean of 51 with standard deviation 9. Enrichment drops to 1.6x, z = 3.7. More than half of the apparent effect was degree heterogeneity — a few high-degree neurons participate in many triads by arithmetic alone.
Step 4 — Ask what else the circuit already tells you. The subgraph mixes excitatory and inhibitory types, and E and I populations have different connection rates. A cell-type-stratified null that preserves the E/I connection probabilities expects 78 loops: enrichment 1.08x, z = 0.7. Under the null most relevant to the claim, the effect is gone. The “motif” was mostly type composition: E→E and E→I edges are common enough that loops assemble from them at close to the observed rate.
Step 5 — Count the tests you ran. This loop was one of 16 triad classes examined on the way to the hypothesis. At alpha = 0.05 across 16 correlated tests, even the z = 3.7 result from Step 3 needed correction before being reported, and the honest write-up says 16 tests were run whether or not the other 15 appear in the paper.
What gets reported. The result under all three nulls, in one table, with the sentence: “Feed-forward loop frequency is consistent with degree distribution and cell-type composition; we find no evidence of additional loop-specific wiring.” The explicit non-claim: this does not show the circuit lacks temporal filtering — function was never measured — and it does not rule out enrichment within a single cell type, which would need a within-type test the sample may be too small to power.
Why this is a good outcome. A negative result against a strong null constrains the space of wiring rules the field needs to explain. The same reasoning applied to reciprocity, with the full null-model machinery, is worked in Technical Unit 09; this module’s job is the design discipline that makes such a result trustworthy either way.
Core workflow
Define question and estimand: what structural feature would constrain or inform the biological question?
Choose measurable outputs: specific metric(s) computed from the connectome graph.
Select null model: the most stringent null relevant to the claim.
Test and interpret results: compute metric, compare to null distribution, compute z-score and p-value.
Document supported vs unsupported claims: what the result proves, what it doesn’t, and what additional evidence would be needed.
60-minute tutorial run-of-show
Pre-class preparation (10 min async)
Read the motif analysis content library entry (focus on null models section)
Draft one biological question you’d like to test with connectomics data
Minute-by-minute plan
**00:00-08:00
Framing: good vs bad hypotheses**
Show 4 example hypotheses (2 good, 2 poor). Group identifies which are testable and why.
Each learner drafts a hypothesis using a template:
“In [dataset/region], [structural feature] is [comparison] compared to [null model].”
“This would support [interpretation] but would NOT prove [over-claim].”
Peer review: partner evaluates whether the hypothesis is testable.
**20:00-34:00
Metric and null model selection**
For each drafted hypothesis, select the appropriate metric and null model.
Instructor walks through one example end-to-end: hypothesis → metric → null → expected result → interpretation.
Discussion: “What happens if you use the wrong null model?” Show how the same data looks significant or non-significant depending on null choice.
**34:00-46:00
Interpretation workshop**
Present 3 pre-computed results (with p-values and z-scores). For each, learners write:
Supported claim (what the data shows)
Explicit non-claim (what the data does NOT show)
One confound that could explain the result
Group discussion of each result.
**46:00-60:00
Competency check**
Each learner submits their final hypothesis with metric, null model, and interpretation boundaries.
Exit ticket: “Write one claim and one explicit non-claim from the same test outcome.”
Studio activity: hypothesis design and peer critique (60-75 minutes)
Scenario: Your lab is planning a study of feedforward vs feedback connectivity in mouse visual cortex using the MICrONS dataset. You need to design three testable hypotheses about the circuit architecture.
Task sequence:
Draft 3 hypotheses (one about feedforward connections, one about feedback connections, one about reciprocal connections).
For each: specify the metric, null model, required dataset version, and analysis code outline.
For each: write the supported claim and explicit non-claim.
Exchange with a partner. Critique their null model choices and interpretation boundaries.
Peer critique notes (minimum 2 substantive comments per hypothesis).
Revised hypotheses incorporating feedback.
Assessment rubric
Minimum pass
At least 2 of 3 hypotheses name a measurable structural endpoint, a specific comparison, and a null model — a reader could run the test from the sheet alone.
Each testable hypothesis states one supported claim and one explicit non-claim, and the two are different in content, not restatements.
The metric’s scope (local vs global, per-pair vs per-population) matches the scope of the hypothesis it tests.
The required dataset version is stated for each hypothesis.
Strong performance
Null model choice is justified in words: the “uninteresting explanation” the null encodes is written out before the test is described.
At least one hypothesis is evaluated under two nulls of different stringency, with a prediction of how the effect size should move.
The analysis plan states how many tests will be run and names the correction, including tests that may go unreported.
Peer critique identifies at least one genuine weakness per hypothesis (a confound, an over-claim, a metric mismatch), and the revision visibly responds to it.
Common failure to flag
Vague hypothesis without measurable endpoint (“we will study connectivity patterns”).
Missing or default null model — Erdos-Renyi used where degree structure obviously matters.
A functional claim (“this circuit computes X”) stated as the hypothesis rather than as an interpretation boundary.
Common errors and how to recover
Your hypothesis survives review but cannot be tested from the sheet. If a colleague cannot state what number will be computed and what it will be compared against, the hypothesis is still an aspiration. Recover by forcing it into the template — “in [dataset], [metric] is [comparison] relative to [null]” — and moving everything that does not fit into the interpretation section.
The result is significant against Erdos-Renyi and you want to stop there. Almost everything is. Recover by re-testing against a degree-preserving null as the minimum, adding spatial or cell-type constraints when the claim requires them, and reporting the effect size under each null so the reader sees how much survives.
You chose the metric after looking at the data. The inference is now conditioned on the peek, and the nominal p-value is wrong. Recover by declaring the analysis exploratory, then confirming on held-out data — a different region, a different animal, or a pre-registered re-test on the next data release — before claiming the result.
You ran a dozen variants and reported the one that worked. No correction can repair this after the fact. Recover by listing every variant actually run, applying the correction across all of them, and reporting the survivors; if none survive, the honest write-up says so and states what sample size would be needed.
The result flips between two reasonable null models. This is information, not a nuisance. Recover by reporting both, and stating in words what the stricter null controls for — the flip usually means the effect is real but explained by degree, distance, or type composition rather than by a specific wiring rule.
What this module does not cover
Null-model construction and the triad census in full. Rewiring algorithms, distance-preserving nulls, permutation inference, and the complete worked reciprocity example are Technical Unit 09 and Motif analysis.
Building the graph you will test. Node, edge, threshold, and inclusion decisions — each of which changes the answer — are Module 10 and Graph representations.
How reconstruction error biases the test. Merge errors inflate dense motifs asymmetrically; the error-sensitivity simulation belongs to Module 11 and Technical Unit 09.
Claim discipline at the framing stage. What connectomics can answer at all, and the claim-bin vocabulary this module leans on, is Technical Unit 01.
Statistical theory. Power analysis for graph statistics and formal random-graph theory are assumed background or deferred to the references; this module teaches design discipline, not derivations.