On a random walk survivability problem with arc failures and memory

DOI10.1002/NET.21608zbMATH Open1390.90133OpenAlexW2052325121MaRDI QIDQ4642452FDOQ4642452

Authors: Burak Büke, J. Cole Smith, Sadie Thomas 

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/24495241/RWWM_final.pdf

Recommendations

• Failure of random networks
• Network reliability with arc failures and repairs
• Moving in a network under random failures: a complexity analysis
• Bi-criteria path problem with minimum length and maximum survival probability
• Bounding the Reliability of Networks

zbMATH Keywords

Markov chaincomputational complexityheuristicssurvival probabilitynetwork reliabilityrandom walks on graphs\#P-hard

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stochastic network models in operations research (90B15)

Cited In (1)

• Network reliability: Heading out on the highway

This page was built for publication: On a random walk survivability problem with arc failures and memory

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