next up previous
Next: About this document ...

15. Random walk in fractal time. Correlated walks
LAST TIME

TODAY we will discuss:

INTERMITTENCY
Toy model for price fluctuations
Consider a market where
Probability distribution for price change x after time t:

\begin{displaymath}\Pi(x,t)=\sum_{n=0}^{\infty}P(x,n)\psi(n,t)\end{displaymath}



For simplicity assume Gaussian distribution for the effect of a single transaction:

\begin{displaymath}p(x)=\frac{1}{\sqrt{2\pi\sigma^2}}\exp(-\frac{x^2}{2\sigma^2})\end{displaymath}

Without lack of generality we can choose our unit price to be such that $\sigma=1$.

The price change distribution after n transactions is thus

\begin{displaymath}P(x,n)=\frac{1}{\sqrt{2\pi n}}\exp(-\frac{x^2}{2n})\end{displaymath}



We finally assume that the distribution for transaction volume is Lévy stable for large t:

\begin{displaymath}\psi(n,t)\propto \frac{1}{t^{\alpha +1}}\;\;as\;t\rightarrow\infty\end{displaymath}



As a first example let us assume transaction volume follows Lévy-Smirnov distribution:

\begin{displaymath}\psi(n,t)=\frac{bt}{(2\pi)^{1/2}n^{3/2}}
\exp(-\frac{b^2t^2}{2n})\end{displaymath}

Choose unit of time so that b=1! Substituting we find

\begin{displaymath}\Pi(x,t)=\sum_{n=0}^{\infty}P(x,n)\psi(n,t)\end{displaymath}


\begin{displaymath}=\int_0^\infty dn \frac{1}{\sqrt{2\pi n}}\exp(-\frac{x^2}{2n})
\frac{t}{(2\pi)^{1/2}n^{3/2}}
\exp(-\frac{t^2}{2n})\end{displaymath}

where we approximate n to be a continuous variable.
A change of variable $n\Rightarrow y=1/n$ yields

\begin{displaymath}\Pi(x,t)=\frac{t}{2\pi}\int_0^\infty dy \exp\frac{-y(x^2+t^2)}{2}\end{displaymath}

or

\begin{displaymath}\Pi(x,t)=\frac{t}{\pi(x^2+t^2)}\end{displaymath}

Price distribution Cauchy with $\alpha=1$!

In the general case we note from

\begin{displaymath}\Pi(x,t)=\sum_{n=0}^{\infty}P(x,n)\psi(n,t)\end{displaymath}


\begin{displaymath}=\int_0^\infty dn \frac{1}{\sqrt{2\pi n}}\exp(-\frac{x^2}{2n})
\psi(n,t)\end{displaymath}

that

\begin{displaymath}\langle x^2\rangle=\int_{n=0}^\infty n\psi(n,t)\end{displaymath}

We find that The rôle of "fractal time" distribution of prizes in economics is discussed in detail in Mandelbrot[1997].

We next wish to consider "walks" were successive events are "correlated", i.e. are not indenpendent of each other. In order to lay the groundwork look at one more uncorrelated example:


FREELY JOINTED CHAIN
Consider a polymer such as polyethylene which is a chain of molecules

\begin{displaymath}-CH_2-CH_2-CH_2-\cdots\end{displaymath}

Our discussion of the polymer problem be largely taken from chapter 8 of Plischke and Bergersen [1994].
Let Ri be the position of the i-th carbon atom and ri=Ri+1-Ri a vector representing the i-th bond.
We first assume that the chain is freely jointed i.e. each bond points in an arbitrary direction.
The probability that a N+1-carbon chain has an end to end separation R is then

\begin{displaymath}P_N(\vec{R})=\Pi_{i=1}^{N}[\frac{1}{4\pi a^2}\int d^3r_i
\delta(\vert r_i\vert-a)]\end{displaymath}


\begin{displaymath}\times \delta(\vec{R}-\sum_{i=1}^N\vec{r}_i)\end{displaymath}

with a the length of the bond

Fourier transform:

\begin{displaymath}F(\vec{k})=\int d^3RP_N(\vec{R})e^{i\vec{k}\cdot\vec{R}}\end{displaymath}


\begin{displaymath}=\Pi_{i=1}^N\left(\frac{1}{4\pi a^2}\int d^3r_ie^{i\vec{k}\cdot\vec{r_i}}
\delta(\vert\vec{r}_i\vert-a)\right)\end{displaymath}


\begin{displaymath}=\left(\frac{\sin(ka)}{ka}\right)^N\end{displaymath}

For large N the function F(k) is sharply peaked at k=0:

\begin{displaymath}\ln F(\vec{k})\approx N\ln(1-\frac{k^2a^2}{6})\approx-\frac{Nk^2a^2}{6}\end{displaymath}

and we see that for large N the freely jointed chain is Gaussian

\begin{displaymath}P_N(\vec{R})=\int\frac{d^3k}{(2\pi)^3}\exp\left(-\frac{Nk^2a^2}{6}
-i\vec{k}\cdot\vec{R}\right)\end{displaymath}


\begin{displaymath}=\left(\frac{3}{2\pi Na^2}\right)\exp\left(-\frac{3R^2}{2Na^2}\right)\end{displaymath}



PERSISTENCE LENGTH
Polymers such as polyethylene are not freely jointed. The angle between successive carbon carbon bonds is fairly rigidly fixed at $\theta \approx 68^o$
As our next approximation we put

\begin{displaymath}\vec{r}_{i}=\vec{r}_{i+1}\cos\theta-\vec{w}_{i+i}\end{displaymath}

where $\vert\vec{w_i}\vert=a\vert sin\theta\vert$ and $\vec{w}_i\cdot\vec{r}_i=0$. We assume that $\langle \vec{w}_i\rangle=0$

\begin{displaymath}\langle \vec{r}_i\cdot\vec{r}_{i+n}\rangle=\langle \vec{r}_{i+1}\cdot\vec{r}_{i+n}\rangle\cos\theta=a^2\cos^n\theta\end{displaymath}

We find for the mean square displacement

\begin{displaymath}\langle R_N^2\rangle=Na^2+2\sum_{n>m}\langle\vec{r}_n\vec{r}_m\rangle\end{displaymath}


\begin{displaymath}=Na^2+2a^2\sum_{n=2}^{N}\sum_{m=1}^{n-1}\cos\theta^{n-m}\end{displaymath}

After some manipulation of geometric series one finds that the leading term of order N is

\begin{displaymath}\langle R_N^2\rangle=Na^2\frac{1+\cos\theta}{1-cos\theta}\end{displaymath}



SHORT VS LONG RANGE CORRELATION
For the freely jointed chain $\langle R_N^2\rangle=Na^2$. We conclude that the correlated random walk is still Gaussian, but with an effective persistence length

\begin{displaymath}a_K=\sqrt{\frac{1+\cos\theta}{(1-cos\theta)}}\end{displaymath}

We can make the model more realistic by noting that the orientation of the vector wi is not uniformly distributed in the plane.


\begin{figure}
\epsfxsize=400pt
\epsffile{polyet.eps}
\end{figure}


Instead wi will take into account one of three possible directions (two "gauche" and one "trans"). This will not change the fact that short range correlations will not affect the Gaussian nature of the random walk - it will only modify the value of the persitence length!
This picture changes when the correlations become long range!

THE SELFAVOIDING RANDOM WALK If a polymer is disolved in a good solvent in a dilute solution it will tend to "swell" i.e. occupy a larger volume than it otherwise would. In a "good solvent" the only effective interaction between sections of the polymer is the excluded volume effect - two segments of the polymer cannot occupy the same physical space. In a dilute solution this excluded effect volume only acts on elements of the same chain. The correlations introduced by the restriction of self-avoidance will be long range and cannot be taken into account by introducing a new effective persistence length!


Empirically on finds that the mean square end-to-end distance of selfavoiding walks scales as

\begin{displaymath}{\bf R}_N^2\propto N^{2\nu}\end{displaymath}

where nu depends on the dimensionality d of the medium in which the medium takes place, but is otherwise believed to universal i.e. independent on the type of lattice, or if the walk is continuous or discrete.


In one dimension we must have $\nu=1$, the only possible self-avoiding walk is one which continues in a straight line.
For $d=2,\; \nu\approx 3/4$ (this value is likely exact), while for $d=3, \; \nu\approx 0.75$. For $d\geq 4,\;\nu=1/2$ which is the same value as we have for the Gaussian random walk. Hence, for $d\geq 4$ self-avoidance is irrelevant. Let us next review a few different approaches to the problem of computing the scaling exponent $\nu$.

COUNTING WALKS
As an example consider the self-avoiding walks on a square lattice. The simplest way to construct all N-step walks is to proceed recursively-that is to add one step in all possible ways to the N-1 step walk. The self-avoiding walks up to order 3 on the square lattice are listed below:


\begin{figure}
\epsfxsize=300pt
\epsffile{f8-1.eps}
\end{figure}


Next, we consider the walks of order 4 and 5:


\begin{figure}
\epsfxsize=350pt
\epsffile{f8-2.eps}
\end{figure}


The average end-to-end distance can then be calculated from

\begin{displaymath}S^2_N=\cal{N}^{-1}\sum_{j=1}{\cal{N}} R_N^2(j)\end{displaymath}

Enumeration gives

\begin{displaymath}S^2_1=1,\;S^2_2=frac{8}{3},\; S^2_3=\frac{41}{9},\;
S^2_4=\frac{176}{25},\;S^2_5=\frac{679}{71}\end{displaymath}

The results are plotted in a log-log plot below


\begin{figure}
\epsfxsize=280pt
\epsffile{f8-3.eps}
\end{figure}


We find a good fit to $\nu\approx 0.7$. Clearly, more accurate results can be obtained by goind to higher order- which is quite possible with modern computers.

SUMMARY Return to title page


 
next up previous
Next: About this document ...
Birger Bergersen
1998-10-28