A note on a perfect simulation algorithm for marked Hawkes processes

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearch

Abstract

The usual straightforward simulation algorithm for (marked or unmarked) Hawkes processes suffers from edge effect. In this note we describe a perfect simulation algorithm which is partly derived as in Brix and Kendall (2002) and partly using upper and lower processes as in the Propp-Wilson algorithm (1996), or rather as in the dominated CFTP algorithm by Kendall and Moller (2000). Various monotonicity properties and approximations of the cumulative distribution function for the length of a so-called cluster in a marked Hawkes process play an important role.
Original languageEnglish
Title of host publicationProceeding from the international conference on Spatial Point Process Modelling and Its Applications
EditorsBaddeley, Gregori, Mateu, Stoica, Stoyan
PublisherPublicacions de la Universitat Jaume I
Publication date2004
Pages187-192
ISBN (Print)8480214759
Publication statusPublished - 2004
EventInternational Conference on Spatial Point Process Modelling and Its Applications -
Duration: 19 May 2010 → …

Conference

ConferenceInternational Conference on Spatial Point Process Modelling and Its Applications
Period19/05/2010 → …

Keywords

  • marked Hawkes process
  • perfect simulation

Fingerprint

Dive into the research topics of 'A note on a perfect simulation algorithm for marked Hawkes processes'. Together they form a unique fingerprint.

Cite this