Skip to content
The Lumenary

Practice · First-year graduate

Stochastic processes

Stochastic processes

Warm-upHuman

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].

Stochastic processes

Warm-upHuman

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?

Stochastic processes

CoreHuman

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

Choose all that apply

Stochastic processes

CoreHuman

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

Stochastic processes

CoreHuman

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

Choose one

Stochastic processes

CoreHuman

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?

Choose one

Stochastic processes

CoreHuman

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?

Choose one

Stochastic processes

CoreFormal

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

Choose one

Stochastic processes

StretchHuman

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.

Choose all that apply

Stochastic processes

CoreComputational

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.

Runs entirely in your browser, in an isolated worker. Nothing is sent to a server.