This article describes a new Monte Carlo method for the evaluation of the orthant probabilities by sampling first passage times of a non-singular Gaussian discrete time-series across an absorbing boundary. This procedure makes use of a simulation of several time-series sample paths, aiming to record their first crossing instants. Thus, the computation of the orthant probabilities is traced back to the accurate simulation of a non-singular Gaussian discrete-time series. Moreover, if the simulation is also efficient, this method is shown to be speedier than the others proposed in the literature. As example, we make use of the Davies–Harte algorithm in the evaluation of the orthant probabilities associated to the ARFIMA(0, d, 0) model. Test results are presented that compare this method with currently available software.
On the connection between orthant probabilities and the first passage time problem.
DI NARDO, Elvira
2005-01-01
Abstract
This article describes a new Monte Carlo method for the evaluation of the orthant probabilities by sampling first passage times of a non-singular Gaussian discrete time-series across an absorbing boundary. This procedure makes use of a simulation of several time-series sample paths, aiming to record their first crossing instants. Thus, the computation of the orthant probabilities is traced back to the accurate simulation of a non-singular Gaussian discrete-time series. Moreover, if the simulation is also efficient, this method is shown to be speedier than the others proposed in the literature. As example, we make use of the Davies–Harte algorithm in the evaluation of the orthant probabilities associated to the ARFIMA(0, d, 0) model. Test results are presented that compare this method with currently available software.File | Dimensione | Formato | |
---|---|---|---|
JSCS2006.pdf
Accesso riservato
Descrizione: Articolo principale
Tipo di file:
PDF EDITORIALE
Dimensione
258.84 kB
Formato
Adobe PDF
|
258.84 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.