arXiv Analytics

Sign in

arXiv:0910.2625 [math.PR]AbstractReferencesReviewsResources

Simulation of infinitely divisible random fields

Wolfgang Karcher, Hans-Peter Scheffler, Evgeny Spodarev

Published 2009-10-14Version 1

Two methods to approximate infinitely divisible random fields are presented. The methods are based on approximating the kernel function in the spectral representation of such fields, leading to numerical integration of the respective integrals. Error bounds for the approximation error are derived and the approximations are used to simulate certain classes of infinitely divisible random fields.

Related articles: Most relevant | Search more
arXiv:1711.05382 [math.PR] (Published 2017-11-15)
Error bounds for Approximations of Markov chains
arXiv:math/0610486 [math.PR] (Published 2006-10-16)
Dirichlet forms in simulation
arXiv:1601.03489 [math.PR] (Published 2016-01-14)
Error Bounds for Last-Block-Column-Augmented Truncations of Block-Structured Markov Chains