Simulating level-crossing probabilities by importance sampling

1992 ◽  
Vol 24 (4) ◽  
pp. 858-874 ◽  
Author(s):  
T. Lehtonen ◽  
H. Nyrhinen

Let X1, X2, · ·· be independent and identically distributed random variables such that ΕΧ1 < 0 and P(X1 ≥ 0) ≥ 0. Fix M ≥ 0 and let T = inf {n: X1 + X2 + · ·· + Xn ≥ M} (T = +∞, if for every n = 1,2, ···). In this paper we consider the estimation of the level-crossing probabilities P(T <∞) and , by using Monte Carlo simulation and especially importance sampling techniques. When using importance sampling, precision and efficiency of the estimation depend crucially on the choice of the simulation distribution. For this choice we introduce a new criterion which is of the type of large deviations theory; consequently, the basic large deviations theory is the main mathematical tool of this paper. We allow a wide class of possible simulation distributions and, considering the case that M →∞, we prove asymptotic optimality results for the simulation of the probabilities P(T <∞) and . The paper ends with an example.

1992 ◽  
Vol 24 (04) ◽  
pp. 858-874 ◽  
Author(s):  
T. Lehtonen ◽  
H. Nyrhinen

Let X 1, X 2, · ·· be independent and identically distributed random variables such that ΕΧ 1 &lt; 0 and P (X 1 ≥ 0) ≥ 0. Fix M ≥ 0 and let T = inf {n: X 1 + X 2 + · ·· + Xn ≥ M} (T = +∞, if for every n = 1,2, ···). In this paper we consider the estimation of the level-crossing probabilities P (T &lt;∞) and , by using Monte Carlo simulation and especially importance sampling techniques. When using importance sampling, precision and efficiency of the estimation depend crucially on the choice of the simulation distribution. For this choice we introduce a new criterion which is of the type of large deviations theory; consequently, the basic large deviations theory is the main mathematical tool of this paper. We allow a wide class of possible simulation distributions and, considering the case that M →∞, we prove asymptotic optimality results for the simulation of the probabilities P (T &lt;∞) and . The paper ends with an example.


1994 ◽  
Vol 31 (2) ◽  
pp. 373-382 ◽  
Author(s):  
Harri Nyrhinen

Let Y1, Y2, · ·· be a stochastic process and M a positive real number. Define TM = inf{n | Yn > M} (TM = + ∞ if for n = 1, 2, ···)· We are interested in the probabilities P(TM <∞) and in particular in the case when these tend to zero exponentially fast when M tends to infinity. The techniques of large deviations theory are used to obtain conditions for this and to find out the rate of convergence. The main hypotheses required are given in terms of the generating functions associated with the process (Yn).


1994 ◽  
Vol 31 (02) ◽  
pp. 373-382 ◽  
Author(s):  
Harri Nyrhinen

Let Y 1, Y 2, · ·· be a stochastic process and M a positive real number. Define TM = inf{n | Yn &gt; M} (TM = + ∞ if for n = 1, 2, ···)· We are interested in the probabilities P(TM &lt;∞) and in particular in the case when these tend to zero exponentially fast when M tends to infinity. The techniques of large deviations theory are used to obtain conditions for this and to find out the rate of convergence. The main hypotheses required are given in terms of the generating functions associated with the process (Yn ).


2013 ◽  
Vol 25 (2) ◽  
pp. 418-449 ◽  
Author(s):  
Matthew T. Harrison

Controlling for multiple hypothesis tests using standard spike resampling techniques often requires prohibitive amounts of computation. Importance sampling techniques can be used to accelerate the computation. The general theory is presented, along with specific examples for testing differences across conditions using permutation tests and for testing pairwise synchrony and precise lagged-correlation between many simultaneously recorded spike trains using interval jitter.


Sign in / Sign up

Export Citation Format

Share Document