Network robustness based on inverse percolation

DOI10.1007/S40995-021-01104-5MaRDI QIDQ7232750zbMATH OpenFDO

Authors Farkhondeh Alsadat Sajadi

Publication date 23 April 2026

Published in Iranian Journal of Science and Technology. Transaction A: Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40995-021-01104-5

zbMATH Keywords

complex networknetwork reliabilitypercolation thresholdrandom graphreliability polynomialscale-free network

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Reliability and life testing (62N05)

Cites work

• A critical point for random graphs with a given degree sequence
• An approximation theorem for the Poisson binomial distribution
• An Efficient Method for Reliability Evaluation of a General Network
• Bounds on the Reliability Polynomial for Shellable Independence Systems
• scientific article; zbMATH DE number 3148802 (Why is no real title available?)
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3506434 (Why is no real title available?)
• scientific article; zbMATH DE number 1295362 (Why is no real title available?)
• scientific article; zbMATH DE number 617592 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 1866312 (Why is no real title available?)
• scientific article; zbMATH DE number 795224 (Why is no real title available?)
• scientific article; zbMATH DE number 843314 (Why is no real title available?)
• scientific article; zbMATH DE number 897152 (Why is no real title available?)
• scientific article; zbMATH DE number 3189757 (Why is no real title available?)
• Network science. With Márton Pósfai
• New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex Networks
• Non-Stanley bounds for network reliability
• Percolation
• Percolation Processes and Related Topics
• Reliability polynomials and their asymptotic limits for families of graphs
• Statistical mechanics of complex networks
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• The structure and dynamics of networks
• The Upper Bound Conjecture and Cohen-Macaulay Rings

This page was built for publication: Network robustness based on inverse percolation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232750)