On the reliability roots of simplicial complexes and matroids

Assume that the vertices of a graph $G$ are always operational, but the edges of $G$ fail independently with probability $q \in[0,1]$. The \emph{all-terminal reliability} of $G$ is the probability that the resulting subgraph is connected. The all-terminal reliability can be formulated into a polynomial in $q$, and it was conjectured \cite{BC1} that all the roots of (nonzero) reliability polynomials fall inside the closed unit disk. It has since been shown that there exist some connected graphs which have their reliability roots outside the closed unit disk, but these examples seem to be few and far between, and the roots are only barely outside the disk. In this paper we generalize the notion of reliability to simplicial complexes and matroids and investigate when, for small simplicial complexes and matroids, the roots fall inside the closed unit disk.

[1]  Takayuki Hibi,et al.  What can be said about pure O-sequences? , 1989, J. Comb. Theory, Ser. A.

[2]  Clyde F. Martin,et al.  The roots of a polynomial vary continuously as a function of the coefficients , 1987 .

[3]  David G. Wagner.  Zeros Of Reliability Polynomials And F-Vectors Of Matroids , 2000, Comb. Probab. Comput..

[4]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[5]  Anders Björner,et al.  Matroid Applications: Homology and Shellability of Matroids and Geometric Lattices , 1992 .

[6]  Alan D. Sokal.  Chromatic polynomials, Potts models and all that , 2000 .

[7]  R. Stanley.  Combinatorics and commutative algebra , 1983 .

[8]  Norman Biggs.  Algebraic Graph Theory: Index , 1974 .

[9]  A. Stechow,et al.  Decomposition , 1902, The Indian medical gazette.

[10]  Gordon F. Royle,et al.  The Brown-Colbourn conjecture on zeros of reliability polynomials is false , 2004, J. Comb. Theory, Ser. B.

[11]  A. Štikonas.  The root condition for polynomial of the second order and a spectral stability of finite‐difference schemes for Kuramoto‐Tsuzuki equation , 1998 .

[12]  G. Pólya,et al.  Problems and theorems in analysis , 1983 .

[13]  Fabrizio Zanello,et al.  Pure O-Sequences and Matroid h-Vectors , 2010, 1006.0325.

[14]  An Extension of the Eneström-Kakeya Theorem and Its Sharpness , 1981 .

[15]  Charles J. Colbourn,et al.  The Combinatorics of Network Reliability , 1987 .

[16]  Criel Merino,et al.  On the structure of the h-vector of a paving matroid , 2010, Eur. J. Comb..

[17]  Charles J. Colbourn,et al.  A Set System Polynomial with Colouring and Reliability Applications , 1988, SIAM J. Discret. Math..

[18]  John Scott Provan.  Decompositions, shellings, and diameters of simplical complexes and convex polyhedra. , 1977 .

[19]  R. Farebrother.  Simplified Samuelson Conditions for Cubic and Quartic Equations , 1973 .

[20]  Jason Brown,et al.  On the roots of all-terminal reliability polynomials , 2017, Discret. Math..

[21]  Aaron D. Wyner,et al.  Reliable Circuits Using Less Reliable Relays , 1993 .

[22]  James G. Oxley,et al.  Matroid theory , 1992 .

[23]  Charles J. Colbourn,et al.  Roots of the Reliability Polynomial , 1992, SIAM J. Discret. Math..

[24]  Shu-Chiuan Chang,et al.  Reliability Polynomials and Their Asymptotic Limits for Families of Graphs , 2002 .

[25]  Helly.  Aufgaben und Lehrsätze aus der Analysis , 1928 .