论文信息 - COOPERATIVE EFFECTS IN COMPLETE GRAPH WITH LOW RELIABLE ARCS

COOPERATIVE EFFECTS IN COMPLETE GRAPH WITH LOW RELIABLE ARCS

An analysis of the limit A Pn n    lim of connectivity probability (CP) n P of complete graph with n nodes and independent arcs which have working probability a n is made. It is proved that for 1 0   a we have the equality 1  A and for a  1 the equality 0  A .

Feb Ras | G. Tsitsiashvili | G. Tsitsiashvili | Feb Ras

[1] C. Tanguy. Asymptotic dependence of average failure rate and MTTF for a recursive, meshed network architecture , 2009 .

[2] Christian Tanguy,et al. What is the probability of connecting two points? , 2006, ArXiv.

[3] Feller William,et al. An Introduction To Probability Theory And Its Applications , 1950 .

[4] Ilya Gertsbakh,et al. Models of Network Reliability: Analysis, Combinatorics, and Monte Carlo , 2009 .

[5] W. Seffens. Order From Chaos , 1999, Science.

[6] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .