Algorithm for evaluating network probabilistic connectivity

A new algorithm for evaluating network probabilistic connectivity is presented.In this algorithm,the simplification algorithm of the network state space is given.And the network state space is divided into multilevel to reduce the size of state spaces.For each network state vector,a new method to construct sub graphs is proposed,which judges whether this vector can maintain the connectivity of original network.An interactive method is used to compute the lower bound and the upper bound of the probabilistic connectivity for evaluating the true value.Compared with other algorithms,this technique is characterized by its fast computing and converging speed,together with a high universal property,which is most suitable for the approximating computation of large-scale networks.