Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-14T19:59:37.447Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  29 November 2018

Marco Oesting*
Affiliation:
University of Siegen
Kirstin Strokorb*
Affiliation:
Cardiff University
*
* Postal address: Department of Mathematics, University of Siegen, 57072 Siegen, Germany. Email address: oesting@mathematik.uni-siegen.de
** Postal address: School of Mathematics, Cardiff University, Cardiff CF24 4AG, UK. Email address: strokorbk@cardiff.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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 study to what extent simulation accuracy and efficiency can be 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 directions: (i) making his description of a minimal maximal variance explicit for convex variograms on symmetric domains, and (ii) proving that the same strategy also reduces the maximal variance for a huge class of nonconvex variograms representable through a Bernstein function. A simulation study confirms that our noncostly modification can lead to substantial improvements among Gaussian representations. We also compare it with three other established algorithms.

Information

Type
Original Article
Copyright
Copyright © Applied Probability Trust 2018