Reliability polynomials and their asymptotic limits for families of graphs
From MaRDI portal
Publication:1405574
DOI10.1023/A:1024663508526zbMath1118.82301arXivcond-mat/0208538OpenAlexW3105684108MaRDI QIDQ1405574
Shu-Chiuan Chang, Robert Shrock
Publication date: 25 August 2003
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cond-mat/0208538
Extremal problems in graph theory (05C35) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (7)
The Brown-Colbourn conjecture on zeros of reliability polynomials is false ⋮ Tutte polynomial of pseudofractal scale-free web ⋮ Network reliability: Heading out on the highway ⋮ Rational roots of all‐terminal reliability ⋮ On the reliability roots of simplicial complexes and matroids ⋮ The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane ⋮ Spanning forests and the \(q\)-state Potts model in the limit \(q \to 0\)
This page was built for publication: Reliability polynomials and their asymptotic limits for families of graphs