Library Header Image
LSE Research Online LSE Library Services

Computational commutative algebra for tight network reliability bounds

Saenz-de-Cabezon, E. and Wynn, Henry P. ORCID: 0000-0002-6448-1080 (2013) Computational commutative algebra for tight network reliability bounds. In: Steenbergen, R.D.J.M., Van Gelder, P.H.J.M., Miraglia, S. and Vrouwenvelder, A.C.W.M., (eds.) Safety, reliability and risk analysis: beyond the horizon. CRC Press, Boca Raton, USA, pp. 1271-1277. ISBN 9781138001237

Full text not available from this repository.


Multi-state coherent systems, such as networks, share properties with mononomial ideals which are a cornerstone of modern computational algebra. By exploiting this connection it is possible to obtain tight upper and lower bounds on network reliability which can be shown to dominate traditional Bonferroni bounds, at every truncation level. The key object in the algebra is the multigraded Hilbert series which can be constructed from multigraded Betti numbers. For networks, many of the metrics for reliability and robustness can be expressed via the Hilbert series. One advantage of the purely algebraic methods is that they are distribution-free. On the other hand they can be combined with distributional assumptions such as those from Bayesian graphical models.

Item Type: Book Section
Official URL:
Additional Information: © 2014 Taylor & Francis Group, London.
Divisions: LSE
Subjects: H Social Sciences > HA Statistics
Date Deposited: 03 Jun 2014 14:45
Last Modified: 27 Oct 2021 23:03

Actions (login required)

View Item View Item