DeepAI
Log In Sign Up

Recursive computation of the Hawkes cumulants

12/14/2020
by   Nicolas Privault, et al.
0

We propose a recursive method for the computation of the cumulants of self-exciting point processes of Hawkes type, based on standard combinatorial tools such as Bell polynomials. This closed-form approach is easier to implement on higher-order cumulants in comparison with existing methods based on differential equations, tree enumeration or martingale arguments. The results are corroborated by Monte Carlo simulations, and also apply to the computation of joint cumulants generated by multidimensional self-exciting processes.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/25/2021

An algorithm for the computation of joint Hawkes moments with exponential kernel

The purpose of this paper is to present a recursive algorithm and its im...
09/07/2017

An iterative approximate method of solving boundary value problems using dual Bernstein polynomials

In this paper, we present a new iterative approximate method of solving ...
06/21/2022

D-CIPHER: Discovery of Closed-form PDEs

Closed-form differential equations, including partial differential equat...
10/27/2022

Monte Carlo method for parabolic equations involving fractional Laplacian

We apply the Monte Carlo method to solving the Dirichlet problem of line...
12/12/2022

Fast Learning of Multidimensional Hawkes Processes via Frank-Wolfe

Hawkes processes have recently risen to the forefront of tools when it c...
09/04/2020

A Generalization of Spatial Monte Carlo Integration

Spatial Monte Carlo integration (SMCI) is an extension of standard Monte...