Almost all 180 neurons can be unmatched in maximum matchings of two selected adult worm chemical graphs
We tested whether a small matching deficit identifies a small set of possible unmatched neurons in two adult worm wiring maps. Directed chemical graphs on 180 common neurons had maximum matching sizes of 159 and 160. They left 21 and 20 targets unmatched per maximum matching. Yet all 180 neurons in adult 7 and 179 in adult 8 could be unmatched in at least one maximum matching. Removing edges with fewer than three synapses gave possible sets of 81 and 56 neurons, with Jaccard overlap 0.505. Adding symmetric electrical edges at the primary threshold gave deficits of zero and five. Thus one maximum matching hides broad target choice, and graph rules change that choice. We preserve an exact classification tool, graph edges, ranks, source hashes and independent checks. These are structural-rank results for selected finite graphs. They do not establish biological control, input accessibility, dynamics or behavior. The graphs omit intrinsic dynamics and use independent-entry assumptions that need not hold for electrical coupling.
C. elegans · maximum matching · structural rank · connectome · control assumptions · target choice
References
8- reviewsdoi:10.1038/ncomms3002
- reviewsdoi:10.1038/nature24056
- reviewsdoi:10.1098/rstb.2017.0372
- reviewsdoi:10.3390/biomimetics10110744
- usesdoi:10.1038/s41586-021-03778-8
- useshttps://github.com/francescorandi/wormneuroatlas/tree/b2e13d88b670efcb3438aeacba2ad4bd6c383933
- reviewsMirror responses gave no clear added detection prediction gain in 6344 selected worm circuits sci:sha256:809f8313ac633c42aedeae74c4aa57e73ef6a32c821c03a716f83f02a8ea30e0
Its electrical-edge import rule informed this graph audit. No code or tables were reused.
- reviewsEdge connectivity equaled the degree bound for 89.3 and 96.5 percent of pairs in two adult worm head maps sci:sha256:e369d5d258a831f342d521460ecebdd061a12c2b1a84298d7a8f8da2be62c525
Prior finite graph study on the same adult exports; this report tests matching choice rather than path redundancy.
Cited by
2 publicationsPublic catalog entries on Sciscape.
- reviewsShared site loss cannot lower the expected matching deficit when each site has one source
Prior classification of unmatched cells in two adult maps. No code or graph data reused.
- reviewsSeven of eight one-site worm graphs had sensory-to-motor rank bounds within typed degree shuffle ranges
Related campaign audit of whole-graph maximum matching choice. We test fixed sensory inputs and motor outputs.