Roots of two‐terminal reliability polynomials

From MaRDI portal
Publication:6087151

DOI10.1002/NET.22004zbMATH Open1528.05070arXiv2006.09908OpenAlexW3098853299MaRDI QIDQ6087151FDOQ6087151


Authors: Jason I. Brown Edit this on Wikidata


Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Abstract: Assume that the vertices of a graph G are always operational, but the edges of G are operational independently with probability pin[0,1]. For fixed vertices s and t, the emph{two-terminal reliability} of G is the probability that the operational subgraph contains an (s,t)-path, while the emph{all-terminal reliability} of G is the probability that the operational subgraph contains a spanning tree. Both reliabilities are polynomials in p, and have very similar behaviour in many respects. However, unlike all-terminal reliability, little is known about the roots of two-reliability polynomials. In a variety of ways, we shall show that the nature and location of the roots of two-terminal reliability polynomials have significantly different properties than those held by roots of the all-terminal reliability.


Full work available at URL: https://arxiv.org/abs/2006.09908




Recommendations




Cites Work


Cited In (1)





This page was built for publication: Roots of two‐terminal reliability polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087151)