A new algorithm for network probabilistic connectivity

A new algorithm for network probabilistic connectivity is presented. In this algorithm, the multi-step decomposition algorithm of the network states space is given. A new method to construct sub-graphs for the obtained events is proposed, which can greatly reduce the dimensions of network states space. An iterative computation is used to approximate lower bound of the value of the probabilistic connectivity. Compared with other algorithms, ours is characterized by its fast computing and converging speed, and is most suitable for approximating computation.