Universal Reliability Bounds for Sparse Networks

Consider a graph with perfect nodes and edges subject to independent random failures with identical probability.The all-terminal reliability (ATR) is the probability that the resulting subgraph is connected. First, we fully characterize uniformly least reliable graphs (ULRG) whose co-rank is not gre...

Full description

Bibliographic Details

Main Author:	Romero, Pablo (author)
Format:	article
Language:	English
Published:	2021
Subjects:	All-Terminal Reliability Reliability Bounds Uniformly Most Reliable Graphs Uniformly Least Reliable Graphs Ciencias Naturales y Exactas Matemáticas Matemática Aplicada
Online Access:	https://hdl.handle.net/20.500.12381/648
Tags:	Add Tag No Tags, Be the first to tag this record!