Assessing the reliability polynomial based on percolation theory
Farkhondeh A. Sajadi

TL;DR
This paper investigates network robustness using percolation theory to evaluate the reliability polynomial of various network models, including inhomogeneous and scale-free graphs, providing insights into their resilience.
Contribution
It introduces a novel application of percolation theory to assess the reliability polynomial of complex network models, enhancing understanding of network robustness.
Findings
Percolation effectively measures network robustness.
Reliability polynomial varies with network topology.
Scale-free networks show distinct resilience patterns.
Abstract
In this paper, we study the robustness of network topologies. We use the concept of percolation as measuring tool to assess the reliability polynomial of those systems which can be modeled as a general inhomogeneous random graph as well as scale-free random graph.
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
TopicsGraph theory and applications · Limits and Structures in Graph Theory · Complex Network Analysis Techniques
