Algorithms for structural and dynamical polychronous groups detection - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Algorithms for structural and dynamical polychronous groups detection


Polychronization has been proposed as a possible way to investigate the notion of cell assemblies and to understand their role as memory supports for information coding. In a spiking neuron network, polychronous groups (PGs) are small subsets of neurons that can be activated in a chain reaction according to a specific time-locked pattern. PGs can be detected in a neural network with known connection delays and visualized on a spike raster plot. In this paper, we specify the definition of PGs, making a distinction between structural and dynamical polychronous groups. We propose two algortihms to scan for structural PGs supported by a given network topology, one based on the distribution of connection delays and the other taking into account the synaptic weight values. At last, we propose a third algorithm to scan for the PGs that are actually activated in the network dynamics during a given time window.
Fichier principal
Vignette du fichier
versionHAL.pdf (123.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00425514 , version 1 (11-12-2010)


  • HAL Id : inria-00425514 , version 1


Regis Martinez, Hélène Paugam-Moisy. Algorithms for structural and dynamical polychronous groups detection. ICANN'2009, International Conference on Artificial Neural Networks, IEEE - INNS, Sep 2009, Limassol, Cyprus. pp.75-84. ⟨inria-00425514⟩
239 View
209 Download


Gmail Facebook X LinkedIn More