Showing posts with label stochastic processes. Show all posts
Showing posts with label stochastic processes. Show all posts

Tuesday, January 23, 2018

The Brownian motion as scaling limit of a random walk in discrete time

I start with an infinite set of random variables $X_n$, with $n: 1,2, \ldots$ and probability density function proportional to \begin{equation*} \exp -\frac{1}{2} \sum_{n =0}^{+\infty} (x_{n+1} - x_n)^2 \end{equation*} with $x_0 =0$. Random paths of $X_n$ can be generated by \begin{equation*} X_{n+1} = X_n + G_n \end{equation*} starting at $X_0 =0$ and with $G_n$ independent standard Gaussian random variables. The $X_n$ form a random walk in discrete time ("the lattice"). The two-point correlation function is \begin{equation}\label{eq:20180123} \mathbb{E} [ X_m X_n ] = n \quad\text{if}\quad m \ge n \end{equation} Now I move to the real line: I imagine that the distance between the lattice points is $a$. Therefore, the ratio $t/a$ is the number of lattice points between $0$ and $t$, approximated as an integer. I define $B_t = a^h X_{t/a}$ for $a$ very small. The factor $a^h$ is an extra scaling to make everything work, see below. I calculate the limit \begin{equation*} \mathbb{E} [ B_s B_t] = \lim_{a \to 0}\mathbb{E} [ a^h X_{s/a} \ a^h X_{t/a}] \end{equation*} Using \eqref{eq:20180123}, this is equal to $\lim_{a \to 0} a^{2 h} \frac{t}{a}$ for $s \ge t$. This limit exists if $h = 1/2$ and is then equal to $t$. $B_t$ is the standard Brownian motion: it is a Gaussian process and has the correct two-point correlation function.

From the definition of the Brownian motion as scaling limit, one can also prove the following formula. Suppose $b > 0$, then \begin{equation}\label{eq:20180122} \mathbb{E}[B_{b t_1}\cdots B_{b t_n}] = b^{n/2} \mathbb{E}[B_{t_1}\cdots B_{t_n}] \end{equation} Indeed, the left hand side is equal to \begin{equation*} \lim_{a \to 0}\mathbb{E} \left[ a^{1/2} X_{b t_1/a}\ \cdots\ a^{1/2} X_{bt_n/a}\right] \end{equation*} Write $a = b a'$, then the limit is equal to \begin{equation*} \lim_{a' \to 0}\mathbb{E} \left[ (ba')^{1/2} X_{t_1/a'}\ \cdots \ (ba')^{1/2} X_{t_n/a'}\right] \end{equation*} This is equal to the right hand side of \eqref{eq:20180122}.

This is all quite similar to the scaling limit discussed in conformal field theory (CFT), see for example [1]. $h$ plays the role of the scaling dimension, formula \eqref{eq:20180122} is the analogue of scale invariance in CFT. For my job I use the Brownian motion and more general stochastic processes. As a hobby I wanted to do something different and study CFT. These topics are related after all: CFT seems to be some kind of two-dimensional generalization of stochastic processes.

References and comments

[1] Conformal field theory and statistical mechanics (Lecture - 01) by John Cardy

Thursday, October 5, 2017

Girsanov for dummies

In quantitative finance, one uses change of numéraire, also known as Girsanov's theorem. In this post I explain this concept in a very simple situation. In practice, I find that this "Girsanov's theorem for dummies" version is good enough for most calculations.

Monday, May 1, 2017

Variance of Markov Chain Monte Carlo

In a previous post, I discussed the bias of Markov Chain Monte Carlo (MCMC) simulation. In this post I will discuss the variance. Please see the previous post for information about the notation that I use.
If \begin{equation*} S =\frac{1}{N} \sum_{t=1}^N f(X_t) \end{equation*} then for large $N$, the variance of $S$ is

Friday, April 28, 2017

Bias in Markov Chain Monte Carlo

Markov Chain Monte Carlo (MCMC) simulation can be used to calculate sums \begin{equation}\label{eq:20170427a} I = \sum_a \pi_a f(a) \end{equation} One finds a Markov process $X_t$ with stationary distribution $\pi_a$, then the sum \eqref{eq:20170427a} is approximated by \begin{equation*} S =\frac{1}{N} \sum_{t=1}^N f(X_t) \end{equation*} One can prove that under certain assumptions, \begin{equation*} \lim_{N \to \infty} \frac{1}{N} \sum_{t=1}^N f(X_t) = \sum_a \pi_a f(a) \end{equation*} This is Birkhoff's ergodic theorem. In this post I illustrate the behaviour of $ES$ for large $N$.

Friday, November 27, 2015

Illustration of the Dyson Ornstein-Uhlenbeck process

I define the Dyson Ornstein-Uhlenbeck process as \begin{equation}\label{eq:20151125a} dX_t = -\alpha X_t dt + H \sqrt{dt} \end{equation} with \( \alpha > 0 \) and \( H \) a random matrix from the Gaussian Unitary Ensemble of \( n \times n \) Hermitian matrices. The eigenvalues \( \lambda_i(t) \) of \( X_t \) then have the following dynamics \begin{equation}\label{eq:20151125b} d\lambda_i = -\alpha \lambda_i dt + \sum_{ j \neq i} \frac{1}{\lambda_i - \lambda_j} dt + dB_i \end{equation} where \( B_1, \ldots, B_n \) are independent Brownian processes. In this post I illustrate the process \eqref{eq:20151125b} numerically.

Wednesday, November 25, 2015

Illustration of Dyson Brownian Motion

The Dyson Brownian motion is defined as \begin{equation}\label{eq:20151124a} X_{t + dt} = X_t + H \sqrt{dt} \end{equation} with \( H \) a random matrix from the Gaussian Unitary Ensemble of \( n \times n \) Hermitian matrices. It is then well-known that the dynamics of the eigenvalues \( \lambda_i(t) \) of \( X_t \) is described by the process \begin{equation}\label{eq:20151124b} d\lambda_i = \sum_{ j \neq i} \frac{1}{\lambda_i - \lambda_j} dt + dB_i \end{equation} where \( B_1, \ldots, B_n \) are independent Brownian processes. In this post I illustrate the process \eqref{eq:20151124b} numerically.