Application of a fully polynomial randomized approximation scheme (FPRAS) to infrastructure system reliability assessments

Simple item page
dc.citation.journalTitle12th International Conference on Structural Safety & Reliabilityen_US
dc.contributor.authorFu, Bowenen_US
dc.contributor.authorDueñas-Osorio, Leonardoen_US
dc.date.accessioned2023-02-13T21:41:14Zen_US
dc.date.available2023-02-13T21:41:14Zen_US
dc.date.issued8/6/2017en_US
dc.description.abstractNetworked systems make the reliability assessment of critical infrastructure computationally challenging given the combinatorial nature of system-level states. Several methods from numerical schemes to analytical approaches, such as Monte Carlo Simulation (MCS) and recursive decomposition algorithms (RDA), respectively, have been applied to this stochastic network problem. Despite progress over several decades, the problem remains open because of its intrinsic computational complexity. As the structural facilities of infrastructure systems continue to in terconnect in network forms, their study steers analysts to develop system reliability assessment methods based on graph theory and network science. A fully polynomial randomized approximation scheme (FPRAS) based on Karger’s graph contraction algorithm is an approximating method for reliability evaluation, which has a unique property rarely exploited in engineering reliability: that by performing a number of experiments in polynomial time (as a function of system size), it provides an a priori theoretical guarantee that the reliability estimate falls into the ϵ-neighborhood of its true value with (1−δ) confidence. We build upon the FPRAS ideas to develop an s-t reliability version that has practical appeal. Focusing on the relevant-cut enumeration stage of the FPRAS, we find correlations between the recurrence frequencies of links in minimum cuts within the randomization phase of the contraction algorithm, and typical network topological properties. We employ LASSO regression analysis to approximate the relationship between link recurrence frequencies and such topological metrics. With the topology-informed link recurrence frequencies, obtained at a much lower computational cost, we use a new biased contraction probability yielding 16.9% more distinct minimum cuts (MinCuts) than the original random contraction scheme. The biased contraction scheme proposed here can significantly improve the efficiency of reliability evaluation of networked infrastructure systems, while supporting infrastructure systems design, maintenance and restoration given its ability to offer error guarantees, which are ideal for future prescriptive guidelines in practice.en_US
dc.identifier.citationFu, Bowen and Dueñas-Osorio, Leonardo. "Application of a fully polynomial randomized approximation scheme (FPRAS) to infrastructure system reliability assessments." <i>12th International Conference on Structural Safety & Reliability,</i> (2017) https://doi.org/10.25611/RJGK-2X44.en_US
dc.identifier.doihttps://doi.org/10.25611/RJGK-2X44en_US
dc.identifier.urihttps://hdl.handle.net/1911/114454en_US
dc.language.isoengen_US
dc.rightsMade available under a Creative Commons Attribution Licenseen_US
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/en_US
dc.subject.keywordContraction algorithmen_US
dc.subject.keywordReliability assessmenten_US
dc.subject.keywordFPRASen_US
dc.titleApplication of a fully polynomial randomized approximation scheme (FPRAS) to infrastructure system reliability assessmentsen_US
dc.typeConference paperen_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Application-fully-polynomial-randomized-approximation-scheme-FPRAS-to-infrastructure-system-reliability-assessments.pdf
Size:
243.38 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Faculty Publications
Civil and Environmental Engineering Publications
Rice Graduate Student Collection