Kalikow decomposition for counting processes with stochastic intensity and application to simulation algorithms - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2022

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

Résumé

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.
Fichier principal
Vignette du fichier
PLR_Kalikow_decomposition_simulation.pdf (436.05 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03188536 , version 1 (02-04-2021)
hal-03188536 , version 2 (02-05-2022)

Identifiants

  • HAL Id : hal-03188536 , version 2

Citer

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⟩
180 Consultations
101 Téléchargements

Partager

Gmail Facebook X LinkedIn More