Computational commutative algebra for tight network reliability bounds

  1. Sáenz-De-Cabezón, E. 2
  2. Wynn, H.P. 1
  1. 1 London School of Economics and Political Science
    info

    London School of Economics and Political Science

    Londres, Reino Unido

    ROR https://ror.org/0090zs177

  2. 2 Universidad de La Rioja
    info

    Universidad de La Rioja

    Logroño, España

    ROR https://ror.org/0553yr311

Libro:
Safety, reliability and risk analysis: beyond the Horizon

Editorial: CRC Press

ISBN: 978-1-138-00123-7

Año de publicación: 2014

Páginas: 1271

Tipo: Capítulo de Libro

beta Ver similares en nube de resultados

Resumen

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. © 2014 Taylor & Francis Group, London..