Paper
A review on combinatorial approach to aggregation
Authors
Michał Łepek, Agata Fronczak, Piotr Fronczak
Abstract
Recently, a combinatorial approach to discrete, finite, and irreversibly aggregating systems has been progressively developed. In this work, we review its achievements up to the present moment, focusing on the practical aspects and discussing its limitations. First, we present the assumptions and combinatorial foundations of the approach, which are based on direct counting of the system states, in contrast to the previous approaches of Smoluchowski and Marcus--Lushnikov. A method to obtain combinatorial expressions for the average number of clusters of a given size and the corresponding standard deviation is described by solving the simplest example of a constant kernel. Then, we extend consideration to a number of kernels (e.g., additive, product, linear--chain, condensation), which were recently solved by explicitly finding the number of internal states of the cluster of a given size. Next, we show that theoretical predictions for any given kernel may be obtained with no need to find an explicit solution but using a recursive expression. We exploit this opportunity to present the use of combinatorial expressions to solve kernels related to the real processes of aerosol growth and planetesimal formation. At this point, a comparison to numerical results appears. Other potential application fields are indicated, including dust agglomeration and polymer growth. Finally, issues related to the varying precision of the theoretical predictions are summarized. In the last section, we propose open problems.