Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Kalikow decomposition for counting processes with stochastic intensity and application to simulation algorithms

Abstract : We propose a new Kalikow decomposition for continuous time multivariate counting processes, on potentially infinite networks. We prove the existence of such a decomposition in various cases. This decomposition allows us to derive simulation algorithms that hold either for stationary processes with potentially infinite network but bounded intensities, or for processes with unbounded intensities in a finite network and with empty past before 0. The Kalikow decomposition is not unique and we discuss the choice of the decomposition in terms of algorithmic efficiency in certain cases.We apply these methods on several examples: linear Hawkes process, age dependent Hawkes process, exponential Hawkes process, Galves-Löcherbach process.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03188536
Contributor : Tien Cuong PHI Connect in order to contact the contributor
Submitted on : Monday, May 2, 2022 - 12:39:20 PM
Last modification on : Friday, May 6, 2022 - 4:50:07 PM

File

PLR_Kalikow_decomposition_simu...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03188536, version 2

Citation

Tien Cuong Phi, Patricia Reynaud-Bouret, Eva Löcherbach. Kalikow decomposition for counting processes with stochastic intensity and application to simulation algorithms. 2022. ⟨hal-03188536v2⟩

Share

Metrics

Record views

100

Files downloads

58