Exact combinatorial approach to finite coagulating systems through recursive equations

DOI10.1016/S0034-4877(19)30072-2zbMATH Open1441.82020arXiv1809.07239WikidataQ127375116 ScholiaQ127375116MaRDI QIDQ2194261FDOQ2194261

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)

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.

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

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

zbMATH Keywords

aggregationSmoluchowski equationcoagulation processcombinatorial solutionsgenerating function cluster size probability

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

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

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)