# Smoluchowski coagulation equation

In statistical physics, the Smoluchowski coagulation equation is a population balance equation introduced by Marian Smoluchowski in a seminal 1916 publication, describing the time evolution of the number density of particles as they coagulate (in this context "clumping together") to size x at time t.
Simultaneous coagulation (or aggregation) is encountered in processes involving polymerization, coalescence of aerosols, emulsication, flocculation.

## Equation

The distribution of particle size changes in time according to the interrelation of all particles of the system. Therefore, the Smoluchowski coagulation equation is an integrodifferential equation of the particle-size distribution. In the case when the sizes of the coagulated particles are continuous variables, the equation involves an integral:
    ${\frac {\partial n(x,t)}{\partial t}}={\frac {1}{2}}\int _{0}^{x}K(x-y,y)n(x-y,t)n(y,t)\,dy-\int _{0}^{\infty }K(x,y)n(x,t)n(y,t)\,dy.$
If dy is interpreted as a discrete measure, i.e. when particles join in discrete sizes, then the discrete form of the equation is a summation:
    ${\frac {\partial n(x_{i},t)}{\partial t}}={\frac {1}{2}}\sum _{j=1}^{i-1}K(x_{i}-x_{j},x_{j})n(x_{i}-x_{j},t)n(x_{j},t)-\sum _{j=1}^{\infty }K(x_{i},x_{j})n(x_{i},t)n(x_{j},t).$
There exists a unique solution for a chosen kernel function.

## Coagulation kernel

The operator, K, is known as the coagulation kernel and describes the rate at which particles of size $x_{1}$ coagulate with particles of size $x_{2}$. Analytic solutions to the equation exist when the kernel takes one of three simple forms:
    $K=1,\quad K=x_{1}+x_{2},\quad K=x_{1}x_{2},$
known as the constant, additive, and multiplicative kernels respectively. For the case $K=1$ it could be mathematically proven that the solution of Smoluchowski coagulation equations have asymptotically the dynamic scaling property. This self-similar behaviour is closely related to scale invariance which can be a characteristic feature of a phase transition.
However, in most practical applications the kernel takes on a significantly more complex form. For example, the free-molecular kernel which describes collisions in a dilute gas-phase system,
    $K={\sqrt {\frac {\pi k_{B}T}{2}}}\left({\frac {1}{m(x_{1})}}+{\frac {1}{m(x_{2})}}\right)^{1/2}\left(d(x_{1})+d(x_{2})\right)^{2}.$
Some coagulation kernels account for a specific fractal dimension of the clusters, as in the diffusion-limited aggregation:
    $K={\frac {2}{3}}{\frac {k_{B}T}{\eta }}\left(x_{1}^{1/y_{1}}+x_{2}^{1/y_{2}}\right)\left(x_{1}^{-1/y_{1}}+x_{2}^{-1/y_{2}}\right),$
or Reaction-limited aggregation:
    $K={\frac {2}{3}}{\frac {k_{B}T}{\eta }}{\frac {(x_{1}x_{2})^{\gamma }}{W}}\left(x_{1}^{1/y_{1}}+x_{2}^{1/y_{2}}\right)\left(x_{1}^{-1/y_{1}}+x_{2}^{-1/y_{2}}\right),$
where $y_{1},y_{2}$ are fractal dimensions of the clusters, $k_{B}$ is the Boltzmann constant, $T$ is the temperature, $W$ is the Fuchs stability ratio, $\eta$ is the continuous phase viscosity, and $\gamma$ is the exponent of the product kernel, usually considered a fitting parameter. For cloud, the kernel for coagulation of cloud particles are usually expressed as:
    $K=\pi [r(x_{1})+r(x_{2})]^{2}|v(x_{1})-v(x_{2})|E_{coll}(x_{1},x_{2}),$
where $r(x)$ and $v(x)$ are the radius and fall speed of the cloud particles usually expressed using power law.
Generally the coagulation equations that result from such physically realistic kernels are not solvable, and as such, it is necessary to appeal to numerical methods. Most of deterministic methods can be used when there is only one particle property (x) of interest, the two principal ones being the method of moments and sectional methods. In the multi-variate case, however, when two or more properties (such as size, shape, composition, etc.) are introduced, one has to seek special approximation methods that suffer less from curse of dimensionality. Approximation based on Gaussian radial basis functions has been successfully applied to the coagulation equation in more than one dimension.
When the accuracy of the solution is not of primary importance, stochastic particle (Monte Carlo) methods are an attractive alternative. Through this method, to compute the coagulation rates for different coagulation events, the simulation entries are virtualized to be equally weighted. The accuracy of this transformation can be adjusted such that just those coagulation events are considered while keeping the number of simulation entries constant.

## Condensation-driven aggregation

In addition to aggregation, particles may also grow in size by condensation, deposition or by accretion. Hassan and Hassan recently proposed a condensation-driven aggregation (CDA) model in which aggregating particles keep growing continuously between merging upon collision. The CDA model can be understood by the following reaction scheme
    $A_{x}(t)+A_{y}(t){\stackrel {v(x,t)}{\longrightarrow }}A_{(\alpha +1)(x+y)}(t+\tau ),$
where $A_{x}(t)$ denotes the aggregate of size $x$ at time $t$ and $\tau$ is the elapsed time. This reaction scheme can be described by the following generalized Smoluchowski equation
    ${\Big{{\partial } \over {\partial t}}+{{\partial } \over {\partial x}}v(x,t){\Big ]}n(x,t)=-n(x,t)\int _{0}^{\infty }K(x,y)n(y,t)dy+{{1} \over {2}}\int _{0}^{x}dyK(y,x-y)n(y,t)n(x-y,t).$
Considering that a particle of size $x$ grows due to condensation between collision time $\tau (x)$ equal to inverse of $\int _{0}^{\infty }K(x,y)n(y,t)dy$ by an amount $\alpha x$ i.e.
    $v(x,t)={{\alpha x} \over {\tau (x)}}=\alpha x\int _{0}^{\infty }dyK(x,y)n(y,t).$
One can solve the generalized Smoluchowski equation for constant kernel to give
    $n(x,t)\sim t^{-(2+2\alpha )}e^{-{{x} \over {t^{1+2\alpha }}}},$
which exhibits dynamic scaling. A simple fractal analysis reveals that the condensation-driven aggregation can be best described as a fractal of dimension
    $d_{f}={{1} \over {1+2\alpha }}.$
The $d_{f}$th moment of $n(x,t)$ is always a conserved quantity which is responsible for fixing all the exponents of the dynamic scaling. Such conservation law has also been found in Cantor set too.