Rare Event Simulation for Processes Generated via SFPE

RESSFPE :: Rare Event Simulation for Processes Generated via SFPE

RESSFPE implements the importance sampling algorithm for estimating rare event probabilies arising from stochastic fixed point equations, as described in Collamore, Diao, and Vidyashankar ( Annals of Applied Probability, 2013).

General Information

The program is written in C language. Executable file for Linux/Mac platform is available in the download section below.

Usage

On Linux systems:

res_sfpe_linux

On Mac systems:

res_sfpe_mac

Input

The program implements the importance sampling algorithm for estimating the tail probabilities for three types of processes: (1) ruin problem with stochastic investments; (2) ARCH(1); and (3) GARCH(1,1).

In the ruin problem with stochastic investment, we consider the following SFPE

$V_n=(A_nV_{n-1}+B_n)^+, \ \ n=1,2,...,$

$\text{where }A_n = \exp\left\{-\left(\mu - \frac{\sigma^2}{2} \right)-\sigma\zeta_n \right\}, B_n = -1 + \sum_{i=1}^{N_n} \eta_i, \{\zeta_n\} \text{ is an i.i.d. Gaussian sequence with mean 0 and variance 1},$

$\{N_n\} \text{ is a sequence of Poisson process with intensity } \lambda_B, \text{ and }\{\eta_i\} \text{ is a sequence of exponential processes with mean }\lambda_D.$
The ARCH(1) process is modeled by by the recurrence equation

$V_n=A_nV_{n-1}+B_n, \ \ n=1,2,...,$

$\text{where }A_n = b\zeta_n^2 \text{ and } B_n = a\zeta_n^2, \text{ and } \{\zeta_n\} \text{ is an i.i.d. Gaussian sequence with mean 0 and variance 1.}$
The GARCH(1,1) process is modeled by by the recurrence equation

$V_n=A_nV_{n-1}+B_n, \ \ n=1,2,...,$

$\text{where }A_n = b_1+a_1\zeta_n^2 \text{ and } B_n = a_0, \text{ and } \{\zeta_n\} \text{ is an i.i.d. Gaussian sequence with mean 0 and variance 1.}$

Model	Parameters
Ruin problem with investment	$\mu, \sigma, \lambda_B,\lambda_D$
ARCH(1)	$a, b$
GARCH(1,1)	$a_0,a_1,b_1$

Algorithm

To estimate the tail probabily P(V>u), besides the model parameters in the above input section, one also needs to specify: (1) k; (2) n; and (3) u.

Output

Computational results include the adjustment coefficient $\xi$ such that $E[A_n^\xi]=1$ , the tail probability P(V>u) and its 95% confidence limits, and the relative error.

Example

Download

» res_sfpe_linux

» res_sfpe_mac