New approximations for network reliability

DOI10.1002/net.22215zbMATH Open1542.90055MaRDI QIDQ6566557

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

Publication date: 3 July 2024

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

Monte Carloapproximationregular graphsecond-order approximationnetwork reliabilityaverage reliabilityfirst-order approximationsubway-like network

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The average reliability of a graph
• The Bernstein polynomial basis: a centennial retrospective
• Maximal intervals of decrease and inflection points for node reliability
• Maximizing algebraic connectivity for certain families of graphs
• Combining monte carlo estimates and bounds for network reliability
• A critical point for random graphs with a given degree sequence
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Maximizing Algebraic Connectivity in the Space of Graphs With a Fixed Number of Vertices and Edges
• Critical Window for Connectivity in the Configuration Model
• Network reliability
• Network reliability: Heading out on the highway

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