Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

Perfect Simulation of Hawkes Processes

Jesper Møller and Jakob G. Rasmussen
Advances in Applied Probability
Vol. 37, No. 3 (Sep., 2005), pp. 629-646
Stable URL: http://www.jstor.org/stable/30037347
Page Count: 18
  • Read Online (Free)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Perfect Simulation of Hawkes Processes
Preview not available

Abstract

Our objective is to construct a perfect simulation algorithm for unmarked and marked Hawkes processes. The usual straightforward simulation algorithm suffers from edge effects, whereas our perfect simulation algorithm does not. By viewing Hawkes processes as Poisson cluster processes and using their branching and conditional independence structures, useful approximations of the distribution function for the length of a cluster are derived. This is used to construct upper and lower processes for the perfect simulation algorithm. A tail-lightness condition turns out to be of importance for the applicability of the perfect simulation algorithm. Examples of applications and empirical results are presented.

Page Thumbnails

  • Thumbnail: Page 
629
    629
  • Thumbnail: Page 
630
    630
  • Thumbnail: Page 
631
    631
  • Thumbnail: Page 
632
    632
  • Thumbnail: Page 
633
    633
  • Thumbnail: Page 
634
    634
  • Thumbnail: Page 
635
    635
  • Thumbnail: Page 
636
    636
  • Thumbnail: Page 
637
    637
  • Thumbnail: Page 
638
    638
  • Thumbnail: Page 
639
    639
  • Thumbnail: Page 
640
    640
  • Thumbnail: Page 
641
    641
  • Thumbnail: Page 
642
    642
  • Thumbnail: Page 
643
    643
  • Thumbnail: Page 
644
    644
  • Thumbnail: Page 
645
    645
  • Thumbnail: Page 
646
    646