A Joint Graph Inference Case Study: the C.elegans Chemical and Electrical Connectomes

2015/07/30 by Chen, Li, Vogelstein, Joshua T., Lyzinski, Vince +1
#Applications (stat.AP) #FOS: Biological sciences #FOS: Computer and information sciences #Neurons and Cognition (q-bio.NC)

paper · doi:10.48550/arxiv.1507.08376

Abstract

We investigate joint graph inference for the chemical and electrical connectomes of the Caenorhabditis elegans roundworm. The C.elegans connectomes consist of 253 non-isolated neurons with known functional attributes, and there are two types of synaptic connectomes, resulting in a pair of graphs. We formulate our joint graph inference from the perspectives of seeded graph matching and joint vertex classification. Our results suggest that connectomic inference should proceed in the joint space of the two connectomes, which has significant neuroscientific implications.

Related

• The growing topology of the C. elegans connectome
• Functional Connectomics from Data: Probabilistic Graphical Models for Neuronal Network of C. elegans
• Structual Vulnerability of the Nematode Worm Neural Graph
• Biological connectomes as a representation for the architecture of artificial neural networks
• Discovering Motifs to Fingerprint Multi-Layer Networks: a Case Study on the Connectome of C. Elegans