Analytic results on the polymerisation random graph model

DOI10.1007/S10910-017-0785-1MaRDI QIDQ1703405zbMATH OpenOpenAlexWikidataFDO

Authors Ivan Kryven

Publication date 2 March 2018

Published in Journal of Mathematical Chemistry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

random graphconnected componentsmolecular networkpolymerisation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Dynamic and nonequilibrium phase transitions (general) in statistical mechanics (82C26) Statistical mechanics of polymers (82D60)

Abstract: The step-growth polymerisation of a mixture of arbitrary-functional monomers is viewed as a time-continuos random graph process with degree bounds that are not necessarily the same for different vertices. The sequence of degree bounds acts as the only input parameter of the model. This parameter entirely defines the timing of the phase transition. Moreover, the size distribution of connected components features a rich temporal dynamics that includes: switching between exponential and algebraic asymptotes and acquiring oscillations. The results regarding the phase transition and the expected size of a connected component are obtained in a closed form. An exact expression for the size distribution is resolved up to the convolution power and is computable in subquadratic time. The theoretical results are illustrated on a few special cases, including a comparison with Monte Carlo simulations.

Recommendations

• scientific article; zbMATH DE number 3942596
• Polymers and random graphs
• A Graph-Valued Markov Process as Rings-Allowed Polymerization Model: Subcritical Behavior
• scientific article; zbMATH DE number 4209276
• scientific article; zbMATH DE number 3954729

Cites work

• scientific article; zbMATH DE number 49554 (Why is no real title available?)
• scientific article; zbMATH DE number 1111371 (Why is no real title available?)
• A system of grabbing particles related to Galton-Watson trees
• An introduction to mathematical models of coagulation--fragmentation processes: a discrete deterministic mean-field approach
• Dynamics of random graphs with bounded degrees
• Networks. An introduction.
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The structure of typical clusters in large sparse random configurations
• Topology in chemistry. Discrete mathematics in molecules.

Cited in

(12)

• scientific article; zbMATH DE number 3942596 (Why is no real title available?)
• scientific article; zbMATH DE number 4082594 (Why is no real title available?)
• General nucleation-growth type kinetic models of nanoparticle formation: possibilities of finding analytical solutions
• Random polymers on the complete graph
• On the analyticity properties of scaling functions in models of polymer collapse
• PolyRandGrpah
• scientific article; zbMATH DE number 4209276 (Why is no real title available?)
• Several topological indices of random caterpillars
• Investigating several fundamental properties of random lobster trees and random spider trees
• scientific article; zbMATH DE number 7581598 (Why is no real title available?)
• Polymers and random graphs
• Random tree-type partitions as a model for acyclic polymerization: Holtsmark (3/2-stable) distribution of the supercritical gel

Describes a project that uses

Uses Software

• GitHub

This page was built for publication: Analytic results on the polymerisation random graph model

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