A Recursive Formula for the Reliability of a -Uniform...
Transcript of A Recursive Formula for the Reliability of a -Uniform...
![Page 1: A Recursive Formula for the Reliability of a -Uniform ...downloads.hindawi.com/journals/mpe/2018/3131087.pdfΒ Β· A Recursive Formula for the Reliability of a -Uniform Complete Hypergraph](https://reader033.fdocuments.net/reader033/viewer/2022053004/5f0880c47e708231d4225507/html5/thumbnails/1.jpg)
Research ArticleA Recursive Formula for the Reliability of a π-Uniform CompleteHypergraph and Its Applications
Ke Zhang ,1,2,3 Haixing Zhao ,1,2,3,4 Zhonglin Ye ,2,3,4 and Lixin Dong1,2,3
1 School of Computer, Qinghai Normal University, Xining 810008, China2Key Laboratory of Tibetan Information Processing and Machine Translation in QH, Xining 810008, China3Key Laboratory of Tibetan Information Processing, Ministry of Education, Xining 810008, China4School of Computer Science, Shaanxi Normal University, Xiβan 710062, China
Correspondence should be addressed to Haixing Zhao; [email protected]
Received 25 August 2018; Accepted 24 September 2018; Published 14 October 2018
Academic Editor: Frederico R. B. Cruz
Copyright Β© 2018 Ke Zhang et al.This is an open access article distributed under theCreative CommonsAttribution License, whichpermits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
The reliability polynomial π (π, π) of a finite graph or hypergraph π = (π, πΈ) gives the probability that the operational edges orhyperedges of π induce a connected spanning subgraph or subhypergraph, respectively, assuming that all (hyper)edges of π failindependentlywith an identical probabilityπ = 1βπ. In this paper,we investigate the probability that the hyperedges of a hypergraphwith randomly failing hyperedges induce a connected spanning subhypergraph.The computation of the reliability for (hyper)graphsis an NP-hard problem. We provide recurrence relations for the reliability of π-uniform complete hypergraphs with hyperedgefailure. Consequently, we determine and calculate the number of connected spanning subhypergraphs with given size in the π-uniform complete hypergraphs.
1. Introduction
As we all know, the topological structure of a real-worldcomplex system is often described by a graph. And recently,researchers tend to represent some more complex systems byhypergraphs [1β4]. With the establishment and perfection ofthe hypergraph theory by Berge et al. [5, 6], many interestingobjects in graphs were extended to hypergraphs in a naturalway. Since a graph is a 2-uniform hypergraph, many of thecorresponding results about graphs could be analogized tohypergraphs, and there exist some representative works. Forexample, Dankelmann et al. [7] and Zhao et al. [8] obtainedseveral sufficient conditions for hypergraphs to bemaximallyedge-connected. Gu et al. characterized the degree sequenceof a uniform hypergraph, and this degree sequence makesthe uniform hypergraph π-edge-connected [9]. In [10] and[11], an upper bound of the sum of squares of degrees in agraph and a hypergraph was given, respectively. Moreover,hypergraph theory can be applied to optimize wireless com-munication networks [12]. The network reliability analysisand synthesis have attracted much attention and there exist
various results in [13β16], but in the same field there existseldom results for hypergraphs.
One of the most common measures in network relia-bility is the all-terminal reliability [14]. Suppose that πΊ =(π, πΈ) is a graph where the edges independently fail withthe same probability π. The all-terminal reliability is theprobability that the surviving edges induce a connectedspanning subgraph. It can be expressed as a polynomialπ (πΊ, π) = βππ=πβ1 π π(πΊ)(1 β π)πππβπ, where π π(πΊ) is the numberof connected spanning subgraphs of πΊ containing π edges.The problems of calculating the all-terminal reliability anddesigning reliable network have been probed and studieddeeply in [14].
As a generalization of a graph, the hypergraph provides aneffective method for network description [1, 2, 17]. A networkrepresented by a hypergraph is called a hypernetwork. Moreand more researchers are interested in hypergraphs or hyper-networks. The existing literatures about hypernetworks oftenfocus on the establishment of models [18β20] or topologicalproperties [1, 21, 22]. Extensive researches have been con-ducted in the field of edge-connectivity of hypergraphs [7β9].
HindawiMathematical Problems in EngineeringVolume 2018, Article ID 3131087, 7 pageshttps://doi.org/10.1155/2018/3131087
![Page 2: A Recursive Formula for the Reliability of a -Uniform ...downloads.hindawi.com/journals/mpe/2018/3131087.pdfΒ Β· A Recursive Formula for the Reliability of a -Uniform Complete Hypergraph](https://reader033.fdocuments.net/reader033/viewer/2022053004/5f0880c47e708231d4225507/html5/thumbnails/2.jpg)
2 Mathematical Problems in Engineering
In this paper, we investigate the hypernetwork reliability withedge failure.
Here we define the probability as π (π», π) that theoperational edges of the hypergraph π» induce a connectedspanning subhypergraph. Our main results are recurrencerelations for the calculation of π (πΎππ, π), where πΎππ denotesthe π-uniform complete hypergraphs of order π. Conse-quently, we provide a new method to calculate the num-ber of connected spanning subhypergraphs in πΎππ. The π-uniform complete hypergraphs have long been in the focus ofhypernetwork reliability research for different reasons. Theyappear as subhypergraphs in larger hypernetworks usually.They are the densest ones among all π-uniform hypergraphs,so if we obtain the reliability of the π-uniform completehypergraphs, the upper bounds of the reliability of the π-uniform hypergraphs can be found satisfactory. And theyhave a nice combinatorial structure that allows researcher toexplore their symmetry. For some applications, see [23β25].
In [26] Gilbert presented a recursive algorithm for thecalculation of the all-terminal reliability of a complete graphπΎπ by fixing a vertex V β π and considered the relationshipsbetween all connected subgraphs containing V of order π andcorresponding subgraphs of order π β π, then the probabilityπ (πΎπ, π) is exactly equivalent to the probability that theinduced spanning subgraph is connected for π vertices set.We substantially generalize this idea and propose the result inhypergraphs based on above analogies, and the research resultfrom Gilbert is a special case of the research achievementsproposed by this paper.
Trees are among the most fundamental, useful, andunderstandable objects in all of graph theory. This kind ofcommon sense is also true for hypergraphs [27β29]. Anotherimportant part of this paper is to generalize the notion ofa tree to uniform hypergraphs and to investigate enumera-tion of connected spanning subhypergraphs, as to calculatethe number of spanning hypertrees in π-uniform completehypergraphs.
The network reliability with the edge failure is closelyrelated to the number of spanning trees of the correspondinggraph [30]. We obtain the number of spanning hypertrees inπ-uniform complete hypergraphs with the inspiration of sucha similar relationship in general graphs.
The remaining parts of this paper are organized as follows.Firstly, we introduce some necessary definitions and nota-tions. Then we present recursive relations for the reliabilitypolynomial with edge failure of a π-uniform complete hyper-graph. Counting spanning hypertree in a π-uniform completehypergraph is researched in Section 3. Consequently, wefinish the entire paper with some conclusions and openproblems in Section 4.
1.1. Nomenclature andDefinitions. Manydefinitions of hyper-graphs would be naturally extended from graphs; undefinedterms can be found in [5, 6]. A hypergraphπ» is a pair (π, π),where π is the vertex set ofπ» and π is a collection of distinctnonempty subsets of π. An element in π is a hyperedge orsimply an edge of π». We consider the hypergraph with noisolated vertices, which are not contained in any edge. Letπ = {πΈ1, πΈ2, β β β , πΈπ}. A hypergraph π» is simple hypergraph
if πΈπ β πΈπ implies that π = π for any π, π with 1 β€ π, π β€ π. Thehypergraphs researched in this paper are simple hypergraphs.A hypergraphπ» is a π-uniform hypergraph if |πΈπ| = π for eachπ with 1 β€ π β€ π. Thus, a graph is a 2-uniform hypergraph,and vice versa. Let π, π be integer and hold 2 β€ π β€ π β 1.Wedefine the π-uniform complete hypergraph of order π as ahypergraph denoted as πΎππ containing all the π-subsets of theset π of cardinality π.
In the following parts, we conduct the same researchesabout reliability with edge failure of graphs on hypergraphs.Let V denote an arbitrary vertex in π». We assume that alledges of π» fail independently with identical probability π.The surviving subhypergraph of π» is called the connectedspanning subhypergraph of π». The reliability polynomialπ (π», π) gives the probability of the surviving subhypergraphof a hypergraphπ»(π, π).
The reliability polynomial of a hypergraph is often pre-sented in the literature as π (π», π) with π = 1 β π. We writeπ (π», π) for simpler presentation as a function of the edgefailure probability π.
The tree is an important object in graph theory, andthe number of spanning trees of a graph is closely relatedto the reliability of this graph [30]. The definition of a treecould be extended to the hypergraph, which is consequentlycalled a hypertree or simply a tree. Although there aremany statements of the definition of a tree in graph theory,these statements are equivalent and intuitive. However, thegeneralization of the definition of a tree in hypergraphs ismuchmore complicated, and descriptions of these definitionsare completely different [27β29]. In this paper, a hypertreeis defined as a connected hypergraph which is disconnectedby removing any edge among the edge set [27]. A spanninghypertree of π» is a spanning subhypergraph with the mini-mum number of edges of π» that is a hypertree. We denotethe number of spanning trees ofπ» by π(π»).
With regard to the lower bound of the number of edgesof connected π-uniform hypergraphs, Lai et al. [9] give thefollowing results.
Theorem 1. Letπ» be a π-uniform hypergraph with π vertexes.If π» is connected, then π β₯ (π β 1)/(π β 1). Moreover, theequality holds if and only if π» β πΈ has π components for anyedge πΈ which belongs to π(π»).2. A Recursive Formula for the Reliability of aπ-Uniform Complete Hypergraph
In this section, we present a recurrence relation for the com-putation of the reliability polynomial of π-uniform completehypergraphs. As a preparation, we restate a classical theoremconcerning the all-terminal reliability of a complete graph. Bydistinguishing one vertex of a complete graph, Gilbert [26]obtained the following results.
Theorem 2. The reliability polynomial of the complete graphπΎπ(π β₯ 2) satisfies the following recurrence relations:π (πΎπ, π) = 1 β πβ1β
π=1(π β 1π β 1)π (πΎπ, π) ππ(πβπ). (1)
![Page 3: A Recursive Formula for the Reliability of a -Uniform ...downloads.hindawi.com/journals/mpe/2018/3131087.pdfΒ Β· A Recursive Formula for the Reliability of a -Uniform Complete Hypergraph](https://reader033.fdocuments.net/reader033/viewer/2022053004/5f0880c47e708231d4225507/html5/thumbnails/3.jpg)
Mathematical Problems in Engineering 3
Table 1: Reliability polynomial for small hypergraphs.
r n4 5 6 7
3 1 β 4π3 + 3π4 1 β 5π6 + 10π9 β 6π10 1 β 6π10 + 15π16 β 10π18 1 β 7π15 + 21π25 β 35π30 + 140π33 β 210π34+90π354 1 β 5π4 + 4π5 1 β 6π10 + 15π14 β 10π15 1 β 7π20 + 21π30 β 35π34 + 20π355 1 β 6π5 + 5π6 1 β 7π15 + 21π20 β 15π216 1 β 7π6 + 6π7
Equation (1) and the initial condition π (πΎ1, π) = 1 uniquelydetermine the value π (πΎπ, π).2.1.TheReliability of a π-UniformComplete Hypergraph. Nowwe consider the reliability of a π-uniform complete hyper-graph. In view of Theorem 2 we investigate the reliabilitypolynomial of the π-uniform complete hypergraph. Ourmainresult below generalizes Gilbertβs result.
Theorem 3. The reliability polynomial of the π-uniform com-plete hypergraph πΎππ, where π β₯ 2, 2 β€ π β€ π β 1, satisfies thefollowing recurrence relations:
π (πΎππ, π) = 1 β (π β 10 )π (πΎ1, π) π( πβ1πβ1 )β πβ1βπ=π
(π β 1π β 1)π (πΎππ, π) π( ππ )β(ππ )β( πβππ ).(2)
Equation (2) uniquely determines π (πΎππ, π) based on the initialvaluesπ (πΎ1, π) = 1, π (πΎππ , π) = 1βπ, and the condition ( ππ ) =0 (π < π).Proof. Let us fix a vertex V β π(πΎππ). The proof process iscompleted by the following two steps.
Step 1. The first quantity on the right side of the equationthat is subtracted from 1 is equal to π( πβ1πβ1 ), which gives theprobability that makes the vertex V isolated from the πΎππ.There are ( πβ1πβ1 ) edges in πΎππ containing V.
Step 2. The second quantity is the form of summation asβπβ1π=π ( πβ1πβ1 ) π (πΎππ, π)π(ππ )β(ππ )β(πβππ ), which gives the proba-bility that the root vertex V exactly builds the connectedcomponent with π β 1 vertices, where all such connectedcomponents of order πmust contain vertex V.There are ( πβ1πβ1 )possible items to select the vertex set π΄ of order π β 1 in theremaining πβ 1 vertices. Then π (πΎππ, π) is the probability thatthe set π΅ = π΄ βͺ {V} induces a connected subhypergraph.In the special case π = π, the hypergraph with only oneedge containing all π vertices is denoted as πΎππ . According tothe definition of the reliability of the hypernetwork with theedge failure, we can obtain π (πΎππ , π) = 1 β π. The expressionπ( ππ )β(ππ )β(πβππ ) is the probability that all edges fail betweenπΎππ β π΅ and π΅ in π-uniform complete hypergraph πΎππ. Finally,we adopt the expression ( ππ ) β ( ππ ) β ( πβππ ) to calculate the
number of edges connecting a component of order π β π andthe other induced by π΅.
In Theorem 3, the special case π = 2 is the Gilbertβs resultinTheorem 2.
Table 1 shows some polynomials for the reliability of π-uniform complete hypergraphs πΎππ of orders 4, 5, 6, and 7.
When π approximates π, the terms in the recurrence forcalculating π (πΎππ, π) are finite inTheorem 3, so we can get theexpression of π (πΎππ, π) about π.The following Corollary 4 canbe yielded by setting π = π β 1, π β 2, and π β 3.Corollary4. Thereliability polynomials of the complete hyper-graph πΎππ with π = π β 1, π β 2, and π β 3 are given by thefollowing:
π (πΎπβ1π , π) = 1 β πππβ1 + (π β 1) ππ (π β₯ 3) ;π (πΎπβ2π , π) = 1 β ππ( πβ12 ) + (π2) π( π2 )β1
β (π β 12 ) π( π2 ) (π β₯ 4) ;π (πΎπβ3π , π) = 1 β ππ( πβ13 ) + (π2) π( π3 )βπ+2
β (π3) π( π3 )β1 + (π β 13 ) π( π3 )(π β₯ 5) .
(3)
3. Enumeration of Spanning Hypertrees inπ-Uniform Complete Hypergraphs
3.1. Standard Version from the Recurrence. In the following,we give the equivalent operation of the recurrence formula,then we can get some properties of the corresponding π-uniform complete hypergraph. For example, we investigatethe number of connected spanning subhypergraphs inducedby the operational edges of a π-uniform complete hypergraphwith random failure of edges. In particular, the number ofspanning trees of a complete hypergraph can be obtaineddirectly. In a similar way proposed by the reliability of graph,the all-terminal reliability of a hypergraph can be defined asan equivalent form, which is the homogeneous polynomial
![Page 4: A Recursive Formula for the Reliability of a -Uniform ...downloads.hindawi.com/journals/mpe/2018/3131087.pdfΒ Β· A Recursive Formula for the Reliability of a -Uniform Complete Hypergraph](https://reader033.fdocuments.net/reader033/viewer/2022053004/5f0880c47e708231d4225507/html5/thumbnails/4.jpg)
4 Mathematical Problems in Engineering
of 1 β π and π. For a π-uniform complete hypergraph, thisstandard form is as follows:
π (πΎππ, π) = ( ππ )βπ=0
π π (πΎππ) (1 β π)π π( ππ )βπ, (4)
where π π(πΎππ) denotes the number of connected spanningsubhypergraphs containing π edges in a π-uniform completehypergraph.
We now give an example of transformation of the reliabil-ity polynomial π (πΎ36 , π) as follows.Example 5.
π (πΎ36 , π) = 1 β 6π10 + 15π16 β 10π18= 20βπ=0(20π ) (1 β π)π π20βπ
β 6[ 10βπ=0(10π ) (1 β π)π π10βπ]π10
+ 15[ 4βπ=0(4π) (1 β π)π π4βπ] π16
β 10[ 2βπ=0(2π) (1 β π)π π2βπ] π18
= 480 (1 β π)3 π17 + 3600 (1 β π)4 π16+ 13992 (1 β π)5 π15 + 31200 (1 β π)6 π14+ 76800 (1 β π)7 π13+ 125700 (1 β π)8 π12+ 167900 (1 β π)9 π11+ 184750 (1 β π)10 π10+ 20βπ=11
(20π ) (1 β π)π π20βπ.
(5)
From these equations, we find that πΎ36 does not con-tain the connected subhypergraph with 2 edges. The num-ber of spanning hypertrees is 480, the number of con-nected spanning subhypergraphs with 4 edges is 3600, andso on.
3.2. The Number of Spanning Hypertrees in π-Uniform Com-plete Hypergraphs. According to the definition of the hyper-tree in this paper and the theory of network reliability,the spanning hypertree of π-uniform complete hypergraphmeans a connected spanning subhypergraph with the min-imum number of edges. The hypergraph π»1 = (π, π1) is oneexample, where π = {1, 2, 3, 4, 5}, π1 = {πΈ1 = {1, 2, 5}, πΈ2 ={3, 4, 5}}. And the hypergraph π»2 = (π, π2) is another
example, where π = {1, 2, 3, 4, 5}, π2 = {πΈ1 = {1, 4, 5}, πΈ2 ={2, 4, 5}, {3, 4, 5}}. Both π»1 and π»2 are spanning subhyper-graphs of πΎ35 , and they are all hypertrees. By Theorem 1, a3-uniform hypergraphs with 5 vertices have at least 2 edges.|π1| = 2, so π»1 is a spanning hypertree of πΎ35 ; |π2| = 3,so π»2 is not a spanning hypertree of πΎ35 ; it is a hypertreeand a spanning subhypergraph of πΎ35 . Clearly, π(πΎ35) = 15and the number of spanning subhypergraphs with hypertreestructure inπΎ35 is 25.Wefind that the spanning hypertree of π-uniform complete hypergraph is a hypertree and a spanningsubhypergraph, but the reverse is not true.
Combined with the above recurrence relation of the π-uniform complete hypergraph πΎππ (π β₯ 2, 2 β€ π β€ π β 1) andits equivalent standard conversion, we can get the number ofspanning trees inπΎππ.Lemma 6. The number of spanning hypertrees in πΎππ is givenby the following: π (πΎππ) = sβ(πβ1)/(πβ1)β (πΎππ) . (6)
Proof. Letπ» be a connected spanning subhypergraph of πΎππ.To make π» become a spanning hypertree of πΎππ, if the edgenumber of π» denotes π(ππ), for the Theorem 1, π(ππ) β₯(π β 1)/(π β 1)must be first condition.
Case 1. If (πβ1)/(πβ1) is an integer, thenπ(ππ) = (πβ1)/(πβ1).Case 2. If πβ1 = π(πβ1)+ π‘, where π is a nonnegative integerand π‘ = 1, 2, β β β , π β 2,thenπ(ππ) = π + 1.
Based on Cases 1 and 2, the conclusions we need to provehave been established.
Table 2 shows the number of spanning trees of π-uniform complete hypergraphs πΎππ of orders 4, 5, 6, 7, and8.
According to the definition of the spanning hypertreeabove and standard expression of reliability in π-uniformcomplete hypergraphs, the result of Lemma 6 is intuitive andtrue for all hypergraphs. However, it is difficult to solve allthe counting problems of the spanning hypertrees in generalhypergraphs, it needs to be furtherly explored in the futureresearch.
About enumeration of spanning hypertrees in πΎππ, forsome special cases, we get some results as follows.
Theorem7. If 1 β€ π β€ βπ/2β andπΎππ (π = πβπ) is a π-uniformcomplete hypergraph with order π, then
(a) π (πΎππ) = ((ππ)2 ) β((π β 1π β 1)2 )β πβ1βπ=1
(π β 1π ) π (πΎπβππβπ ) ;(b) π (πΎππ) = 12 ( π2π)(2ππ ) .
(7)
![Page 5: A Recursive Formula for the Reliability of a -Uniform ...downloads.hindawi.com/journals/mpe/2018/3131087.pdfΒ Β· A Recursive Formula for the Reliability of a -Uniform Complete Hypergraph](https://reader033.fdocuments.net/reader033/viewer/2022053004/5f0880c47e708231d4225507/html5/thumbnails/5.jpg)
Mathematical Problems in Engineering 5
Table 2: The number of spanning trees for small hypergraphs.
r n4 5 6 7 8
3 6 15 480 735 1178104 10 45 70 145605 15 105 2806 21 2107 28
Proof. Let πΎππ (π = π β π, 1 β€ π β€ βπ/2β) be a π-uni-form complete hypergraph with order π. By Lemma 6, wehave π(πΎπβππ ) = s2(πΎπβππ )(1 β€ π β€ βπ/2β). And by thestandard expression of the recursive formula of π (πΎπβππ ) inTheorem 3, we can deduce s2(πΎπβππ ) = ( ( ππ )2 ) β ( ( πβ1πβ1 )2 ) ββπβ1π=1 ( πβ1π ) π(πΎπβππβπ ), so the first equality in the equation holds.
On the other hand, the edge number of spanning hyper-trees in πΎπβππ s is exactly equal to 2, from the perspective ofcombinatorics; the number of the spanning hypertrees π(πΎππ)inπΎπβππ s is (1/2) ( π2π ) ( 2ππ ).
So far, we have completed the proof of Theorem 7.
Remark 8. By Theorem 7 and let π(πΎπβππβπ ) =(1/2) ( πβπ2πβ2π ) ( 2πβ2ππβπ ), we have the equation as follows:
((ππ)2 ) β((π β 1π β 1)2 )β 12 πβ1βπ=1(π β 1π )( π β π2π β 2π)(2π β 2ππ β π )
= 12 ( π2π)(2ππ ) .(8)
As a corollary toTheorem 7, we obtain the result that thenumber of spanning hypertrees in special cases of π-uniformcomplete hypergraphs.
Corollary 9. Let πΎππ be a π-uniform complete hypergraphs oforder π, when π = π β 1, π β 2, π β 3
π (πΎπβ1π ) = (π2) (π β₯ 3) ;π (πΎπβ2π ) = 3(π4) (π β₯ 5) ;π (πΎπβ3π ) = 10(π6) (π β₯ 7) .
(9)
Proof. The transformation of the recurrence in Theorem 3is the homogeneous polynomial β( ππ )π=0 π π(πΎππ)(1 β π)ππ( ππ )βπ.According to the definition of the spanning hypertree of a π-uniform complete hypergraph, we achieve some interestingconclusions as follows:
π (πΎπβ1π ) = π 2 (πΎπβ1π ) = (π2) (π β₯ 3) ;π (πΎπβ2π ) = π 2 (πΎπβ2π )
= ((π2)2 ) β (π β 12 ) β (π β 1) (π β 12 )= 3(π4) (π β₯ 5) ;
π (πΎπβ3π ) = π 2 (πΎπβ3π )= ((π3)2 ) β((π β 12 )2 )β (π β 12 )(π β 22 ) β (π β 1) π (πΎπβ3πβ1)
= 10(π6) (π β₯ 7) .
(10)
In a similar fashion as stated in Theorem 7, we can provethe following statement for π(πΎπ2π).Theorem 10. Let πΎπ2π be a π-uniform complete hypergraphwith order 2π, then
π (πΎπ2π) = ((2ππ )3 ) β((2π β 1π )3 )β πβ1βπ=1
( 2π β 1π β 1 + π) π3 (πΎππ+π) .(11)
![Page 6: A Recursive Formula for the Reliability of a -Uniform ...downloads.hindawi.com/journals/mpe/2018/3131087.pdfΒ Β· A Recursive Formula for the Reliability of a -Uniform Complete Hypergraph](https://reader033.fdocuments.net/reader033/viewer/2022053004/5f0880c47e708231d4225507/html5/thumbnails/6.jpg)
6 Mathematical Problems in Engineering
Remark 11. Because π 2(πΎπ2π) = 0, so we can get
((2ππ )2 ) β((2π β 1π )2 )= (2π β 1π ) + 12 πβ1βπ=1( 2π β 1π + π β 1)(π + π2π )(2ππ ) .
(12)
4. Conclusions and Open Problems
In this paper, a recursive algorithm is proposed for calculatingthe all-terminal reliability of a π-uniform complete hyper-graph. Because the 2-uniform hypergraph is a graph, andthe computation of the all-terminal reliability of network isan NP-hard problem [31], we know that the computation ofreliability of hypernetwork is also NP-hard problem indi-rectly. The symmetry of the πΎπ leads to the fact that all-terminal reliability π (πΎπ, π) can be calculated in quadratictime using Theorem 2. We also use the symmetry of the πΎππ,so π (πΎππ, π) can be calculated in timeπ(π2) usingTheorem 3.The algorithm presented here is a major improvement overcomplete state enumeration of common approaches.
There still exist some interesting openquestions for futureresearch in this field:
(i) How can we get a recurrence relation for the πΎ-Terminal reliability polynomial of a π-uniform com-plete hypergraph?
(ii) How can we calculate 2-edge-connected (or higher)reliability of π-uniform complete hypergraph?
(iii) How can we calculate more about the result of thenumber of spanning hypertrees in π-uniform com-plete hypergraph?
For a π-uniform complete hypergraph πΎππ, when π isa constant, it is very challenging to get the expression ofπ(πΎππ) which is just about π and π [28]. According to therecursive relations of reliability of πΎππ proposed in this paperand combinatorics, new progress is expected to be made insolving such problems.
(iv) How can we attack the problem for general hyper-graphs?
Data Availability
No data were used to support this study.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
Acknowledgments
This work is supported by NSFC (Grants nos. 11661069,61663041, and 61763041), the Science Found of QinghaiProvince (Grants nos. 2015-ZJ-723 and 2018-ZJ-718), and the
Fundamental Research Funds for the Central Universities(Grant no. 2017TS045).
References
[1] E. Estrada and J. A. RodrΔ±guez-Velazquez, βSubgraph centralityand clustering in complex hyper-networks,β Physica A: Statisti-cal Mechanics and its Applications, vol. 364, pp. 581β594, 2006.
[2] J. Johnson, βHypernetworks for reconstructing the dynamics ofmultilever systems. to be presented at the European Conferenceon Complex Systerns,β Said Business School, University ofOxford, pp. 25β29, 2006.
[3] J.-L. Guo and Q. Suo, βBrand effect versus competitiveness inhypernetworks,β Chaos: An Interdisciplinary Journal of Nonlin-ear Science, vol. 25, no. 2, 023102, 6 pages, 2015.
[4] X. Ma, F. Ma, J. Yin, and H. Zhao, βCascading failures of kuniform hyper-network based on the hyper adjacent matrix,βPhysica A: Statistical Mechanics and its Applications, vol. 510, pp.281β289, 2018.
[5] C. Berge, Hypergraphs: The Theory of Finite Sets, ElsevierScience, Amsterdam, The Netherlands, 1989.
[6] A. Bretto, βHypergraph Colorings,β in Hypergraph Theory,Mathematical Engineering, pp. 43β56, Springer InternationalPublishing, Heidelberg, 2013.
[7] P. Dankelmann and D. Meierling, βMaximally edge-connectedhypergraphs,β Discrete Mathematics, vol. 339, no. 1, pp. 33β38,2016.
[8] S. Zhao and J. Meng, βSufficient conditions for hypergraphsto be maximally edge-connected,β Applied Mathematics andComputation, vol. 333, pp. 362β368, 2018.
[9] X. Gu and H.-J. Lai, βRealizing degree sequences with k-edge-connected uniform hypergraphs,β Discrete Mathematics, vol.313, no. 12, pp. 1394β1400, 2013.
[10] D. de Caen, βAn upper bound on the sum of squares of degreesin a graph,β Discrete Mathematics, vol. 185, no. 1-3, pp. 245β248,1998.
[11] C. Bey, βAn upper bound on the sum of squares of degrees ina hypergraph,β Discrete Mathematics, vol. 269, no. 1-3, pp. 259β263, 2003.
[12] H. Zhang, L. Song, Z. Han, and Y. Zhang, Hypergraph theoryin wireless communication networks, SpringerBriefs in Electricaland Computer Engineering, Springer, Cham, 2018.
[13] F. T. Boesch, βSynthesis of Reliable NetworksβA Survey,β IEEETransactions on Reliability, vol. 35, no. 3, pp. 240β246, 1986.
[14] F. T. Boesch, A. Satyanarayana, and C. L. Suffel, βA surveyof some network reliability analysis and synthesis results,βNetworks. An International Journal, vol. 54, no. 2, pp. 99β107,2009.
[15] D. Bienstock, βAn algorithm for reliability analysis of planargraphs,β Networks. An International Journal, vol. 16, no. 4, pp.411β422, 1986.
[16] Q. Li and Q. Li, βReliability analysis of circulant graphs,βNetworks, vol. 31, no. 2, pp. 61β65, 1998.
[17] R. Criado, M. Romance, and M. Vela-Perez, βHyperstructures,a new approach to complex systems,β International Journal ofBifurcation and Chaos, vol. 20, no. 3, pp. 877β883, 2010.
[18] J.-W.Wang, L.-L. Rong, Q.-H. Deng, and J.-Y. Zhang, βEvolvinghypernetwork model,βThe European Physical Journal B, vol. 77,no. 4, pp. 493β498, 2010.
![Page 7: A Recursive Formula for the Reliability of a -Uniform ...downloads.hindawi.com/journals/mpe/2018/3131087.pdfΒ Β· A Recursive Formula for the Reliability of a -Uniform Complete Hypergraph](https://reader033.fdocuments.net/reader033/viewer/2022053004/5f0880c47e708231d4225507/html5/thumbnails/7.jpg)
Mathematical Problems in Engineering 7
[19] Z. Zhang andC. Liu, βA hypergraphmodel of social tagging net-works,β Journal of Statistical Mechanics:Theory and Experiment,vol. 2010, no. 10, p. P10005, 2010.
[20] F. Hu, H. Zhao, and X. Ma, βAn evolving hypernetworkmodel and its properties,β Scientia Sinica Physica, Mechanica &Astronomica, vol. 43, no. 1, p. 16, 2013.
[21] V. Zlatic, G. Ghoshal, and G. Caldarelli, βHypergraph topolog-ical quantities for tagged social networks,β Physical Review E:Statistical, Nonlinear, and Soft Matter Physics, vol. 80, no. 3,2009.
[22] K. Kapoor, D. Sharma, and J. Srivastava, βWeightednode degreecentrality for hypergraphs,β in Proceedings of the 2013 IEEE 2ndInternational Network Science Workshop, NSW 2013, pp. 152β155, USA, May 2013.
[23] A. Gyarfas, J. Lehel, G. N. Sarkozy, and R. H. Schelp, βMono-chromatic Hamiltonian Berge-cycles in colored complete uni-form hypergraphs,β Journal of Combinatorial Theory, Series B,vol. 98, no. 2, pp. 342β358, 2008.
[24] A. Szymanski and A. P. Wojda, βCyclic partitions of completeuniform hypergraphs,β Electronic Journal of Combinatorics, vol.17, no. 1, pp. 265β288, 2010.
[25] Z. Lonc, βPacking, covering and decomposing of a completeuniform hypergraph into delta-systems,β Graphs and Combina-torics, vol. 8, no. 4, pp. 333β341, 1992.
[26] E. N. Gilbert, βRandom graphs,β Annals of Mathematical Statis-tics, vol. 30, no. 4, pp. 1141β1144, 1959.
[27] J. Nieminen and M. Peltola, βHypertrees,βApplied MathematicsLetters, vol. 12, no. 2, pp. 35β38, 1999.
[28] A. Goodall and A. de Mier, βSpanning trees of 3-uniformhypergraphs,β Advances in Applied Mathematics, vol. 47, no. 4,pp. 840β868, 2011.
[29] G. Y. Katona and P. G. Szabo, βBounds on the number of edgesin hypertrees,β Discrete Mathematics, vol. 339, no. 7, pp. 1884β1891, 2016.
[30] T.Atajan andH. Inaba, βNetwork reliability analysis by countingthe number of spanning trees,β in Proceedings of the IEEEInternational Symposium onCommunications Information Tech-nology, vol. 1, pp. 601β604, 2004.
[31] M. O. Ball, βComputational complexity of network reliabilityanalysis: an overview,β IEEE Transactions on Reliability, vol. 35,no. 3, pp. 230β239, 1986.
![Page 8: A Recursive Formula for the Reliability of a -Uniform ...downloads.hindawi.com/journals/mpe/2018/3131087.pdfΒ Β· A Recursive Formula for the Reliability of a -Uniform Complete Hypergraph](https://reader033.fdocuments.net/reader033/viewer/2022053004/5f0880c47e708231d4225507/html5/thumbnails/8.jpg)
Hindawiwww.hindawi.com Volume 2018
MathematicsJournal of
Hindawiwww.hindawi.com Volume 2018
Mathematical Problems in Engineering
Applied MathematicsJournal of
Hindawiwww.hindawi.com Volume 2018
Probability and StatisticsHindawiwww.hindawi.com Volume 2018
Journal of
Hindawiwww.hindawi.com Volume 2018
Mathematical PhysicsAdvances in
Complex AnalysisJournal of
Hindawiwww.hindawi.com Volume 2018
OptimizationJournal of
Hindawiwww.hindawi.com Volume 2018
Hindawiwww.hindawi.com Volume 2018
Engineering Mathematics
International Journal of
Hindawiwww.hindawi.com Volume 2018
Operations ResearchAdvances in
Journal of
Hindawiwww.hindawi.com Volume 2018
Function SpacesAbstract and Applied AnalysisHindawiwww.hindawi.com Volume 2018
International Journal of Mathematics and Mathematical Sciences
Hindawiwww.hindawi.com Volume 2018
Hindawi Publishing Corporation http://www.hindawi.com Volume 2013Hindawiwww.hindawi.com
The Scientific World Journal
Volume 2018
Hindawiwww.hindawi.com Volume 2018Volume 2018
Numerical AnalysisNumerical AnalysisNumerical AnalysisNumerical AnalysisNumerical AnalysisNumerical AnalysisNumerical AnalysisNumerical AnalysisNumerical AnalysisNumerical AnalysisNumerical AnalysisNumerical AnalysisAdvances inAdvances in Discrete Dynamics in
Nature and SocietyHindawiwww.hindawi.com Volume 2018
Hindawiwww.hindawi.com
DiοΏ½erential EquationsInternational Journal of
Volume 2018
Hindawiwww.hindawi.com Volume 2018
Decision SciencesAdvances in
Hindawiwww.hindawi.com Volume 2018
AnalysisInternational Journal of
Hindawiwww.hindawi.com Volume 2018
Stochastic AnalysisInternational Journal of
Submit your manuscripts atwww.hindawi.com