Anishchenko Anastasia, Treves Alessandro
Department of Physics, Brown University, Providence, RI 02912, USA.
J Physiol Paris. 2006 Oct;100(4):225-36. doi: 10.1016/j.jphysparis.2007.01.004. Epub 2007 Jan 14.
The metric structure of synaptic connections is obviously an important factor in shaping the properties of neural networks, in particular the capacity to retrieve memories, with which are endowed autoassociative nets operating via attractor dynamics. Qualitatively, some real networks in the brain could be characterized as 'small worlds', in the sense that the structure of their connections is intermediate between the extremes of an orderly geometric arrangement and of a geometry-independent random mesh. Small worlds can be defined more precisely in terms of their mean path length and clustering coefficient; but is such a precise description useful for a better understanding of how the type of connectivity affects memory retrieval? We have simulated an autoassociative memory network of integrate-and-fire units, positioned on a ring, with the network connectivity varied parametrically between ordered and random. We find that the network retrieves previously stored memory patterns when the connectivity is close to random, and displays the characteristic behavior of ordered nets (localized 'bumps' of activity) when the connectivity is close to ordered. Recent analytical work shows that these two behaviors can coexist in a network of simple threshold-linear units, leading to localized retrieval states. We find that they tend to be mutually exclusive behaviors, however, with our integrate-and-fire units. Moreover, the transition between the two occurs for values of the connectivity parameter which are not simply related to the notion of small worlds.
突触连接的度量结构显然是塑造神经网络特性的一个重要因素,特别是对于通过吸引子动力学运行的自联想网络所具有的记忆检索能力而言。定性地说,大脑中的一些真实网络可以被描述为“小世界”,从这个意义上讲,它们的连接结构处于有序几何排列和与几何无关的随机网格这两个极端之间。小世界可以根据其平均路径长度和聚类系数来更精确地定义;但是这样精确的描述对于更好地理解连接类型如何影响记忆检索有用吗?我们模拟了一个位于环上的积分发放单元的自联想记忆网络,网络连接性在有序和随机之间进行参数变化。我们发现,当连接性接近随机时,网络检索先前存储的记忆模式,而当连接性接近有序时,网络表现出有序网络的特征行为(局部“活动峰”)。最近的分析工作表明,这两种行为可以在一个简单阈值线性单元的网络中共存,导致局部检索状态。然而,我们发现对于我们的积分发放单元来说,它们往往是相互排斥的行为。此外,这两种行为之间的转变发生在连接性参数的值上,这些值与小世界的概念并没有简单的关联。