Exact combinatorial approach to finite coagulating systems through recursive equations

DOI10.1016/S0034-4877(19)30072-2MaRDI QIDQ2194261zbMATH OpenWikidataFDO

Authors Michał Łepek, PaweŁ Kukliński, Agata Fronczak, Piotr Fronczak

Publication date 25 August 2020

Published in Reports on Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1809.07239

zbMATH Keywords

aggregationSmoluchowski equationcoagulation processcombinatorial solutionsgenerating function cluster size probability

Mathematics Subject Classification ID

Dynamic and nonequilibrium phase transitions (general) in statistical mechanics (82C26)

Abstract: 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 expression for the probability of finding a coagulating system with an arbitrary kernel in a given cluster configuration is derived. Then, the average number of such clusters and the standard deviation of these solutions can be calculated. In this work, recursive equations for all possible growth histories of clusters are introduced. The correctness of our expressions was proved based on the comparison with numerical results obtained for systems with constant, multiplicative and additive kernels. For the first time the exact solutions for the multiplicative and additive kernels were obtained with this framework. In addition, our results were compared with the results arising from the solutions to the mean-field Smoluchowski equation. Our theoretical predictions outperform the classic approach.

Recommendations

• Exact kinetics of a coagulating system with the kernel \(K = 1\)
• Self-similar behaviour in the coagulation equations
• Two solvable systems of coagulation equations with limited aggregations
• Exact solutions for the coagulation-fragmentation equation
• scientific article; zbMATH DE number 2216043

Cites work

• scientific article; zbMATH DE number 2126323 (Why is no real title available?)
• A Global Existence Theorem for Smoluchowski's Coagulation Equations
• A kinetic view of statistical physics
• A new combinatorial representation of the additive coalescent
• An introduction to mathematical models of coagulation--fragmentation processes: a discrete deterministic mean-field approach
• Deterministic and stochastic models for coalescence (aggregation and coagulation): A review of the mean-field theory for probabilists
• Exact kinetics of a coagulating system with the kernel \(K = 1\)
• Gelation in coagulating systems
• Proof of dynamical scaling in Smoluchowski's coagulation equation with constant kernel
• Random Fragmentation and Coagulation Processes
• Scaling theory for gelling systems: work in progress

Cited in

(3)

• Coalescense with arbitrary-parameter kernels and monodisperse initial conditions: a study within combinatorial framework
• Combinatorial solutions to coagulation kernel for linear chains
• System of recursive equations for the partition functions of 1D models

This page was built for publication: Exact combinatorial approach to finite coagulating systems through recursive equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2194261)