Exam Questions Flashcards

1
Q

How to compure an embedded jump chain (based on uniformization)?

A
# 1. Choose η s.t. η ≥ sup | Q(i,i)|
2. P = I + 1/η Q

Note: you do not have to say what η is, just how we define it.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

How to compute a pure jump chain?

A

Set all diagonal values to zero, divide all others by the absolute value of the diagonal element (per row).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

How to describe a simulation algorithm of a continuous Markov chain?

A

“We sunulate the embedded jump chain. We let X0=x0 as the initial state, and repeat the following:

  1. Simulate the holding time Tn which is exponentially distributed with mean 1/η
  2. From state i Xn, we reach new state Xn+1 = j from probability distribution P(i, ·).

For all t ≥ 0, Xt=Xn, Σk=0nTk ≤ t ≤ Σk=0n+1Tk​, with T0=0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

How to calculate the variance?

A

Var(x) = E[(x-E(x))(x-E(x))’] (‘ only if matrix)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What are the requirements of ANOVA?

A
  1. Normally distributed data
  2. Equal variances
  3. Y1, …, Yn are independent
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

How to test for equal variances?

A

A statistical test e.g., Levene-test

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What to do after ANOVA suggests different means?

A

Post-hoc analysis, e.g. Tukey test (where you just perform a two-sample test on all pairs of Yi and Yj)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

How to provide a SPSA descent algorithm?

A

A generalized optimization algorithm goes as follows:

θn+1 = θn + εnG(θn)

When using the SPSA descent algorithm we choose εn = 1 / (n + 1), and (G(θn))i = - (J(θn + ηnΔn) - J(θn - ηnΔn))/(2ηnΔn(i)), i = 0, 1, 2, .., k

We need to choose an ηn s.t.:

∑εk2k2 = Σ 1/ ((k+ 1)ηk2)≤∞

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What are the requirements of Δk(i) of the SPSA?

A

Δk(i) and 1/Δk(i) need to be bounded, symmetric around zero and mutually independent.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

How to describe the clock structure of a DES model?

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

How to check the mean of a RNG?

A
  1. Get SE = sqrt(Var(x)/n)
  2. Get 95% (or other) conf. interval (xbar - 1.96SE, xbar + 1.96SE)
  3. Check if 0.5 in the interval.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Try to generate a random standard normal distribution

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

λ from an exponential distribution

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

How to calculate the sample variance of a bernoulli distribution, with just the sample mean?

A

S2 = n /(n-1) Ybar(1 - Ybar)

17
Q
A
18
Q
A

Note: important to use t-dist.

19
Q
A
20
Q
A
21
Q

How to compute a Euler scheme? How to get an algorithm?

A

Set dt := h, dX(t) := X(t + h) - X(t), (and somtimes useful dW(t) = Zsqrt(h), where Z ~ N(0, 1)).

Solve for X(t + h). If you need an algorithm, then simulate while T≥t.

22
Q

How to construct a replicating portefolio?

A

Set

Δbest value + (1+r)b = besvt value - strike price (K)

Δworst value + (1 +r )b = 0 (usually or worst value - K if larger then 0)

23
Q

How to verify the no arbitrage policy?

A

Compute the profit in best case, and worst case. Note that always it is exactly possible to pay all parties involved.

24
Q

How to compute option prices using the risk-neutral probability?

A

best price = u S0 => u = best price / current price (S0)

worst price = d S0 => d = worst price / current price (S0​)

p* = (1 + r - d)/(u-d)

Thus C = 1/(1+r) E*[(S1-K)+] = p* · (best price - strike price(K))