Rare-event simulation and efficient discretization for the supremum of Gaussian random fields

In this paperweconsider a classic problem concerning the high excursion probabilities of a Gaussian random field f living on a compact set T. We develop efficient computational methods for the tail probabilities ℙ{sup_T f(t) > b}. For each positive ε, we present Monte Carlo algorithms that run in constant time and compute the probabilities with relative error ε for arbitrarily large b. The efficiency results are applicable to a large class of Hölder continuous Gaussian random fields. Besides computations, the change of measure and its analysis techniques have several theoretical and practical indications in the asymptotic analysis of Gaussian random fields.