Reliability Polynomials of Simple Graphs having Arbitrarily many Inflection Points
Danielle Blackwell, Christopher Hunt, Keyne\'e Johnson

TL;DR
This paper demonstrates that for any number n, there exists a simple graph whose reliability polynomial has at least n inflection points, showing the complexity possible in graph reliability functions.
Contribution
It proves the existence of simple graphs with reliability polynomials having arbitrarily many inflection points, expanding understanding of polynomial complexity in graph theory.
Findings
Existence of simple graphs with arbitrarily many inflection points in their reliability polynomials
Reliability polynomials can exhibit complex behavior with multiple inflections
Advances the theoretical understanding of graph reliability functions
Abstract
In this paper we show that for each , there exists a simple graph whose reliability polynomial has at least inflection points.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReliability and Maintenance Optimization · Graph theory and applications · Coding theory and cryptography
