Analytical results on the polymerisation random graph model

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.

19 pages, 7 figures

References in corpus (5)

• Emergence of the giant weak-component in directed random graphs with arbitrary degree distributions
• Random graph approach to multifunctional molecular networks
• General expression for the component size distribution in infinite configuration networks
• Predicting multidimensional distributive properties of hyperbranched polymer resulting from AB2 polymerization with substitution, cyclization and shielding
• The structure of typical clusters in large sparse random configurations

Cited by in corpus (5)

• How does bond percolation happen in coloured networks?
• Dynamic Networks that Drive the Process of Irreversible Step-Growth Polymerization
• Finite connected components in infinite directed and multiplex networks with arbitrary degree distributions
• Enhancing the robustness of a multiplex network leads to multiple discontinuous percolation transitions
• Learning heterogenous reaction rates from stochastic simulations