【摘要】 本文提出了一种计算网络整体概率连通性的新算法。该算法首先构造了一种多级状态空间分解法 ,对网络状态空间进行了分解 ,并对分解所得的生成事件提出了一种特殊的生成子网构造法 ,从而有效减少了网络状态空间集。新算法通过迭代运算用上下界来逼近网络概率连通性的值 ,与传统算法相比 ,具有运算速度快、收敛性能好 ,很适合近似计算的特点。更多还原

【Abstract】 A new algorithm for network probabilistic connectivity is presented in this paper In this algorithm,the multi level decomposition algorithm of the network states space is given A new method to construct sub graphs of the obtained events is proposed,which can greatly reduce the dimensions of network states space An iterative computation is used to approximate the lower bound and the upper 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更多还原