Brownian Motion

From Bradwiki
Jump to navigation Jump to search


Brownian motion describes the stochastic diffusion of particles as they travel through n-dimensional spaces filled with other particles and physical barriers. Here the term particle is a generic term that can be generalized to describe the motion of molecule (e.g. H2O) or proteins (e.g. NMDA receptors); note however that stochastic diffusion can also apply to things like the price index of a stock (see random walk) or the propagation heat energy across a surface. Brownian motion is among the simplest continuous-time stochastic processes, and a limit of various probabilistic processes (see random walk). As such, Brownian motion is highly generalizable to many applications, and is directly related to the universality of the normal distribution. In some sense, stochastic diffusion is a pure actuation of the basic statistical properties of probability distributions - it is distribution sampling translated into movement.

SPECIFICATION - Physical experiments suggest that Brownian motion has

  • continuous increments
  • increments of a particle over disjoint time intervals are independent events
  • each increment is assumed to result from collisions with many molecules
  • each increment is assumed to have a normal probability distribution
    • (Central Limit Theorem of probability theory: the sum of a large number of independent identically distributed random variables is approximately normal)
  • the mean increment is zero as there is no preferred direction
  • the position of a particle spreads out with time
  • the variance of the increment is proportional to the length of time that Brownian motion has been observed

The probability density of a normally distributed random variable with mean μ and standard deviation σ is given by:

Mathematically, the random process called Brownian motion is denoted here as B(t) and defined for times t ≥ 0; the probability density of Brownian particles at the end of time period [0, t] is obtained by substituting μ = 0 and σ = √t, giving:

where x denotes the value of random variable B(t). The probability distribution of the increment B(t + u) − B(t) is:


Common Diffusion Terms & Parameters

I've found it most helpful to learn about the terms and parameters used to characterize stochastic diffusion as they apply to diffusion phenomena along a flat 2D surface. These parameters include:

D  : diffusion rate coefficient

L : step length
d : dimensions
t : time

D (in units: µm²/s) is the mean diffusion rate per unit time (velocity), often in µm²/s for biological motion on a molecular level (n.b. µm²/s are the units for particle diffusion on a surface/membrane; the surface can actually be curved or ruffled such that the surface fills a 3D space, however the diffusion equations for those instances are slightly more complex. Units for 3D space are naturally: µm³/s). This refers to how fast, on average, the particle moves along its surface trajectories. This value is often of ultimate interest, that is, the goal of single-particle tracking studies is often to define the average diffusion rate of a molecule and report it as a Diffusion Coefficient; once D is known, this Diffusion Coefficient can then be easily implemented in computer simulations of Brownian motion. However under most circumstances, the diffusion rate cannot be observed directly in empirical experiments - this would require the ability to visualize all the microscopic particles and collisions that dictate the particle's movement on a nanosecond timescale. In the animation on the right, the diffusion rate can actually be quantified directly; but what is often seen when observing particle diffusion through a microscope would more closely resemble this:

Instead, D is often calculated from the mean squared diffusion (MSD) path of the particle, defined below.

MSD  : mean squared displacement

d : dimensions
D : diffusion coefficient

MSD (in units: µm²) is the mean square displacement of a particle over some time period. If D (the diffusion coefficient) is unknown, MSD can be computed using the following equation:

Mean Squared Displacement Equation.png

...where the quantity 'x ' refers to the displacement of a particle over 'n ' total steps, with 'k ' indicating the current step.

K  : standard deviation of the normal distribution for D

d : dimensions
D : diffusion coefficient

k (in units: µm) is the standard deviation (σ) of the normal distribution of step lengths that, when randomly sampled, will give rise to a diffusion rate D. This value is useful for simulating Brownian motion for a particular diffusion rate.

L  : mean step length

d : dimensions
D : diffusion coefficient

L or Λ (in units: µm) is the average step length per interval of observation. In diffusion simulations, this is the step size per iteration (equivalent form: L = (2d * D).5).

λ  : mean 1D step length component of L

λ (in units: µm) is the average 1-dimensional step length for each component (X,Y,Z) dimension of L. For example, simulating 2D particle diffusion will require the generation of individual step lengths for both the X and Y dimension. The total step distance from the origin will be the length of the hypotenuse created by the individual X and Y component step lengths. In fact, the equation: λ = L / √2 is derived from the Pythagorean theorem for right triangles, such that 2λ² = λ² where 2λ² represents a² + b² and λ² represents c².

ε  : step length scalar coefficient

δ : new desired diffusion rate
ε (in units: au) is a coefficient value that, when multiplied by each λ component step length, will scale those lengths to achieve a new diffusion rate δ.

Brownian Motion Matlab Code

  1 function [boom] = BradsBrownianMotionScript()
  2 format compact;
  3 format short;
  4 close all;
  6 % Note: This matlab script requires 'msdanalyzer' toolbox
  7 %-------------############################------------------%
  8 %                 STARTING PARAMETERS
  9 %-------------############################------------------%
 10 D = .3;                     % Diffusion Rate
 11 Ds = .1;                    % Diffusion Scalar (Ds = Dn)
 12 Dn = D/(D/Ds);              % new D after scaling L
 13 d = 2;                      % dimensions
 14 dT = 1;                     % time step
 15 k = sqrt(d*D);	            % stdev of D's step size distribution
 16 MSD = 2*d*D;                % mean squared displacement
 17 L = sqrt(2*d*D);            % average diagonal (2D) step size
 18 Lx = L/sqrt(2);             % average linear (1D) step size
 19 Ls = 1/sqrt(D/Ds);          % scales Lx values for Dn
 22 MSDtest = [1 0 0];			% test: D, Dn, or L
 23 Scale = 1/10;				% scale of model
 24 Ndots = 100;
 25 Nsteps = Ndots;
 28 xyl = ones(2,Ndots);
 29 xyds = ones(2,Ndots);
 30 lims = ((D+1)^2)*10;
 33 %===========================================================%
 34 %               LIVE PARTICLE DIFFUSION
 35 %-----------------------------------------------------------%
 36 for t = 1:Nsteps
 38     xyds = STEPxyds(Ndots, k);
 39 	[xyl] = AMPARSTEP(Ndots, xyds, xyl);
 40 	MAINPLOT(xyl, lims);
 42 end
 43 %===========================================================%
 46 %===========================================================%
 47 %               MSD RANDOM STEPS ANALYSIS
 48 %-----------------------------------------------------------%
 49 tracks = cell(Ndots, 1);
 51 stepN = 1;
 52 for t = 1:Nsteps 
 54 	xyds = STEPxyds(Ndots, k);
 55 	[xyl] = AMPARSTEP(Ndots, xyds, xyl);
 56     [tracks] = MSDfun(stepN, Nsteps, tracks, xyds);
 58 stepN = stepN+1;
 59 end
 60 MSDfunction(tracks,Ndots,Nsteps,D,Dn,L,dT,k,Scale,MSDtest);
 66 %===========================================================%
 67 %               MSD UNIFORM STEPS ANALYSIS
 68 %-----------------------------------------------------------%
 69 stepN = 1;
 70 for t = 1:Nsteps 
 72 xyds = stepsize(Ndots, Lx);
 74 	[xyl xyds] = MSDAMPARSTEP(Ndots, xyds, xyl, Ls);
 75     [tracks] = MSDfun(stepN, Nsteps, tracks, xyds);
 77 stepN = stepN+1;
 78 end
 79 MSDfunction(tracks,Ndots,Nsteps,D,Dn,L,dT,k,Scale,MSDtest);
 82 boom = 'done';
 83 %-------------############################------------------%
 84 end %         ##    END MAIN FUNCTION   ##
 85 %-------------############################------------------% 
 86 %%
 92 %%
 93 %-------------############################------------------%
 94 %             ##      SUBFUNCTIONS      ##
 95 %-------------############################------------------% 
 98 %-------------------------------------------%
100 %-------------------------------------------%
101 function xyds = STEPxyds(Ndots, k)
103     xyds = (k * randn(2,Ndots));
105 end
108 %-------------------------------------------%
110 %-------------------------------------------%
111 function [xyl] = AMPARSTEP(Ndots, xyds, xyl)
113 	for j = 1:Ndots
114         xyl(:,j) = xyl(:,j)+xyds(:,j);
115 	end
117 end
120 %-------------------------------------------%
122 %-------------------------------------------%
123 function [] = MAINPLOT(xyl, lims)
124 %-------------------------------------------%
125 xlim = [-lims lims];
126 ylim = [-lims lims];
127 zlim = [-5 5];
129 %=================================%
130 %       MAIN 2D PLOT
131 %---------------------------------%
132 figure(1)
133 subplot(2,1,1), 
134 AMPARPlot = gscatter(xyl(1,:),xyl(2,:));
135 axis([xlim, ylim]);
136 set(AMPARPlot,'marker','.','markersize',[6],'color',[1 0 0])
139 %=================================%
140 %           3D PLOT
141 %---------------------------------%
142 figure(1);
143 subplot(2,1,2), 
144 gscatter(xyl(1,:),xyl(2,:)); view(20, 30);
145 axis normal;
146 grid off
147 axis([xlim, ylim, zlim]);
148 set(gca, 'Box', 'on');
150 end
153 %-------------------------------------------%
155 %-------------------------------------------%
156 function xyds = stepsize(Ndots, Lx)
157 %-------------------------------------------%
159    Lx(1:2,1:Ndots) = Lx;
160    xyd = randi([0 1],Ndots,2)';
161    xyd(xyd == 0) = -1;
162    xyds = (Lx.*xyd);
164 end
167 %-------------------------------------------%
169 %-------------------------------------------%
170 function [xyl xyds] = MSDAMPARSTEP(Ndots, xyds, xyl, Ls)
172 	for j = 1:Ndots
173         xyds(:,j) = xyds(:,j)*Ls;
174         xyl(:,j) = xyl(:,j)+xyds(:,j);
175 	end	
177 end
180 %-------------------------------------------%
182 %-------------------------------------------%
183 function [tracks] = MSDfun(stepN, Nsteps, tracks, xyds)
184     time = (0:Nsteps-1)';
185     xymsd = xyds';
186     xymsd = cumsum(xymsd,1);
187     tracks{stepN} = [time xymsd];
189 end
192 %-------------------------------------------%
194 %-------------------------------------------%
195 function [] = MSDfunction(tracks,Ndots,Nsteps,D,Dn,L,dT,k,Scale,MSDtest)
197 SPACE_UNITS = 'µm';
198 TIME_UNITS = 's';
199 N_PARTICLES = Ndots;
200 N_TIME_STEPS = Nsteps;
201 N_DIM = 2;
203 oD = D;				% raw		µm^2/s
204 D  = D*Scale;       % to-scale	µm^2/s
206 oDn = Dn;			% raw		µm^2/s
207 Dn = Dn*Scale;		% to-scale	µm^2/s
209 oL = L;				% raw		µm
210 L = L*Scale;		% to-scale	µm
212 dTbase = dT;		% raw time-step 
213 dT = dT*Scale;		% to-scale time-step
214 k = k;				% stdv of step distribution
216 ma = msdanalyzer(2, SPACE_UNITS, TIME_UNITS);
217 ma = ma.addAll(tracks);
218 disp(ma)
220 figure
221 ma.plotTracks;
222 ma.labelPlotTracks;
224 ma = ma.computeMSD;
227 t = (0 : N_TIME_STEPS)' * dT;
228 [T1, T2] = meshgrid(t, t);
229 all_delays = unique( abs(T1 - T2) );
231 figure
232 ma.plotMSD;
235 cla
236 ma.plotMeanMSD(gca, true)
238 mmsd = ma.getMeanMSD;
239 t = mmsd(:,1);
240 x = mmsd(:,2);
241 dx = mmsd(:,3) ./ sqrt(mmsd(:,4));
242 errorbar(t, x, dx, 'k')
244 [fo, gof] = ma.fitMeanMSD;
245 plot(fo)
246 ma.labelPlotMSD;
247 legend off
250 ma = ma.fitMSD;
252 good_enough_fit = ma.lfit.r2fit > 0.8;
253 Dmean = mean( ma.lfit.a(good_enough_fit) ) / 2 / ma.n_dim;
254 Dstd  =  std( ma.lfit.a(good_enough_fit) ) / 2 / ma.n_dim;
256 Dheader1 = ['Raw Unscaled Values'];
257 Dhead1 = ['    D        Dn        L'];
258 Ddat1 = [oD oDn oL];
259 disp(' ')
260 disp(Dheader1)
261 disp(Dhead1)
262 disp(Ddat1)
265 yourtesthead = ['YOU ARE TESTING DIFFUSION FOR:'];
266 if MSDtest(1)
267 	yourtest = ['   D:   original diffusion rate'];
268 elseif MSDtest(2)
269 	yourtest = ['   Dn:  new diffusion rate'];
270 elseif MSDtest(3)
271 	yourtest = ['   L:  step length'];
272 else
273 	yourtest = ['   generic diffusion rate'];
274 end
275 disp(yourtesthead)
276 disp(yourtest)
278 disp(' ')
279 fprintf('Estimation of raw D coefficient from MSD:\n')
280 fprintf('D = %.3g ± %.3g (mean ± std, N = %d)\n', ...
281     Dmean, Dstd, sum(good_enough_fit));
286 % Retrieve instantaneous velocities, per track
287  trackV = ma.getVelocities;
289  % Pool track data together
290  TV = vertcat( trackV{:} );
292  % Velocities are returned in a N x (nDim+1) array: [ T Vx Vy ...]. So the
293  % velocity vector in 2D is:
294  V = TV(:, 2:3);
296  % Compute diffusion coefficient
297 varV = var(V);
298 mVarV = mean(varV); % Take the mean of the two estimates
299 Dest = mVarV / 2 * dT;
303 Dheader2 = ['Scaling to model...'];
304 Dhead2 = ['    D        Dn        L'];
305 Ddat2 = [D Dn L];
307 disp(' ')
308 disp(Dheader2)
309 disp(Dhead2)
310 disp(Ddat2)
311 fprintf('Estimation from velocities histogram:\n')
312 fprintf('Tested D = %.3g %s, compare to scaled Des value of %.3g %s\n', ...
315 % printf('D.psd target value was %.3g %s\n', ...
316 %     Dest, msdDpsd, [SPACE_UNITS '²/' TIME_UNITS]);
318 end

Stochastic Diffusion


This exercise shows how to simulate the motion of single and multiple particles in one and two dimensions using Matlab. You will discover some useful ways to visualize and analyze particle motion data, as well as learn the Matlab code to accomplish these tasks. Once you understand the simulations, you can tweak the code to simulate the actual experimental conditions you choose for your study of Brownian motion of synthetic beads. These simulations will generate the predictions you can test in your experiment.

In each section, Matlab code shown in the box to the left is used to generate the plot or analysis shown on the right. To use the code, copy it from the box on the left, launch the Matlab application, and paste the code into the Matlab Command Window. If you are new to Matlab, check out the Intro to Matlab page to help you get started.

Simulating Single Particle Trajectories

The following sections cover simulating the stochastic motion of individual particles in n-dimensions.

For a tutorial on using the Matlab MSD extension see: Mean Squared Diffusion (MSD) Tutorial

Open Source 'plasticity' Project

Before jumping into the fundamentals of stochastic diffusion programming, it may be encouraging to know that these basic principles can be combined to model stochastic processes with real-world applications. One current project I'd like to plug is called "plasticity", which is an open source collaboration I started last year aimed at modeling the membrane diffusion of receptors along dendritic surfaces of neurons. The overall goal of "plasticity" is to develop spatially and temporally accurate models of molecular dynamics in neurons, and simulate complex activities using simple MCMC and statistical method Here's a simulation produced using code from the plasticity repo on github.

Github plasticity.png

One Dimensional Brownian Motion

SingleParticleSimulations 01.png

Brownian motion in one dimension is composed of a sequence of normally distributed random displacements. The randn function returns a matrix of a normally distributed random numbers with standard deviation 1. The two arguments specify the size of the matrix, which will be 1xN in the example below.

The first step in simulating this process is to generate a vector of random displacements. The commands to do this are shown below. N is the number of samples to generate.

1 %-------------############################------------------%
2 %                 One Dimensional Brownian Motion
3 %-------------############################------------------%
5 N = 1000;
6 displacement = randn(1,N);
7 plot(displacement);
9 %-------------############################------------------%

Distribution of Displacements

SingleParticleSimulations 02.png

Have a look at the distribution of the randomly generated displacements. The hist command plots a histogram of the values. The second argument - 25 - specifies that Matlab should divide the values into 25 bins.

hist(displacement, 25);

Convert displacements to position

Now we have some appropriate random displacements. Their sum represents a particle trajectory in 1 dimension. The Matlab function cumsum returns the cumulative sum of a vector. The following commands take the cumulative sum of displacement and save the result in a vector called x.

SingleParticleSimulations 03.png
x = cumsum(displacement);
xlabel('time step');
title('Position of 1D Particle versus Time');

Two dimensional particle simulation

SingleParticleSimulations 04.png

Extending this to two dimensions is simple. Since all directions are (assumed to be) equivalent, all we need to do is generate two vectors of random displacements. The vector of displacements saved in a Matlab structure called particle. x and y position vectors are stored in members of the structure. This data could also have been saved as a 2xN matrix. Using a structure has the important advantage that a meaningful name can be assigned to each member. This good practice makes your code much more readable.

 1 %-------------###############################----------------%
 2 %             Two Dimensional Brownian Motion
 3 %-------------###############################----------------%
 5 particle = struct();
 6 particle.x = cumsum( randn(N, 1) );
 7 particle.y = cumsum( randn(N, 1) );
 9 plot(particle.x, particle.y);
10   ylabel('Y Position');
11   xlabel('X Position');
12   title('position versus time in 2D');
14 %-------------############################------------------%

Compute the Displacement Squared

SingleParticleSimulations 05.png

The displacement squared is equal to the x coordinate squared plus the y coordinate squared. Since the simulated particle always start at (0,0), it is unnecessary to subtract off the initial position (as will be necessary with the data you gather in the lab).

The dot caret (.^) operator raises each element of a matrix to a power.

dsquared = particle.x .^ 2 + particle.y .^ 2;

Theoretical Value of D

The theoretical value of the diffusion coefficient, D, is given by D = kB * T / (3πrη) where T = temperature (Kelvin), kB = Boltzmann's constant, eta = viscosity, and r = diffusion_radius.

Note that the units of D are length squared divided by time. See the lab writeup for more information. Let's compute D for a 1 micron particle in water at 293 degrees Kelvin.

r    = 1.0e-6;              % radius in meters
eta  = 1.0e-3;              % viscosity of water in SI units (Pascal-seconds) at 293 K
kB   = 1.38e-23;            % Boltzmann constant
T    = 293;                 % Temperature in degrees Kelvin

D    = kB * T / (3 * pi * r * eta)

ans =

Qian et al. derived a way to estimate the diffusion coefficient from the distribution of instantaneous velocities. If v is the instantaneous velocity vector, then

(v) = 2D / dT

A more realistic particle -- Getting the Units Right

SingleParticleSimulations 06.png

So far, we have been looking at simulated particles with a mean squared displacement of 1 unit per time interval. To accurately model a real particle, it is necessary to adjust the distribution of random displacements to match the experimental conditions.

According to theory, the mean squared displacement of the particle is proportional to the time interval, where r(t) = position, d = number of dimensions, D = diffusion coefficient, and tau = time interval.

To generate the correct distribution, the output from randn (which has a standard normal distribution) must be scaled by the factor k.

 1 %-------------###############################----------------%
 2 %             Two Dimensional Realistic Brownian Motion
 3 %-------------###############################----------------%
 5 dimensions = 2;         % two dimensional simulation
 6 tau = .1;               % time interval in seconds
 7 time = tau * 1:N;       % create a time vector for plotting
 9 k = sqrt(D * dimensions * tau);
10 dx = k * randn(N,1);
11 dy = k * randn(N,1);
13 x = cumsum(dx);
14 y = cumsum(dy);
16 dSquaredDisplacement = (dx .^ 2) + (dy .^ 2);
17  squaredDisplacement = ( x .^ 2) + ( y .^ 2);
19 plot(x,y);
20 title('Particle Track of a Single Simulated Particle');
22 %-------------############################------------------%

Displacement Squared Plot

SingleParticleSimulations 07.png

Theory predicts that the displacement should increase in proportion to the square root of time. The theoretical value of displacement squared is plotted with a thick black line. Since displacement is expected to increase with the square root of time, displacement squared is a straight line in the plot. With only a single particle and a small number of samples, deviation from the line can be quite large.

hold on;
plot(time, (0:1:(N-1)) * 2*k^2 , 'k', 'LineWidth', 3);      % plot theoretical line

plot(time, squaredDisplacement);
hold off;
ylabel('Displacement Squared');
title('Displacement Squared versus Time for 1 Particle in 2 Dimensions');

Estimating D from the Simulated Data

The best estimate of the value of D from the simulated data is:

simulatedD = mean( dSquaredDisplacement ) / ( 2 * dimensions * tau )

ans = 

Uncertainty in the Estimate

The likely error of this measurement decreases as the square root of the number of samples. This will be discussed in more detail later.

standardError = std( dSquaredDisplacement ) / ( 2 * dimensions * tau * sqrt(N) )
actualError = D - simulatedD

standardError = 

actualError   = 

Systematic Error -- Bulk Flow in the Solvent

SingleParticleSimulations 08.png

Sometimes, evaporation or uneven heating of the solvent will cause a flow to occur on the slide you are observing. We can model this easily. The following code models a flow with a magnitude 0.5 k in the x direction and 0.1 k in the y direction.

dx = dx + 0.2 * k;
dy = dy + 0.05 * k;

x = cumsum(dx);
y = cumsum(dy);

dSquaredDisplacement = (dx .^ 2) + (dy .^ 2);
 squaredDisplacement = ( x .^ 2) + ( y .^ 2);

simulatedD    = mean( dSquaredDisplacement ) / ( 2 * dimensions * tau )
standardError = std(  dSquaredDisplacement ) / ( 2 * dimensions * tau * sqrt(N) )
actualError = D - simulatedD

title('Particle Track of a Single Simulated Particle with Bulk Flow');

simulatedD    =  
standardError =  
actualError   = 

Displacement Squared in the Presence of Bulk Flow

SingleParticleSimulations 09.png

Notice how the plot of displacement squared diverges from the theoretical value. It has a distinct quadratic component. The magnitude of this error increases dramatically with time. This suggests that the error caused by bulk flow can be minimized by using the shortest possible sampling period. But there's a catch. As you increase the sampling rate, the amount of noise from the motion tracking algorithm goes up. A tenth of a second works pretty well for the particles you will observe in the lab. If you have time, take a few movies at a different rates to see the effect.

hold on;
plot(time, (0:1:(N-1)) * 2*k^2 , 'k', 'LineWidth', 3);      % plot theoretical line
plot(time, squaredDisplacement);
hold off;

ylabel('Displacement Squared');
title('Displacement Squared versus Time with Bulk Flow');

Simulating Multiple Particles

When you take your data in the lab, you will make movies of many particles. You will use a Matlab program to extract particle tracks from these movies. Because particles drift out of view and go in and out of focus, most movies will be about 5 seconds long at a sample rate of 10 Hz or so. Let's simulate this.

Using a For Loop to Generate Multiple Data Sets

A for loop is the key to generating multiple particle simulations. The results of the simulations are stored in a cellular array of structures called particle. For example, particle{3} refers to a structure containing the results of simulation number 3. particle{3}.D is the estimated value of D for simulation number 3. It is not necessary to understand this code in depth. But do yourself a favor and have a look.

particleCount = 10;
N = 50;
tau = .1;
time = 0:tau:(N-1) * tau;
particle = { };             % create an empty cell array to hold the results

for i = 1:particleCount
    particle{i} = struct();
    particle{i}.dx = k * randn(1,N);
    particle{i}.x = cumsum(particle{i}.dx);
    particle{i}.dy = k * randn(1,N);
    particle{i}.y = cumsum(particle{i}.dy);
    particle{i}.drsquared = particle{i}.dx .^2 + particle{i}.dy .^ 2;
    particle{i}.rsquared = particle{i}.x .^ 2 + particle{i}.y .^ 2;
    particle{i}.D = mean( particle{i}.drsquared ) / ( 2 * dimensions * tau );
    particle{i}.standardError = std( particle{i}.drsquared ) / ( 2 * dimensions * tau * sqrt(N) );

SimulateParticle Function

That's a lot of typing. Fortunately, all of the commands to generate multiple particle tracks have been combined into in a single function called SimulateParticles. If you are interested in how the function is implemented, type edit SimulateParticles.m to have a look at the m-file for this function.

help SimulateParticles

particle = SimulateParticles(N, particleCount, tau, k);
usage: out = 
SimulateParticles( N, particleCount, tau, k )

N is the number of samples
particleCount is the number of particles
tau is the sample period
k is the standard deviation of dx and dy
returns a cellular array of length particleCount

Look at the Results

MultipleParticleSimulation 01.png

The following code plots all of the generated particle tracks on a single set of axes, each in a random color.

hold on;
for i = 1:particleCount
    plot(particle{i}.x, particle{i}.y, 'color', rand(1,3));

xlabel('X position (m)');
ylabel('Y position (m)');
title('Combined Particle Tracks');
hold off;

Displacement Squared

MultipleParticleSimulation 02.png

The following plot shows displacement squared versus time for all of the particles. The ensemble average of all the displacements is shown with a thick black line. The theoretical value of displacement squared is plotted with a thick blue line. Since displacement is expected to increase with the square root of time, displacement squared is a straight line in the plot.

% compute the ensemble average
rsquaredSum = zeros(1,N);

for i = 1:particleCount
    rsquaredSum = rsquaredSum + particle{i}.rsquared;

ensembleAverage = rsquaredSum / particleCount;

% create the plot
hold on;
plot(time, (0:1:(N-1)) * 2*k^2 , 'b', 'LineWidth', 3);      % plot theoretical line

plot(time, ensembleAverage , 'k', 'LineWidth', 3);          % plot ensemble average

for i = 1:particleCount
    plot(time, particle{i}.rsquared, 'color', rand(1,3));   % plot each particle track

xlabel('Time (seconds)');
ylabel('Displacement Squared (m^2)');
title('Displacement Squared vs Time');
hold off;

Estimated Value of D

MultipleParticleSimulation 03.png

This plot shows the computed value of D for each simulation with error bars. A thick blue line indicates the best overall estimate of D (the average of the D value from each simulation) along with error bars in green * WHICH HAPPEN TO BE WRONG -- NEED TO FIX *.

clear D e dx;

% extract the D value from each simulation and place them all into a single
% matrix called 'D'
for i = 1:particleCount
    D(i) = particle{i}.D;
    dx(i,:) = particle{i}.dx;
    e(i) = particle{i}.standardError;

% compute the estimate of D and the uncertainty
averageD = mean(D)
uncertainty = std(D)/sqrt(particleCount)

% plot everything
hold on;

plot(averageD * ones(1,particleCount), 'b', 'linewidth', 3);                    % plot estimated D
plot((averageD + uncertainty) * ones(1,particleCount), 'g-', 'linewidth', 1);   % plot upper error bar
plot((averageD - uncertainty) * ones(1,particleCount), 'g-', 'linewidth', 1);   % plot lower error bar
errorbar(D,e,'ro');                                                             % plot D values with error bars

xlabel('Simulation Number');
ylabel('Estimated Diffusion Coefficient');
title('Estimated Diffusion Coefficient with Error Bars')
legend('Average Value of D', 'location', 'NorthWest');

hold off;

averageD    = 

uncertainty = 

Fancy Statistics and Plots

This section looks at the statistical properties of the simulated data in more detail. In particular, it discusses:

  • Uncertainty in the estimate of the mean value of a random variable from a population of samples
  • The effect of squaring a normally distributed random variable
  • The assumption of statistical independence of samples

A More Perfect Distribution

FancyStatistics 01.png
FancyStatistics 02.png

Did you notice that the distribution of random displacement values in the second section looked a little lopsided? Even with 1000 samples, there can be some noticeable deviations from the ideal distribution. A million samples looks quite a bit closer to the ideal.

title('Histogram of Values for 1000 Samples of randn');
title('Histogram of Values for 1000000 Samples of randn');

Sampling Uncertainty

FancyStatistics 03.png

This lab requires you to make an estimate of the average value of a random variable (actually, the square of a random variable) from a population of samples of that variable. The uncertainty in your estimate decreases with the square root of the number of samples, N. (That is, the standard error = 1/sqrt(N).)

This concept is illustrated in the following plot. To create the plot, fifty populations of N random samples are created for each value of N from 1 to 100. The mean value of each sample population is plotted with an 'x' versus N. The uncertainty appears to decrease as 1/sqrt(N) as expected. About two thirds of the values fall between the error bars (plotted in dark black).

Matlab note: check out the nested for loops used to create the plot.

hold on;
<span class="keyword">for i= 1:100
    <span class="keyword">for j = 1:50
        y = randn(1,i);
        m = mean(y);
    <span class="keyword">end

<span class="keyword">end
plot(1:100, 1./sqrt(1:100), 'k', 'LineWidth', 2);   % plot upper error bar in dark black
plot(1:100, -1./sqrt(1:100), 'k', 'LineWidth', 2);  % plot lower error bar in dark black
hold off;
xlabel('Population Size (N)');
ylabel('Population Mean');
title('Population Mean of Normally Distributed Random Variable versus Population Size');

What Happens when you Square a Random Variable?

FancyStatistics 04.png

We did not estimate D in the simulations from the x and y displacements directly. Instead, we computed the mean squared value of dx and dy. What is the distribution of the resulting value? Adding the squares of two normally distributed random variables results in a chi-squared distribution (with two degrees of freedom) whose mean value equal to the sum of the variances of each variable. Here is what the chi-squared distribution looks like:

dx = randn(1,1e6);
dy = randn(1,1e6);
drSquared = dx .^ 2 + dy .^ 2;

var(dx) + var(dy)

title('Chi Squared Distribution (2 DOF), 1000000 Samples');

ans = 

ans = 

100 Years of BIO Lab Data in 1 Second

FancyStatistics 05.png

So does the uncertainty of the squared and summed behave as expected? The following plot is a simulation of 5000 data sets - 50 at each value of N just as above. (This is what a plot of all the data from students doing the BIO lab for the next hundred years might look like. Some lazy groups decided to use very low values of N.)

hold on;

for i= 1:100
    for j = 1:50
        dx = randn(1,i);
        dy = randn(1,i);
        m = mean( dx .^ 2 + dy .^ 2 );

plot(1:100, 2 + 2./sqrt(1:100), 'k', 'LineWidth', 2);  % plot upper error bar in dark black
plot(1:100, 2 - 2./sqrt(1:100), 'k', 'LineWidth', 2);  % plot lower error bar in dark black

hold off;
xlabel('Population Size (N)');
ylabel('Population Mean');
title('Population Mean of Chi Squared (2 DOF) Distributed Random Variable versus Population Size');

Planning Your Time in the Lab

Sampling error sets a lower bound on the uncertainty in your estimate of the diffusion coefficient from experimental data. To plan your time in the lab, it will be important to understand how much data you should take for each experimental condition. Because the particles go out of focus and drift away from of the observation area, it can be difficult to make movies longer than about 5 seconds. At a frame rate of 10 frames per second, how many movies would you have to make to achieve a final uncertainty of 10%? 1%? .1%? What level of uncertainty will you try for in the lab?

Auto Correlation - A Closer Look at the Data

FancyStatistics 06.png

The simulations so far have assumed that we are in the overdamped limit, or the inertia-less regime. This assumption makes generating simulated trajectories very easy - all you have to do is add up a bunch of properly distributed random numbers. Of course, just because something is convenient doesn't mean it's true.

There are many statistical tests for independence and normality. (My personal favorite is the Kolmogorov-Smirnov test – but never before 5:00 PM.) Auto and cross correlation are a good place to start testing for independence. Autocorrelation looks for a relationship between a variable and its past or future values. Cross correlation looks for a relationship between two variables. Matlab has a built in function to compute auto and cross correlations called xcorr.

By construction, the simulated displacements are independent. The change in position at one time should exhibit no relationship at all to the change at any other time. This can be verified with xcorr. If x is a vector, xcorr(x) returns the correlation of x with itself for all possible offsets. The length of the resulting autocorrelation sequence is 2N+1. The middle value always stands out because x correlates perfectly with itself when there is no offset. Specifying the option 'coeff' causes the xcorr function to normalize this value to exactly 1 --perfect correlation.

Also notice that the autocorrelation sequence is symmetric about the origin.

c = xcorr(particle{1}.dx, 'coeff');
xaxis = (1-length(c))/2:1:(length(c)-1)/2;

plot(xaxis, c);
title('Particle 1 x-axis Displacement Autocorrelation');

Cross Correlation

FancyStatistics 07.png

With two vector arguments, xcorr(x,y) returns a cross correlation matrix. The cross correlation can be used to test the relationship (or lack thereof) between one particle's trajectory and another's. If two particles move independently, the cross correlations should be very small. The code below computes the cross correlation between the x displacements of particle simulations number 1 and 2.

c = xcorr(particle{1}.dx, particle{2}.dx, 'coeff');
xaxis = (1-length(c))/2:1:(length(c)-1)/2;
plot(xaxis, c);
Title('Particle 1, 2 x-axis Displacement Cross Correlation');

Matlab Tricks

FancyStatistics 08.png

Matlab can generate (and plot) an amazing amount of data. For example, the xcorr function can compute the auto and cross correlations of a large set of data values. If A is an MxN matrix, xcorr(A) returns a size 2*M-1 x N^2 matrix whose columns contain the cross-correlation sequences for all combinations of the columns of A. The football shape of the data is a result of the way that the data is windowed when computing the correlation.

% create an array whose columns contain the dx values for each particle

for i = 1:particleCount
    allDx(:,i) = particle{i}.dx';

% compute all possible auto and cross correlations

c = xcorr(allDx, 'coeff');

% plot the results
hold on;
for i=1:size(c,1)
    plot(xaxis, c(:,i),'color',rand(1,3));
hold off;

ylabel('Correlation Coefficient');
title('All Possible Auto and Cross Correlations in the x Dimension');

A Correlated Trajectory

FancyStatistics 09.png

So what does the autocorrelation sequence look like for a trajectory that is not generated from independent samples? In the following example, the displacement at each time interval depends in part on the displacement in the last interval plus a random number. The autocorrelation is not nearly as sharp as the one generated by independent random samples.

x     = zeros(1,N);
c     = 0.80;           % degree of correlation; 0 to 1
step  = randn(1,N);
x(2) = randn();

for t=2:N
     x(t) = (c * x(t-1)) + ((1-c)*step(t));

plot(xaxis, xcorr(x, 'coeff'));

ylabel('Correlation Coefficient');

notes & articles

here are several good resources for explaining and calculating MSD:

Michalet • 2010 • Phys Rev E Stat Nonlin Soft Matter Phys - PDF

Expand to view experiment summary

We examine the capability of mean square displacement analysis to extract reliable values of the diffusion coefficient D of single particle undergoing Brownian motion in an isotropic medium in the presence of localization uncertainty. The theoretical results, supported by simulations, show that a simple unweighted least square fit of the MSD curve can provide the best estimate of D provided an optimal number of MSD points is used for the fit. We discuss the practical implications of these results for data analysis in single-particle tracking experiments.

Almonacid, Ahmed, Bussonnier, Mailly, Betz, Voituriez, Gov, Verlhac • 2015 • Nature - PDF

Expand to view experiment summary

For mean square displacement (MSD) analysis of vesicles trajectories, we used the @msdanalyzer MATLAB class described in: Trajectories were provided in the xml files from Fiji TrackMate analysis.

Image Gallery

Brownian1.gif Brownian2.gif Brownian3.png Brownian5.gif Dendrite Surface Diffusion.png

See Also