HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Event-Scheduling Algorithms with Kalikow Decomposition for Simulating Potentially Infinite Neuronal Networks

Abstract : Event-scheduling algorithms can compute in continuous time the next occurrence of points (as events) of a counting process based on their current conditional intensity. In particular event-scheduling algorithms can be adapted to perform the simulation of finite neuronal networks activity. These algorithms are based on Ogata's thinning strategy [17], which always needs to simulate the whole network to access the behaviour of one particular neuron of the network. On the other hand, for discrete time models, theoretical algorithms based on Kalikow decomposition can pick at random influencing neurons and perform a perfect simulation (meaning without approximations) of the behaviour of one given neuron embedded in an infinite network, at every time step. These algorithms are currently not computationally tractable in continuous time. To solve this problem, an event-scheduling algorithm with Kalikow decomposition is proposed here for the sequential simulation of point processes neuronal models satisfying this decomposition. This new algorithm is applied to infinite neuronal networks whose finite time simulation is a prerequisite to realistic brain modeling.
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-02321497
Contributor : Tien Cuong Phi Connect in order to contact the contributor
Submitted on : Monday, November 30, 2020 - 6:10:40 PM
Last modification on : Wednesday, March 16, 2022 - 3:52:13 AM
Long-term archiving on: : Monday, March 1, 2021 - 7:56:13 PM

File

Phi_Event_scheduling.pdf
Files produced by the author(s)

Identifiers

Citation

Tien Cuong Phi, Alexandre Muzy, Patricia Reynaud-Bouret. Event-Scheduling Algorithms with Kalikow Decomposition for Simulating Potentially Infinite Neuronal Networks. SN Computer Science, Springer, 2020, 1 (1), ⟨10.1007/s42979-019-0039-3⟩. ⟨hal-02321497⟩

Share

Metrics

Record views

311

Files downloads

55