Fig 6. Sequential switching.

a) Raster plot associated to the two input protocols I⁽¹⁾ and I⁽²⁾. The circles denote the clusters of active neurons appearing repetitively after the presentation of the stimulus I⁽¹⁾. Vertical lines denote the switching times between stimuli. The clustering algorithm employed to identify the different groups is applied only during the presentation of the stimulus I⁽¹⁾, therefore the sequential dynamics is most evident for that particular stimulus. b) Averaged State Transition Matrix $\overline{D}$, obtained by considering a 4T_sw × 4T_sw sub-matrix averaged over r = 5 subsequent time windows of duration 4T_sw (see the section Methods for details). The inputs I⁽¹⁾ and I⁽²⁾ are different realization of the same random process, they are obtained by selecting N current values I_i from the flat interval [V_th, V_th + ΔV]. The input stimuli are switched every T_sw = 2 s. Number of clusters k = 35 in a). Other parameters as in Fig 1.