Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T17:22:50.221Z Has data issue: false hasContentIssue false

The number of critical connection vectors of L-superadditive structure functions

Published online by Cambridge University Press:  01 July 2016

Emad El-Neweihi*
Affiliation:
University of Illinois at Chicago
Fan C. Meng*
Affiliation:
University of Illinois at Chicago
*
Postal address for both authors: Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago, Chicago, IL 60680, USA.
Postal address for both authors: Department of Mathematics, Statistics and Computer Science, University of Illinois at Chicago, Chicago, IL 60680, USA.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A conjecture due to Block et al. (1989), concerning the number of critical connection vectors to the various performance levels of a discrete L-superadditive structure function, is proved. When the components of the discrete L-superadditive structure function are further assumed to satisfy a certain relevance condition due to Griffith (1980), it is shown that there is exactly one critical connection vector to each performance level.

Information

Type
Letters to the Editor
Copyright
Copyright © Applied Probability Trust 1989