New approximations for network reliability

DOI10.1002/NET.22215MaRDI QIDQ6566557zbMATH OpenFDO

Authors Jason I. Brown, Theodore Kolokolnikov, Robert E. Kooij

Publication date 3 July 2024

Published in Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/NET.22215

zbMATH Keywords

approximationaverage reliabilityfirst-order approximationMonte Carlonetwork reliabilityregular graphsecond-order approximationsubway-like network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1218894
• A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability
• scientific article; zbMATH DE number 7375995
• Network reliability
• A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem

Cites work

• A critical point for random graphs with a given degree sequence
• Combining monte carlo estimates and bounds for network reliability
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Critical window for connectivity in the configuration model
• 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 747040 (Why is no real title available?)
• scientific article; zbMATH DE number 798177 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• scientific article; zbMATH DE number 3080734 (Why is no real title available?)
• Maximal intervals of decrease and inflection points for node reliability
• Maximizing algebraic connectivity for certain families of graphs
• Maximizing Algebraic Connectivity in the Space of Graphs With a Fixed Number of Vertices and Edges
• Network reliability
• Network reliability: Heading out on the highway
• The average reliability of a graph
• The Bernstein polynomial basis: a centennial retrospective

Cited in

(2)

• Degree-based approximations for network reliability polynomials
• The average expected value of a rooted graph, Monte Carlo calculation, and a power index for the voting game

This page was built for publication: New approximations for network reliability

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