Skip to content
The Lumenary

Each worksheet prints cleanly on A4 or Letter. Answer keys are on a separate page.

The Lumenary · First-year graduate

Stochastic processes

Name: ______________________

Date: ______________________

You will learn to

  • Construct the Poisson process from exponential waiting times and derive its Poisson counts, independent increments and memorylessness
  • Describe a continuous-time Markov chain by its generator and solve Kolmogorov's forward and backward equations in simple cases
  • State the defining properties of Brownian motion and prove its basic path properties — scaling, martingales, quadratic variation, infinite variation and nowhere differentiability
  • Prove Itô's isometry, compute the integral of B dB, and use Itô's formula to solve the equations of geometric Brownian motion and the Ornstein–Uhlenbeck process
  1. 1.

    Let BB be a standard Brownian motion. Compute Var⁡(B3−B1)+E[B2B5]\operatorname{Var}(B_3 - B_1) + \mathbb E[B_2 B_5].

  2. 2.

    Requests reach a server in Nairobi as a Poisson process of rate 22 per minute. Given that exactly 1010 requests arrived in the first 55 minutes, what is the expected number of requests in the first 88 minutes?

  3. 3.

    Which of these processes are martingales with respect to the natural filtration of a standard Brownian motion BB? Select all that apply.

    • A.Bt2−tB_t^2 - t
    • B.Bt3−3tBtB_t^3 - 3 t B_t
    • C.exp⁡(Bt−t/2)\exp(B_t - t/2)
    • D.exp⁡(Bt)\exp(B_t)
    • E.Bt2B_t^2
    • F.Bt3B_t^3
  4. 4.

    Compute E[(∫04Bs dBs)2]\mathbb E\Big[\Big(\int_0^4 B_s \, dB_s\Big)^2\Big].

  5. 5.

    Which equation is correct for Xt=Bt2X_t = B_t^2?

    • A.dXt=2Bt dBtdX_t = 2 B_t \, dB_t
    • B.dXt=2Bt dBt+dtdX_t = 2 B_t \, dB_t + dt
    • C.dXt=2Bt dBt+2 dtdX_t = 2 B_t \, dB_t + 2 \, dt
    • D.dXt=dtdX_t = dt
  6. 6.

    A geometric Brownian motion has μ=0.05\mu = 0.05 and σ=0.4\sigma = 0.4, so St=S0exp⁡((μ−σ2/2)t+σBt)S_t = S_0 \exp\big((\mu - \sigma^2/2) t + \sigma B_t\big). Which statement is true as t→∞t \to \infty?

    • A.ESt→∞\mathbb E S_t \to \infty, and yet St→0S_t \to 0 almost surely.
    • B.St→∞S_t \to \infty almost surely, because μ>0\mu > 0.
    • C.ESt→0\mathbb E S_t \to 0, because typical paths tend to 00.
    • D.StS_t oscillates between 00 and ∞\infty forever.
  7. 7.

    The proof that Brownian paths have infinite variation uses ∑k(ΔBk)2≤max⁡k∣ΔBk∣⋅∑k∣ΔBk∣\sum_k (\Delta B_k)^2 \le \max_k |\Delta B_k| \cdot \sum_k |\Delta B_k| along dyadic partitions of [0,t][0, t]. Which property of Brownian motion guarantees max⁡k∣ΔBk∣→0\max_k |\Delta B_k| \to 0 for each path?

    • A.Continuity of the paths (hence uniform continuity on [0,t][0, t]).
    • B.Independence of the increments.
    • C.The Gaussian distribution of the increments.
    • D.The martingale property.
  8. 8.

    For a real sequence S : ℕ → ℝ, which Lean statement is the discrete Itô formula proved in the lesson?

    • A.∑ k ∈ Finset.range n, S k * (S (k + 1) - S k) = (S n ^ 2 - S 0 ^ 2) / 2 - (∑ k ∈ Finset.range n, (S (k + 1) - S k) ^ 2) / 2
    • B.∑ k ∈ Finset.range n, S k * (S (k + 1) - S k) = (S n ^ 2 - S 0 ^ 2) / 2
    • C.∑ k ∈ Finset.range n, S k * (S (k + 1) - S k) = (S n ^ 2 - S 0 ^ 2) / 2 + (∑ k ∈ Finset.range n, (S (k + 1) - S k) ^ 2) / 2
    • D.∑ k ∈ Finset.range n, S (k + 1) * (S (k + 1) - S k) = (S n ^ 2 - S 0 ^ 2) / 2 - (∑ k ∈ Finset.range n, (S (k + 1) - S k) ^ 2) / 2
  9. 9.

    A pure birth chain on {0,1,2,… }\{0, 1, 2, \dots\} jumps from nn to n+1n + 1 at rate λn\lambda_n (so the holding time in state nn is exponential with mean 1/λn1/\lambda_n). For which rate sequences does the chain make infinitely many jumps in finite time (explode) with probability one? Select all that apply.

    • A.λn=3\lambda_n = 3 (a Poisson process)
    • B.λn=n+1\lambda_n = n + 1
    • C.λn=(n+1)2\lambda_n = (n + 1)^2
    • D.λn=2n\lambda_n = 2^n
  10. 10.

    A path is given by its values path = [S_0, S_1, ..., S_n] on a partition. Write ito_sum(path) (left-point sum of S dSS \, dS), stratonovich_sum(path) (midpoint sum, with 12(Sk+Sk+1)\frac12(S_k + S_{k+1})) and quadratic_variation(path). The tests check them on exact rational paths and verify the discrete Itô and Stratonovich formulas.

    Computational — Practice

Code: Apache-2.0 · Content: CC BY-SA 4.0