Roots of two‐terminal reliability polynomials
From MaRDI portal
Publication:6087151
DOI10.1002/NET.22004zbMATH Open1528.05070arXiv2006.09908OpenAlexW3098853299MaRDI QIDQ6087151FDOQ6087151
Authors: Jason I. Brown
Publication date: 11 December 2023
Published in: Networks (Search for Journal in Brave)
Abstract: Assume that the vertices of a graph are always operational, but the edges of are operational independently with probability . For fixed vertices and , the emph{two-terminal reliability} of is the probability that the operational subgraph contains an -path, while the emph{all-terminal reliability} of is the probability that the operational subgraph contains a spanning tree. Both reliabilities are polynomials in , 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
Graph polynomials (05C31) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cites Work
- Title not available (Why is that?)
- Roots of the Reliability Polynomials
- On the log concavity of reliability and matroidal sequences
- The Brown-Colbourn conjecture on zeros of reliability polynomials is false
- Zeros of Reliability Polynomials and f-vectors of Matroids
- The independence fractal of a graph.
- On the roots of all-terminal reliability polynomials
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)