Combinatorial solutions to generalized electrorheological kernel aggregation

How initial condition impacts aggregation -- a systematic numerical study

In a process of aggregation, a finite number of particles merge irreversibly to create growing clusters. In this work, impact of particular initial conditions: monodisperse, power-law, exponential, and inspired by condensation nuclei was tested against several aggregation processes: constant, additive, product, electrorheological, anti-social, Berry's, Brownian, shear, and gravitational kernels. Coagulating systems consisting of a thousand monomers were observed in the late time of the evolution, for the moment when only fifty clusters were left in the system. In this way, the impact of partic…

关于马库斯-卢希尼克不可逆聚集问题的组合解综述

A mini-review on combinatorial solutions to the Marcus-Lushnikov irreversible aggregation

本文综述了针对马库斯-卢希尼克不可逆聚集问题的组合解方法，探讨了其理论基础、应用及局限性，并提出了未来研究方向。

Rate equation limit for a combinatorial solution of a stochastic aggregation model

In a recent series of papers, an exact combinatorial solution was claimed for a variant of the so-called Marcus--Lushnikov model of aggregation. In this model, a finite number of aggregates, are initially assumed to be present in the form of monomers. At each time step, two aggregates are chosen according to certain size-dependent probabilities and irreversibly joined to form an aggregate of higher mass. The claimed result given an expression for the full probability distribution over all possible size distributions in terms of the so-called Bell polynomials. In this paper, we develop the asym…

Exact combinatorial approach to finite coagulating systems

The paper outlines an exact combinatorial approach to finite coagulating systems. In this approach, cluster sizes and time are discrete, and the binary aggregation alone governs the time evolution of the systems. By considering the growth histories of all possible clusters, the exact expression is derived for the probability of a coagulating system with an arbitrary kernel being found in a given cluster configuration when monodisperse initial conditions are applied. Then, this probability is used to calculate the time-dependent distribution for the number of clusters of a given size, the avera…

Exact combinatorial approach to finite coagulating systems through recursive equations

This work outlines an exact combinatorial approach to finite coagulating systems through recursive equations and use of generating function method. In the classic approach the mean-field Smoluchowski coagulation is used. However, the assumptions of the mean-field theory are rarely met in real systems which limits the accuracy of the solution. In our approach, cluster sizes and time are discrete, and the binary aggregation alone governs the time evolution of the systems. By considering the growth histories of all possible clusters and applying monodisperse initial conditions, the exact expressi…