4 citations · 4 across the 2 of their papers we have counts for
3 papers
Efficient Simulation of Sparse Graphs of Point Processes
Cyrille Mascart, Alexandre Muzy, Patricia Reynaud-bouret
We derive new discrete event simulation algorithms for marked time point processes. The main idea is to couple a special structure, namely the associated local independence graph,…
Event-scheduling algorithms with Kalikow decomposition for simulating potentially infinite neuronal networks
Tien Cuong Phi, Alexandre Muzy, Patricia Reynaud-Bouret
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 particul…
Activatability for simulation tractability of NP problems: Application to Ecology
Patrick Coquillard, Alexandre Muzy, Eric Wajnberg
Dynamics of biological-ecological systems is strongly depending on spatial dimensions. Most of powerful simulators in ecology take into account for system spatiality thus embedding…