Premium
On reliability in stochastic graphs
Author(s) -
Frank Ove,
Gaul Wolfgang
Publication year - 1982
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230120204
Subject(s) - social connectedness , reliability (semiconductor) , node (physics) , enhanced data rates for gsm evolution , mathematics , computer science , graph , discrete mathematics , combinatorics , mathematical optimization , artificial intelligence , psychology , power (physics) , structural engineering , quantum mechanics , engineering , psychotherapist , physics
A complete graph has randomly failing nodes and edges. All failures are independent, and there is a common node reliability and a common edge reliability. Generalizing an approach developed by Gilbert for reliable nodes and unreliable edges, we find formulas for various kinds of connectedness probabilities. Bounds and approximations to the probabilities are given.