.png){kind=icon}
返回
Universal Reliability Bounds for Sparse Networks
.png){kind=icon}
OA
AI
DOI：10.1109/TR.2021.3061075.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Consider a graph with perfect nodes and edges subject to independent random failures with identical probability. The all-terminal reliability is the probability that the resulting subgraph is connected. First, we fully characterize uniformly least reliable graphs (ULRG) whose co-rank is not greater than four. Universal reliability bounds are here introduced for those graphs. It is formally proved that ULRG is invariant under bridge-contractions, and maximize the number of bridges among all connected simple graphs with a prescribed number of nodes and edges. A closed-form for the maximum number of bridges is also given, which has an intrinsic interest from a graph-theoretic point of view. Finally, the cost-reliability tradeoff is discussed, comparing the number of edges required to reduce the reliability gaps between the least and most reliable graphs. A remarkable conclusion is that the network design is critical under rare event failures, where the reliability-gap between least and most-reliable networks is monotonically increasing with the number of terminals.
Keyword:
Reliability
Reliability theory
Bridges
Reliability engineering
Graph theory
Tools
Terminology
All-terminal reliability (ATR)
reliability bounds
uniformly least reliable graphs (ULRG)
uniformly most reliable graphs (UMRG)
期刊
IF:
5.7
论文数:
2.8K
被引数:
8.5K
机构
引用论文
A Technology Roadmap on SOA for smart embedded devices: Towards intelligent systems in manufacturing
PREAI
分享收藏From service to science: NIH shifts focus of mentoring network aimed at boosting grantee diversity.png)
Science
ScienceIF0
PREAI
分享收藏Distributed teleoperation and collaborative environment for robotics E-learning and cooperation
PREAI
分享收藏Darting across space and time: Parametric modulators of sex-biased conditioned fear responsesOAAI
IF0
OAAI分享收藏
查看更多内容