PolyRandGrpah

Analytic results on the polymerisation random graph model. 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.

References in zbMATH (referenced in 1 article , 1 standard article )

Showing result 1 of 1.
Sorted by year (citations)

  1. Kryven, Ivan: Analytic results on the polymerisation random graph model (2018)