Exact combinatorial approach to finite coagulating systems through recursive equations

DOI10.1016/S0034-4877(19)30072-2zbMath1441.82020arXiv1809.07239WikidataQ127375116 ScholiaQ127375116MaRDI QIDQ2194261

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

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)

Related Items (2)

Coalescense with arbitrary-parameter kernels and monodisperse initial conditions: a study within combinatorial framework ⋮ Combinatorial solutions to coagulation kernel for linear chains

Cites Work

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

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