CC BY
9
ASYMPTOTIC ANALYSIS OF LATTICE RELIABILITY
G.Sh. Tsitsiashvili
640041, Russia, Vladivostok, Radio str. 7, IAM, FEB RAS,
e-mail: [email protected]
ABSTRACT
Asymptotic formulas for connection probabilities in a rectangular lattice with identical and independent arcs are obtained.. For a small number of columns these probabilities may be calculated by the transfer matrices method. But if the number of columns increases then a calculation complexity increases significantly. A suggested asymptotic method allows to make calculations using a sufficiently simple geometric approach in a general case.
INTRODUCTION
A calculation of connection probabilities in a random graph is a complex problem. In a general case it demands a number of arithmetical operations which increases as a geometric progression with a number of arcs in the graph [1], [2]. So this problem is very important in the reliability theory. It attracts special interest of physicists [3], [4] if we consider a random lattice with identical arcs.
A main approach to this problem solution is is in an application of the transfer matrices. In this method it is necessary to obtain recurrent formulas (by a length of the lattice). But a dimension of the transfer matrices increases sufficiently fast with a width of the lattice.
So an idea to construct an alternative approach origins. In this paper this approach is based on a suggestion that a work probability or a failure probability of arcs is small. These assumptions allow to obtain asymptotic formulas in a form of sums of work probabilities for ways or of failure probabilities for cross sections with minimal numbers of arcs.
A determination of such asymptotes becomes sufficiently simple though bulky enumerative problem of the graph theory.
1 MAIN DESIGNATIONS
Suppose that r={U,W} is the no oriented graph with the finite nodes set U, with the finite arcs set W={w=(u,v), u,ve U} and with the fixed initial and final nodes u0,v0 e U. Denote by <f={Ri,...,Rm] the set of all acyclic ways R between the nodes u0, v0 and the set L={L} of all cross sections which are defined by the formulas
A = { A c U, u0 e A, v0 £ A}, L = L (A) = {w = (u, v), u e A, v eU \ A},
L={L(A), AeA}. An each arc we W works with the probability p, 0<p<1,p = 1 -p, independently on all other arcs.
Denote Pr = Pr(pw, we W) the probability that there is a working way between the nodes u0, v0 in the graph r and designate by P = 1 - Pr the failure probability of this graph. Suppose that UR is the event that all arcs in the way R work and VL the event that all arcs in the cross section L fail. From the definition is it easy to obtain that
(1)
2 ASYMPTOTIC FORMULAS
From the first equality in (1) obtain:
SP K )- S P (UrU^ )< Pr<XP {UR, ).
i=1 ' ' 1<i<k<m
Consequently if the condition p{h) ^ 0, h ^ 0, is true then
i=1
m . , m
Pr ~ S P (URj ) = S n P (h ), h ^ 0,
(2)
i=1 i=1 weR
And the relative error of the asymptotic formula (2) is
Ar =
Pr
sm=i p {uRi)
-1
< mp {h 0, h ^ 0.
(3)
Denote L1 ={Li,..., Ln} the set of all minimal (by a number of arcs) cross sections from the family L. The second formula in (1) and the family Li definition lead to the equality
Pr= P { U Fl 1. (4)
KLeL, J
From the formula (4) using an induction by n obtain the inequalities
ip (vl, )-! P (VLVLt) Pr^itp (vl, ).
i=1 1<i<k<n
So if the condition p {h) ^ 0, h ^ 0, is true then
Pr ~ SSP {vLi ) = i n P (h), h ^ 0,
i=1 i=1 weLj
And the relative error of the asymptotic formula (5) is
Pr
i=1
(5)
Ar =
sn=1 P (VL)
-1
< np(h0, h ^ 0.
(6)
3 LOW RELIABLE ARCS
Consider the finite lattice with the size (n_+n+n+)*(m_+m+m+) and fix the initial node (0,0) and the final node (n,m) in the internal rectangular S. The nodes (-n,-m_), (n+ n+, m +m+) are extreme for the rectangular S' which contains S. Suppose thatp(h)= h, l, is the number of arcs in the way R, , then P(UR ) = hl and from the formula (2) obtain
m
Pr ~ 2 hl' ~ ahb, i=1
where b = min , a is the number of the ways which contain b arcs . It is easy to obtain obvious that
1<i <m
b=m+n, a = Cm+n.
4 HIGH RELIABLE ARCS
Suppose that p(h) = h, l, is the number of arcs in the cross section L,, then P(VL ) = h and from the formula (2) obtain
_ m
Pr ~ 2 hl' ~ chd, ,=i
where d = min , c is the number of cross sections which have d arcs.
1<i<m
Consider the following cases represented on figures with the same numbers:
1) n_= m_= n+= m+=0; 2) n_= m_=m+=0, n+>0; 3) n_= m_=0, n+>0, m+>0;
4) m_=m+=0, n+>0, n_>0; 5) m_=0, n_>0, n+>0, m+>0; 6) n_>0, m_= n+=0, m+=0;
7) m_>0, n_>0, n+>0, m+>0. In the case 1) internal and external rectangular coincide: 5=5", in the cases 2) - 7) the inclusion S^S' takes place.
Remark that listed cases do not describe all possible situations. For example an analog of the condition n_= m_= m+=0, n+>0 (see the case 2) may be the condition n_= m_= n+=0, m+>0. But it is simple to check that all possible arrangements may be reduced to listed ones after a replacement of + by - and visa versa or after a tumbling of the lattice S on ninety degrees to the left or to the right.
The considered lattice may be interpreted as an oriented graph in which the arcs (u,v), (v,u) belong or do not belong to the graph simultaneously. So from the Ford - Falkerson theorem about an equality of a maximal flow and a minimal ability to handle of cross sections [5, ra. I] it is easy to obtain the inequality d < min (a,b) where a is the number of arcs outgoing from the initial node and b is number of arcs incoming to the final node. This inequality in the listed cases transforms into the formulas:
o-
Figure 1. On the left d<2, m>0, on the right d<1, m=0.
Figure 2. On the left d<2, m>0, on the right d<1, m=0.
Figure 3. d=2, on the left m>0, on the right m=0.
o-
Figure 4. On the left above; d<3, m>1, on the right above d<2, m=1, below d<1, m=0.
"f-
Figure 5. On the left d<3, m>0, on the right d<2, m=0.
-b
Figure 6. On the left d<3, m>0, on the right d<2, m=0.
->
Figure 7. On the left above d<4, m>0, on the right above d<4, m=0, m++ m_>2,
below d<3, m=0, m++m =2.
Then choosing load arcs as marked on these figures and unload arcs as all others it is possible to transform obtained inequalities into equalities.:
1), 2), d=1+I(m>0); 3) d=2; 4) d=3I(m>0) +2I(m=1)+ I(m=0); 5), 6) d=3I(m>0) +2I(m=0); 7) d=4I(m>0) +4I(m=0, m + m+>2) +3I(m=0, m + m+=2). Calculate now the asymptotic constant c. For this purpose show on the following figures all possible types of cross sections with minimal number of arcs.
o
Figure 1a. On the left above m>0, on the right above m=1, on the left below m>0, n=1,
on the right below m=0
Figure 2a. On the left above m>0, on the right above m=1, below m=0
Figure 3a. On the left m>0, on the right m=0
Figure 4a. Overhead to the left m>0, to the right m>0, n+=1, middle to the left m>0, n+= n-=1, to the right m=2, bottom to the left m=1, to the right m=0
-<b---4-
Figure 6a. Overhead to the left m>0, to the right m=1, m+=1, bottom m=0, m+=1
-6--- -6---*
Figure 5a. Overhead to the left m>0, to the right m>0, n+=1, bottom to the left m=0, m+>1,
to the right m=0, m+=1
Figure 7a. Overhead to the left m>0, to the right m=1, m++ m.=1, middle to the left m=0, to the right m=0, m+=2, m.=12, bottom m=0, m.= m+=1
Using these figures it is easy to obtain the following equalities:
1) c=2I(m>0)+nI(m=0,1)+mI(n=1); 2) c=I(m>0)+nI(m=0,1); 3) c=1+nI(m=0,m+=1); 4) c=I(m. 2)[2I(n+, n> 1)+ 3I(n+>1, n = 1 или n+ = 1, n> 1)+ 4I(n+= n = 1)]+nI(m=0,1,2); 5) c=2I(m>0)+ I(m=0)[1+ nI(m+=1)]; 6) c=I(m>0)+ nI(m=0); 7) c=2I(m>1)+ I(m=1)[2+ nI(m++m=2)]+ I(m=0)[2I(m++m>2)+ nI(m++m=2,3)].
CONCLUSION
As a result an initial asymptotic problem of a connection probabilities calculation is divided into a few of comparably simple geometric - combinatorial problems. A main difficulty of this solution is in a choice of this division.
REFERENCES
1. Barlow, R.E. and Proschan, F. 1965. Mathematical Theory of Reliability. London and New York: Wiley.
2. Ushakov, I.A. et al. Reliability of technical systems: Handbook. 1985. Moscow: Radio and Communication. (In Russian).
3. Tanguy, C. What is the probability of connecting two points? 2007. J. Phys. A: Math. Theor. Vol. 40: 14099-14116.
4. Tanguy, C. Asymptotic dependence of average failure rate and MTTF for a recursive meshed network architecture. 2009. Reliability and risk analysis: theory and applications. Vol. 2 (13), part 2: 45-54.
5. Ford, L.R., Fulkerson, D.R. Flows in networks. 1962. New Jersey. Princeton: Princeton university press.
