title: The connection-set algebra--a novel formalism for the representation of connectivity structure in neuronal network models.
abstract: The connection-set algebra (CSA) is a novel and general formalism for the description of connectivity in neuronal network models, from small-scale to large-scale structure. The algebra provides operators to form more complex sets of connections from simpler ones and also provides parameterization of such sets. CSA is expressive enough to describe a wide range of connection patterns, including multiple types of random and/or geometrically dependent connectivity, and can serve as a concise notation for network structure in scientific writing. CSA implementations allow for scalable and efficient representation of connectivity in parallel neuronal network simulators and could even allow for avoiding explicit representation of connections in computer memory. The expressiveness of CSA makes prototyping of network structure easy. A C+ + version of the algebra has been implemented and used in a large-scale neuronal network simulation (Djurfeldt et al., IBM J Res Dev 52(1/2):31-42, 2008b) and an implementation in Python has been publicly released.
authors.affiliation: School of Computer Science and Communication, KTH, 10044 Stockholm, Sweden. mikael@djurfeldt.com
authors.forename: Mikael
authors.initials: M
authors.lastname: Djurfeldt
mesh_terms: D000465:Algorithms; D000818:Animals; D003198:Computer Simulation; D006801:Humans; D008959:Models, Neurological; D009415:Nerve Net / Q000502:physiology*; D016571:Neural Networks, Computer; D009434:Neural Pathways / Q000502:physiology; D009474:Neurons / Q000502:physiology*; D017711:Nonlinear Dynamics; D013569:Synapses / Q000502:physiology