Abstract:
The article proposes a statistical description of processes of self-assembly of graphs with cycles, loops, and multiple edges. For controlled Markov processes of self-assembly of trees with n different vertices, an iterative representation of the state of the process is obtained in quadratures of the solution of a system of differential equations with $n-1$ unknowns. A spatial assumption is introduced, on the basis of which an iterative representation in quadratures is obtained for the state of the process of self-assembly of graphs with cycles, loops, and multiple edges.
Fulltext:
PDF file (606 kB)