<< Chapter < Page Chapter >> Page >
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.



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] .


Node 1 (bright green) has the neighborhood {2, 3, 4, 5} (dark blue)
A k-core for which k=3
The process of closure for k=2: in step 2, an arbitrary 3 vertices are activated. Through each subsequent step, those vertices having at least 2 neighbors in the active set are activated in turn. After step 5, there are no more vertices to activate, so the vertices highlighted in step 5. are the closure of the vertices highlighted in step 2.

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 G has a vertex set, V ( G ) , and a set of edges, E ( G ) V ( G ) × V ( G ) . If u , v V ( G ) and u v E ( G ) , we say that the graph G has an edge directed from the vertex u toward the vertex v . Vertices are labeled with integers by convention.
  • neighborhood: We define the neighborhood of some vertex v V ( G ) with respect to G , call it N ( v , G ) , as { u : u v E ( G ) } ( [link] ).
  • degree: The degree of a vertex v V ( G ) with respect to G , call it D ( v , G ) , is | N ( v , G ) | .
  • subgraph: A graph g is a subgraph of G iff V ( g ) V ( G ) and E ( g ) E ( G ) . Further, g is an induced subgraph of G iff g is a subgraph of G and e E ( G ) ( V ( g ) × V ( g ) ) , e E ( g ) .
  • k-core: A subgraph g of G is a k -core iff v V ( g ) , | X | k , where X = N ( v ) V ( g ) ( [link] ).
  • minimal k-core A subgraph g of G is a minimal k-core iff it has no induced subgraphs which are k-cores.
  • maximum k-core A subgraph g of G is a maximum k-core iff G contains no k-cores h for which the | V ( h ) | > | V ( g ) | .
  • activation: We say that a vertex v V ( G ) can be either active or inactive. We generally say that, initially, an arbitrary subset of vertices M V ( G ) are active and the rest inactive. We further define a map f k ( M , G ) : ( sets of vertices , graphs ) ( sets of vertices ) which performs the following operation:
    • Take a graph G , and a set of vertices, M , where M V ( G ) .
    • v V ( G ) :
      • let Y = M N ( v , G )
      • iff | Y | k , then v R
    • Return R .
    For convenience, we add a superscript f k n ( M , G ) , where f k 2 ( M , G ) = f k ( f k ( M , G ) , G ) , f k 3 ( M , G ) = f k ( f k ( f k ( M , G ) , G ) , G ) , etc.
  • closure: We say that the closure of a set of active nodes M with respect to the graph G , call it c l k ( M , G ) , is equal to f k ( M , G ) . If f k n ( M , G ) does not converge for some sufficiently large n , then the closure of M is undefined ( [link] ).
  • k-tight: A k-core T , which is an induced subgraph of G , is k-tight iff it satisfies the following condition:
    • K where K is an induced subgraph of T and a k-core:
      • c l ( V ( K ) , G ) V ( T ) , or,
      • c l ( V ( T ) V ( K ) , G ) =
  • k-assembly: An induced subgraph A of G is a k-assembly iff V ( A ) = c l ( V ( T ) , G ) where T is a k-tight induced subgraph of G .

Questions & Answers

do you think it's worthwhile in the long term to study the effects and possibilities of nanotechnology on viral treatment?
Damian Reply
absolutely yes
how to know photocatalytic properties of tio2 nanoparticles...what to do now
Akash Reply
it is a goid question and i want to know the answer as well
characteristics of micro business
Do somebody tell me a best nano engineering book for beginners?
s. Reply
what is fullerene does it is used to make bukky balls
Devang Reply
are you nano engineer ?
fullerene is a bucky ball aka Carbon 60 molecule. It was name by the architect Fuller. He design the geodesic dome. it resembles a soccer ball.
what is the actual application of fullerenes nowadays?
That is a great question Damian. best way to answer that question is to Google it. there are hundreds of applications for buck minister fullerenes, from medical to aerospace. you can also find plenty of research papers that will give you great detail on the potential applications of fullerenes.
what is the Synthesis, properties,and applications of carbon nano chemistry
Abhijith Reply
Mostly, they use nano carbon for electronics and for materials to be strengthened.
is Bucky paper clear?
so some one know about replacing silicon atom with phosphorous in semiconductors device?
s. Reply
Yeah, it is a pain to say the least. You basically have to heat the substarte up to around 1000 degrees celcius then pass phosphene gas over top of it, which is explosive and toxic by the way, under very low pressure.
Do you know which machine is used to that process?
how to fabricate graphene ink ?
for screen printed electrodes ?
What is lattice structure?
s. Reply
of graphene you mean?
or in general
in general
Graphene has a hexagonal structure
On having this app for quite a bit time, Haven't realised there's a chat room in it.
what is biological synthesis of nanoparticles
Sanket Reply
what's the easiest and fastest way to the synthesize AgNP?
Damian Reply
types of nano material
abeetha Reply
I start with an easy one. carbon nanotubes woven into a long filament like a string
many many of nanotubes
what is the k.e before it land
what is the function of carbon nanotubes?
I'm interested in nanotube
what is nanomaterials​ and their applications of sensors.
Ramkumar Reply
what is nano technology
Sravani Reply
what is system testing?
preparation of nanomaterial
Victor Reply
Yes, Nanotechnology has a very fast field of applications and their is always something new to do with it...
Himanshu Reply
good afternoon madam
what is system testing
what is the application of nanotechnology?
In this morden time nanotechnology used in many field . 1-Electronics-manufacturad IC ,RAM,MRAM,solar panel etc 2-Helth and Medical-Nanomedicine,Drug Dilivery for cancer treatment etc 3- Atomobile -MEMS, Coating on car etc. and may other field for details you can check at Google
anybody can imagine what will be happen after 100 years from now in nano tech world
after 100 year this will be not nanotechnology maybe this technology name will be change . maybe aftet 100 year . we work on electron lable practically about its properties and behaviour by the different instruments
name doesn't matter , whatever it will be change... I'm taking about effect on circumstances of the microscopic world
how hard could it be to apply nanotechnology against viral infections such HIV or Ebola?
silver nanoparticles could handle the job?
not now but maybe in future only AgNP maybe any other nanomaterials
I'm interested in Nanotube
this technology will not going on for the long time , so I'm thinking about femtotechnology 10^-15
how did you get the value of 2000N.What calculations are needed to arrive at it
Smarajit Reply
Privacy Information Security Software Version 1.1a
Berger describes sociologists as concerned with
Mueller Reply
Got questions? Join the online conversation and get instant answers!
QuizOver.com Reply

Get the best Algebra and trigonometry course in your pocket!

Source:  OpenStax, The art of the pfug. OpenStax CNX. Jun 05, 2013 Download for free at http://cnx.org/content/col10523/1.34
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'The art of the pfug' conversation and receive update notifications?