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.
Let be a standard Brownian motion. Compute .
- 2.
Requests reach a server in Nairobi as a Poisson process of rate per minute. Given that exactly requests arrived in the first minutes, what is the expected number of requests in the first minutes?
- 3.
Which of these processes are martingales with respect to the natural filtration of a standard Brownian motion ? Select all that apply.
- A.
- B.
- C.
- D.
- E.
- F.
- 4.
Compute .
- 5.
Which equation is correct for ?
- A.
- B.
- C.
- D.
- 6.
A geometric Brownian motion has and , so . Which statement is true as ?
- A., and yet almost surely.
- B. almost surely, because .
- C., because typical paths tend to .
- D. oscillates between and forever.
- 7.
The proof that Brownian paths have infinite variation uses along dyadic partitions of . Which property of Brownian motion guarantees for each path?
- A.Continuity of the paths (hence uniform continuity on ).
- B.Independence of the increments.
- C.The Gaussian distribution of the increments.
- D.The martingale property.
- 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
- A.
- 9.
A pure birth chain on jumps from to at rate (so the holding time in state is exponential with mean ). For which rate sequences does the chain make infinitely many jumps in finite time (explode) with probability one? Select all that apply.
- A. (a Poisson process)
- B.
- C.
- D.
- 10.
A path is given by its values
path = [S_0, S_1, ..., S_n]on a partition. Writeito_sum(path)(left-point sum of ),stratonovich_sum(path)(midpoint sum, with ) andquadratic_variation(path). The tests check them on exact rational paths and verify the discrete Itô and Stratonovich formulas.Computational — Practice