On a class of reliable networks

A communication network N in which links are subject to failures is typically modeled by a probabilistic graph G in which each edge exists independently with a fixed probability p, 0>