Calculation of cohesiveness probability for recursively defined random networks

For recursively defined random networks in this paper recursive and asymptotic formulas of a calculation of cohesiveness probability are constructed. A comparison with known algorithms shows that in suggested algorithms it is not necessary to find maximal systems of frames. That accelerates calculations significantly. Numerical experiments which confirm an operation speed of suggested algorithms and an accuracy of assumed asymptotic formulas has made.