8.5 Cell assembly enumeration in random graphs

 Page 1 / 4
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.

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 $G$ has a vertex set, $V\left(G\right),$ and a set of edges, $E\left(G\right)\subseteq V\left(G\right)×V\left(G\right).$ If $u,v\in V\left(G\right)$ and $uv\in E\left(G\right),$ 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\in V\left(G\right)$ with respect to $G,$ call it $N\left(v,G\right),$ as $\left\{u:\exists uv\in E\left(G\right)\right\}$ ( [link] ).
• degree: The degree of a vertex $v\in V\left(G\right)$ with respect to $G,$ call it $D\left(v,G\right),$ is $|N\left(v,G\right)|.$
• subgraph: A graph $g$ is a subgraph of $G$ iff $V\left(g\right)\subseteq V\left(G\right)$ and $E\left(g\right)\subseteq E\left(G\right).$ Further, $g$ is an induced subgraph of $G$ iff $g$ is a subgraph of $G$ and $\forall e\in E\left(G\right)\cap \left(V\left(g\right)×V\left(g\right)\right),\phantom{\rule{0.277778em}{0ex}}e\in E\left(g\right).$
• k-core: A subgraph $g$ of $G$ is a $k$ -core iff $\forall v\in V\left(g\right),|X|\ge k,$ where $X=N\left(v\right)\cap V\left(g\right)$ ( [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\left(h\right)|>|V\left(g\right)|.$
• activation: We say that a vertex $v\in V\left(G\right)$ can be either active or inactive. We generally say that, initially, an arbitrary subset of vertices $M\subseteq V\left(G\right)$ are active and the rest inactive. We further define a map ${f}_{k}\left(M,G\right):\left(\text{sets}\phantom{\rule{4.pt}{0ex}}\text{of}\phantom{\rule{4.pt}{0ex}}\text{vertices},\text{graphs}\right)\to \left(\text{sets}\phantom{\rule{4.pt}{0ex}}\text{of}\phantom{\rule{4.pt}{0ex}}\text{vertices}\right)$ which performs the following operation:
• Take a graph $G,$ and a set of vertices, $M,$ where $M\subseteq V\left(G\right).$
• $\forall v\in V\left(G\right)$ :
• let $Y=M\cap N\left(v,G\right)$
• iff $|Y|\ge k,$ then $v\in R$
• Return $R.$
For convenience, we add a superscript ${f}_{k}^{n}\left(M,G\right),$ where ${f}_{k}^{2}\left(M,G\right)={f}_{k}\left({f}_{k}\left(M,G\right),G\right),\phantom{\rule{0.277778em}{0ex}}{f}_{k}^{3}\left(M,G\right)={f}_{k}\left({f}_{k}\left({f}_{k}\left(M,G\right),G\right),G\right),$ 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}\left(M,G\right)$ , is equal to ${f}_{k}^{\infty }\left(M,G\right).$ If ${f}_{k}^{n}\left(M,G\right)$ 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:
• $\forall K$ where $K$ is an induced subgraph of $T$ and a k-core:
• $cl\left(V\left(K\right),G\right)\supseteq V\left(T\right),$ or,
• $cl\left(V\left(T\right)\setminus V\left(K\right),G\right)=\varnothing$
• k-assembly: An induced subgraph $A$ of $G$ is a k-assembly iff $V\left(A\right)=cl\left(V\left(T\right),G\right)$ where $T$ is a k-tight induced subgraph of $G.$

find the 15th term of the geometric sequince whose first is 18 and last term of 387
The given of f(x=x-2. then what is the value of this f(3) 5f(x+1)
hmm well what is the answer
Abhi
how do they get the third part x = (32)5/4
can someone help me with some logarithmic and exponential equations.
20/(×-6^2)
Salomon
okay, so you have 6 raised to the power of 2. what is that part of your answer
I don't understand what the A with approx sign and the boxed x mean
it think it's written 20/(X-6)^2 so it's 20 divided by X-6 squared
Salomon
I'm not sure why it wrote it the other way
Salomon
I got X =-6
Salomon
ok. so take the square root of both sides, now you have plus or minus the square root of 20= x-6
oops. ignore that.
so you not have an equal sign anywhere in the original equation?
hmm
Abhi
is it a question of log
Abhi
🤔.
Abhi
Commplementary angles
hello
Sherica
im all ears I need to learn
Sherica
right! what he said ⤴⤴⤴
Tamia
hii
Uday
what is a good calculator for all algebra; would a Casio fx 260 work with all algebra equations? please name the cheapest, thanks.
a perfect square v²+2v+_
kkk nice
algebra 2 Inequalities:If equation 2 = 0 it is an open set?
or infinite solutions?
Kim
The answer is neither. The function, 2 = 0 cannot exist. Hence, the function is undefined.
Al
y=10×
if |A| not equal to 0 and order of A is n prove that adj (adj A = |A|
rolling four fair dice and getting an even number an all four dice
Kristine 2*2*2=8
Differences Between Laspeyres and Paasche Indices
No. 7x -4y is simplified from 4x + (3y + 3x) -7y
how do you translate this in Algebraic Expressions
Need to simplify the expresin. 3/7 (x+y)-1/7 (x-1)=
. After 3 months on a diet, Lisa had lost 12% of her original weight. She lost 21 pounds. What was Lisa's original weight?
what's the easiest and fastest way to the synthesize AgNP?
China
Cied
types of nano material
I start with an easy one. carbon nanotubes woven into a long filament like a string
Porter
many many of nanotubes
Porter
what is the k.e before it land
Yasmin
what is the function of carbon nanotubes?
Cesar
I'm interested in nanotube
Uday
what is nanomaterials​ and their applications of sensors.
what is nano technology
what is system testing?
preparation of nanomaterial
Yes, Nanotechnology has a very fast field of applications and their is always something new to do with it...
what is system testing
what is the application of nanotechnology?
Stotaw
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
Azam
anybody can imagine what will be happen after 100 years from now in nano tech world
Prasenjit
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
Azam
name doesn't matter , whatever it will be change... I'm taking about effect on circumstances of the microscopic world
Prasenjit
how hard could it be to apply nanotechnology against viral infections such HIV or Ebola?
Damian
silver nanoparticles could handle the job?
Damian
not now but maybe in future only AgNP maybe any other nanomaterials
Azam
Hello
Uday
I'm interested in Nanotube
Uday
this technology will not going on for the long time , so I'm thinking about femtotechnology 10^-15
Prasenjit
can nanotechnology change the direction of the face of the world
At high concentrations (>0.01 M), the relation between absorptivity coefficient and absorbance is no longer linear. This is due to the electrostatic interactions between the quantum dots in close proximity. If the concentration of the solution is high, another effect that is seen is the scattering of light from the large number of quantum dots. This assumption only works at low concentrations of the analyte. Presence of stray light.
the Beer law works very well for dilute solutions but fails for very high concentrations. why?
how did you get the value of 2000N.What calculations are needed to arrive at it
Privacy Information Security Software Version 1.1a
Good
Got questions? Join the online conversation and get instant answers!