|
Conference publicationsPhase Conversion of Fault-Tolerance of Increasing Network with Arbitrary Initial ConfigurationFault-tolerance of a finite computing net with arbitrary graph, containing elements with cer-tain probability of fault and restore, is analyzed. Algorithm for net growth at each work cycle is suggested. It is shown that if the rate of net increase is sufficiently big then the probability of infinity faultless work is positive. Estimated critical net increase rate is logarithmic over the number of work cycles |
