Hostname: page-component-7b7567c8c-q2ksz Total loading time: 0 Render date: 2026-11-15T23:32:14.453Z Has data issue: false hasContentIssue false

Efficient Simulation for the Maximum of Infinite Horizon Discrete-Time Gaussian Processes

Published online by Cambridge University Press:  14 July 2016

Jose Blanchet*
Affiliation:
Columbia University
Chenxin Li*
Affiliation:
Columbia University
*
∗ Postal address: Department of Industrial Engineering and Operations Research, Columbia University, 321 S. W. Mudd, 500 West 120th Street, New York, NY 10027, USA.
∗ Postal address: Department of Industrial Engineering and Operations Research, Columbia University, 321 S. W. Mudd, 500 West 120th Street, New York, NY 10027, USA.
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.

We consider the problem of estimating the probability that the maximum of a Gaussian process with negative mean and indexed by positive integers reaches a high level, say b. In great generality such a probability converges to 0 exponentially fast in a power of b. Under mild assumptions on the marginal distributions of the process and no assumption on the correlation structure, we develop an importance sampling procedure, called the target bridge sampler (TBS), which takes a polynomial (in b) number of function evaluations to achieve a small relative error. The procedure also yields samples of the underlying process conditioned on hitting b in finite time. In addition, we apply our method to the problem of estimating the tail of the maximum of a superposition of a large number, n, of independent Gaussian sources. In this situation TBS achieves a prescribed relative error with a bounded number of function evaluations as n ↗ ∞. A remarkable feature of TBS is that it is not based on exponential changes of measure. Our numerical experiments validate the performance indicated by our theoretical findings.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2011