This report summarizes work done as part of the Computational Neuroscience PFUG under Rice University's VIGRE program. VIGRE is a program of Vertically Integrated Grants for Research and Education in the Mathematical Sciences under the direction of the National Science Foundation. A PFUG is a group of Postdocs, Faculty, Undergraduates and Graduate students formed round the study of a common problem. This module reproduces the work G. Palm "Towards a Theory of Cell Assemblies". This work was studied in the Rice University VIGRE/REU program in the Summer of 2010. This module builds an algorithm to find cell assemblies by Palm's definition and discusses some preliminary employment of that algorithm.
Introduction
History
Models of individual neurons vary in complexity, but in general, neurons tend to behave like this:
A neuron is either excited or not excited.
When excited, a neuron will stimulate neurons to which it has an outgoing connection. Otherwise, it will not stimulate other neurons.
A neuron becomes excited when it receives a sufficient amount of stimulation from other neurons.
When modeling the brain, see seek to model the collective behavior of neurons. The fundamental type of collective behavior is, by the Donald Hebb model of the brain, the cell assembly.
First introduced by Hebb, the cell assembly is, "a diffuse structure comprising cells... capable of acting briefly as a closed system, delivering facilitation to other such systems and usually having a specific motor facilitation"
[link] . A cell assembly is a particular arrangement of a group of neurons with certain properties. The most salient of these properties is that a certain fractional portion of the assembly will excite the entire assembly.
By Hebb's proposal, a cell assembly represents a single concept in the brain. For instance, Hebb proposes that the corner of an abstract triangle may be represented by a cell assembly
[link]
Since Hebb first discussed the concept of a cell assembly, there has been some amount of biological research supporting his ideas. For instance, the work of György Buzsáki suggests that groups of cells that fire during a given time period are correlated
[link] .
Definitions
Gunther Palm defined Hebb's assembly in the concrete language of graph theory
[link] . In brief, Palm's discussion constructs, or depends upon, the following definitions:
graph: A graph
has a vertex set,
and a set of edges,
If
and
we say that the graph
has an edge directed from the vertex
toward the vertex
Vertices are labeled with integers by convention.
neighborhood: We define the neighborhood of some vertex
with respect to
call it
as
(
[link] ).
degree: The degree of a vertex
with respect to
call it
is
subgraph: A graph
is a subgraph of
iff
and
Further,
is an induced subgraph of
iff
is a subgraph of
and
k-core: A subgraph
of
is a
-core iff
where
(
[link] ).
minimal k-core A subgraph
of
is a minimal k-core iff it has no induced subgraphs which are k-cores.
maximum k-core A subgraph
of
is a maximum k-core iff
contains no k-cores
for which the
activation: We say that a vertex
can be either active or inactive. We generally say that, initially, an arbitrary subset of vertices
are active and the rest inactive. We further define a map
which performs the following operation:
Take a graph
and a set of vertices,
where
:
let
iff
then
Return
For convenience, we add a superscript
where
etc.
closure: We say that the closure of a set of active nodes
with respect to the graph
call it
, is equal to
If
does not converge for some sufficiently large
then the closure of
is undefined (
[link] ).
k-tight: A k-core
which is an induced subgraph of
is k-tight iff it satisfies the following condition:
where
is an induced subgraph of
and a k-core:
or,
k-assembly: An induced subgraph
of
is a k-assembly iff
where
is a k-tight induced subgraph of