All-terminal hypernetwork reliability synthesis of a kind of semi-deterministic hypergraphs

Ke Zhang, Haixing Zhao, Zhonglin Ye (), Wenjun Hu and Minmin Miao
Additional contact information
Ke Zhang: School of Information Engineering, Huzhou University, Huzhou 313000, Zhejiang, P. R. China†Zhejiang Province Key Laboratory of Smart Management & Application of Modern Agricultural Resources, Huzhou University, Huzhou 313000, Zhejiang, P. R. China
Haixing Zhao: ��School of Computer, Qinghai Normal University, Xining 810800, P. R. China
Zhonglin Ye: ��School of Computer, Qinghai Normal University, Xining 810800, P. R. China
Wenjun Hu: School of Information Engineering, Huzhou University, Huzhou 313000, Zhejiang, P. R. China†Zhejiang Province Key Laboratory of Smart Management & Application of Modern Agricultural Resources, Huzhou University, Huzhou 313000, Zhejiang, P. R. China
Minmin Miao: School of Information Engineering, Huzhou University, Huzhou 313000, Zhejiang, P. R. China†Zhejiang Province Key Laboratory of Smart Management & Application of Modern Agricultural Resources, Huzhou University, Huzhou 313000, Zhejiang, P. R. China

International Journal of Modern Physics C (IJMPC), 2021, vol. 32, issue 11, 1-13

Abstract: Network reliability plays an important role in analysis, synthesis and detection of real-world networks. In this paper, we first propose the concept of hypernetwork reliability, which generalizes the concept of network reliability. The model for hypernetwork reliability studies consists of a hypergraph with perfect reliable vertices and equal and independent hyperedge failure probability 1−p. The measure of reliability is defined as the probability that a hypergraph is connected. Let H be an r-uniform hypergraph with the number of vertices n and the number of hyperedges m, where every hyperedge connects r vertices. We confirm the possibility of the existence of a fixed hypergraph that is optimal or least for all hyperedges same survival possible p. It is simple to verify that such hypergraph exists if m=[n−1r−1]. For a kind of 2-regular 3-uniform hypergraphs, we calculate the upper and lower bounds on the all-terminal reliability, and describe the class of hypergraphs that reach the boundary.

Keywords: All-terminal reliability; synthesis; r-uniform hypergraphs; spanning subhypergraph; boundary (search for similar items in EconPapers)
Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183121501539
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:32:y:2021:i:11:n:s0129183121501539

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183121501539

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().