Premium
Directed network reliability: Domination and computing coefficients of the success‐marginal expansion
Author(s) -
Hagstrom Jane Nichols
Publication year - 1990
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.3230200107
Subject(s) - reliability (semiconductor) , multinomial distribution , expression (computer science) , set (abstract data type) , class (philosophy) , mathematical optimization , order (exchange) , computer science , mathematics , marginal distribution , event (particle physics) , marginal cost , combinatorics , random variable , statistics , power (physics) , artificial intelligence , economics , physics , finance , quantum mechanics , programming language , microeconomics
Abstract The reliability for communication in a directed network can be expressed as a summation of terms, each of which involves a success‐marginal probability, that is, the probability of an event of the form {the arcs in set S are working}. Satyanarayana and Prabhakar introduced the concept of domination in order to characterize the coefficients of one such expression. This paper observes that domination can be interpreted as a partial derivative of the reliability multinomial and extends results derived for domination to the general class of expressions involving success‐marginal probabilities.