Abstract
Associated to every coherent system there is a canonical ideal whose Hilbert series encodes the reliability of the system. We study various ideals arising in the theory of system reliability. Using ideas from the theory of orientations, and matroids on graphs we associate a polyhedral complex to our system so that the non-cancelling terms in the reliability formula can be read from the labeled faces of this complex. Algebraically, this polyhedron resolves the minimal free resolution of these ideals. In each case, we give an explicit combinatorial description of non-cancelling terms in terms of acyclic orientations of graph and the number of regions in the graphic hyperplane arrangement. This resolves open questions posed by Giglio-Wynn and develops new connections between the theory of oriented matroid, the theory of divisors on graphs, and the theory of system reliability.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Agrawal, A., Barlow, R.E.: A survey of network reliability and domination theory. Oper. Res. 32(3), 478–492 (1984)
Bayer, D., Sturmfels, B.: Cellular resolutions of monomial modules. J. Reine Angew. Math. 502, 123–140 (1998)
Dohmen, K.: Improved Bonferroni Inequalities via Abstract Tubes: Inequalities and Identities of Inclusion-Exclusion Type. Lecture Notes in Mathematics, vol. 1826. Springer, Berlin (2003)
Edelsbrunner, H., Harer, J.: Computational topology: an introduction. Am. Math. Soc. (2010)
Giglio, B., Wynn, H.P.: Monomial ideals and the Scarf complex for coherent systems in reliability theory. Ann. Statist. 32, 1289–1311 (2004)
Greene, C., Zaslavsky, T.: On the interpretation of Whitney numbers through arrangements of hyperplanes, zonotopes, non-Radon partitions, and orientations of graphs. Trans. Amer. Math. Soc. 280(1), 97–126 (1983)
Johnson Jr., A.M., Malek, M.: Survey of software tools for evaluating reliability, availability, and serviceability. ACM Comput. Surv. (CSUR) 20(4), 227–269 (1988)
Miller, E., Sturmfels, B.: Combinatorial Commutative Algebra. Graduate Texts in Mathematics, vol. 227. Springer-Verlag, New York (2005)
Mohammadi, F., Shokrieh, F.: Divisors on graphs, binomial and monomial ideals, and cellular resolutions. Mathematische Zeitschrift, pp. 1–44 (2015)
Mohammadi, F., Sáenz-de Cabezón, E., Wynn, H.P.: Persistent homology based on lcm-filtration for monomial ideals. in preparation
Mohammadi, F., Sáenz-de Cabezón, E., Wynn, H.P.: Types of signature analysis in reliability based on Hilbert series. arXiv preprint 2015. arXiv:1510.04427
Novik, I., Postnikov, A., Sturmfels, B.: Syzygies of oriented matroids. Duke Math. J. 111(2), 287–317 (2002)
Naiman, D.Q., Wynn, H.P.: Inclusion-exclusion-Bonferroni identities and inequalities for discrete tube-like problems via Euler characteristics. Ann. Statist. 20, 43–76 (1992)
Weinberger, S.: What is. persistent homology? Not. AMS 58(1), 36–39 (2011)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Mohammadi, F. (2016). Combinatorial and Geometric View of the System Reliability Theory. In: Greuel, GM., Koch, T., Paule, P., Sommese, A. (eds) Mathematical Software – ICMS 2016. ICMS 2016. Lecture Notes in Computer Science(), vol 9725. Springer, Cham. https://doi.org/10.1007/978-3-319-42432-3_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-42432-3_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42431-6
Online ISBN: 978-3-319-42432-3
eBook Packages: Computer ScienceComputer Science (R0)