Analyzing self-similar and fractal properties of the C. elegans neural network.
The brain is one of the most studied and highly complex systems in the biological world. While much research has concentrated on studying the brain directly, our focus is the structure of the brain itself: at its core an interconnected network of nodes (neurons). A better understanding of the structural connectivity of the brain should elucidate some of its functional properties. In this paper we analyze the connectome of the nematode Caenorhabditis elegans. Consisting of only 302 neurons, it is one of the better-understood neural networks. Using a Laplacian Matrix of the 279-neuron "giant component" of the network, we use an eigenvalue counting function to look for fractal-like self similarity. This matrix representation is also used to plot visualizations of the neural network in eigenfunction coordinates. Small-world properties of the system are examined, including average path length and clustering coefficient. We test for localization of eigenfunctions, using graph energy and spacial variance on these functions. To better understand results, all calculations are also performed on random networks, branching trees, and known fractals, as well as fractals which have been "rewired" to have small-world properties. We propose algorithms for generating Laplacian matrices of each of these graphs.
Department of Mathematics, University of Connecticut, Storrs, Connecticut, United States of America.
Tyler M
TM
Reese
Antoni
A
Brzoska
Dylan T
DT
Yott
Daniel J
DJ
Kelleher
D000465:Algorithms; D000818:Animals; D017173:Caenorhabditis elegans; D063132:Connectome; D054351:Electrical Synapses; D017709:Fractals; D009415:Nerve Net / Q000502:physiology*; D016571:Neural Networks, Computer; D009434:Neural Pathways / Q000502:physiology; D009474:Neurons; D013569:Synapses