Reliability Polynomials and their Asymptotic Limits for Families of Graphs
Shu-Chiuan Chang, Robert Shrock

TL;DR
This paper computes reliability polynomials for lattice strips of fixed width and infinite length, introduces a reliability per vertex concept, and analyzes the zeros of these polynomials to understand their asymptotic behavior.
Contribution
It provides exact calculations of reliability polynomials for specific lattice graphs and introduces the reliability per vertex, analyzing their zeros and asymptotic limits.
Findings
Exact reliability polynomials for lattice strips of width up to 4.
Definition and calculation of reliability per vertex for infinite graphs.
Determination of the asymptotic zero distribution and nonanalytic regions.
Abstract
We present exact calculations of reliability polynomials for lattice strips of fixed widths and arbitrarily great length with various boundary conditions. We introduce the notion of a reliability per vertex, where denotes the number of vertices in and denotes the formal limit . We calculate this exactly for various families of graphs. We also study the zeros of in the complex plane and determine exactly the asymptotic accumulation set of these zeros , across which is nonanalytic.
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.
