arXiv Analytics

Sign in

arXiv:1709.06037 [math.PR]AbstractReferencesReviewsResources

Efficient simulation of Brown-Resnick processes based on variance reduction of Gaussian processes

Marco Oesting, Kirstin Strokorb

Published 2017-09-18Version 1

Brown-Resnick processes are max-stable processes that are associated to Gaussian processes. Their simulation is often based on the corresponding spectral representation which is not unique. We show that simulation accuracy and efficiency can be substantially improved by minimizing the maximal variance of the underlying Gaussian process. Such a minimization is a difficult mathematical problem that also depends on the geometry of the simulation domain. We extend Matheron's (1974) seminal contribution in two aspects: (i) making his description of a minimal maximal variance explicit for convex variograms on symmetric domains and (ii) proving that the same strategy reduces the maximal variance also for a huge class of non-convex variograms representable through a Bernstein function. A simulation study confirms that our non-costly modification can lead to substantial improvements and compete with state-of-the-art algorithms.

Comments: 22 pages, 2 figures, 3 tables
Categories: math.PR
Subjects: 60G70, 60G15, 60G60
Related articles: Most relevant | Search more
arXiv:1810.10145 [math.PR] (Published 2018-10-24)
Sojourn times of Gaussian processes with trend
arXiv:2310.00885 [math.PR] (Published 2023-10-02)
Two Types of Gaussian Processes and their Application to Statistical Estimations for Non-ergodic Vasicek Model
arXiv:2001.03405 [math.PR] (Published 2020-01-10)
Gaussian processes with Volterra kernels