Abstract
This paper introduces mincut ideals of two-terminal networks, which arise in the algebraic analysis of system reliability. We give the definitions and study their algebraic and combinatorial properties in some particular cases. It turns out that some features of the mincut ideals arising from networks such as the Cohen-Macaulay property and the computation of Betti numbers, which are important in tight reliability bounds, have a compact expression for series-parallel networks. This relies on a natural mapping of the structure of such networks into the union and intersection structure of the corresponding ideal.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aggarwal K.K., Gupta J.S., Misra K.B.: A new method for system reliability evaluation. Microelectron. Reliab. 12, 435–440 (1973)
Brandstädt A., Le V.B., Spinard J.P.: Graph Classes. A Survey. SIAM, PA (1999)
Colbourn C.J.: The Combinatorics of Network Reliability. Oxford University Press, Oxford (1987)
Colbourn C.J.: Combinatorial aspects of network reliability. Ann. Oper. Res. 33, 3–15 (1991)
Dohmen K.: Improved Bonferroni Inequalities via Abstract Tubes. Springer, New York (2003)
Dupont L., Reyes E., Villarreal R.: Cohen-Macaulay clutters with combinatorial optimization properties and parallelizations of normal edge ideals. Sao Paulo J. Math. Sci. 3(1), 61–76 (2009)
Faridi S.: Cohen-Macaulay properties of squarefree monomial ideals. J. Comb. Theory A 109, 299–329 (2005)
Giglio B., Wynn H.P.: Monomial idelas and the Scarf complex for coherent systems in reliability theory. Ann. Stat. 32, 1289–1311 (2004)
Gouviea, J., Laurent, M., Parrilo, P., Thomas, R.: A new semidefinite programming hierarchy for cycles in binary matroids and cuts in graphs. http://arxiv.org/abs/0907.4518
Harms D.D., Kraetzl M., Colbourn C.J., Devitt J.S.: Network Reliability Experiments with a Symbolic Algebra Environment. CRC Press, Baco Raton (1995)
Kuo W., Zuo M.: Optimal Reliability Modelling. Wiley, New York (2003)
Locks M.O.: A minimizing algorithm for sum of disjoint products. IEEE Trans. Reliab. 36, 445–453 (1987)
Miller E., Sturmfels B.: Combinatorial Commutative Algebra. Springer, New York (2004)
Nagel U., Petrovic S.: Properties of cut ideals associated to ring graphs. J. Commut. Algebra 1(3), 547–565 (2009)
Naiman D.Q., Wynn H.P.: Abstract tubes, improved inclusion-exclusion identities and inequalities and importance sampling. Ann. Stat. 25, 1954–1983 (1997)
Sáenz-de-Cabezón E.: Multigraded Betti numbers without computing minimal free resolutions. Appl. Algebra Eng. Commun. Comput. 20, 481–495 (2009)
Sáenz-de-Cabezón E.: Computing the support of monomial iterated mapping cones. J. Symb. Comput. 45, 953–964 (2010)
Sáenz-de-Cabezón E., Wynn H.P.: Betti numbers and minimal free resolutions for multi-state system reliability bounds. J. Symb. Comput. 44, 1311–1325 (2009)
Sáenz-de-Cabezón, E., Wynn, H.P.: Computational algebraic algorithms for the reliability of generalized k-out-of-n and related systems. Math. Comput. Simul. (2010) (to appear)
Stanley R.P.: Combinatorics and Commutative Algebra, volume 41 of Progress in Mathematics. 2nd edn. Birkhäuser, Boston (1996)
Villarreal R.: Monomial Algebras, volume 238 of Pure and Applied Mathematics. Marcel Dekker Inc., New York (2001)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sáenz-de-Cabezón, E., Wynn, H.P. Mincut ideals of two-terminal networks. AAECC 21, 443–457 (2010). https://doi.org/10.1007/s00200-010-0132-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-010-0132-2