arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2603.09059math.COmath.PR
收藏

图的真正可靠性根源

On the Real Reliability Roots of Graphs

Dalhousie University(达尔豪斯大学)

Jason I. Brown, Isaac McMullin

AI总结:

本文研究图的可靠性多项式的真实根,证明几乎所有图都有非实根,并在特定区间内根密集。

摘要:

考虑一个连通图G,假设每条边独立失效的概率为q。(终端)可靠性多项式是操作边的生成子图连通的概率。在本文中,我们专注于可靠性多项式的真正根(可靠性根)。我们证明几乎每个图都有非实根,且图的可靠性多项式在区间[β,0]上根密集,其中β≈-0.5707202942。

英文摘要:

Consider a connected graph $G$, and assume that every edge fails independently with probability $q$. The {\em (all-terminal) reliability polynomial} is the probability in $q$ that the spanning connected subgraph of operational edges is connected. In this paper we focus on the real roots of reliability polynomials ({\em reliability roots}). We prove that almost every graph has a nonreal reliability root, and that the reliability polynomials of graphs have roots dense on the interval $[β,0]$ where $β\approx-0.5707202942$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑