## Abstract

Consider a directed network in which each arc can fail with some specified probability. An entity arrives on this network at a designated origin node and traverses the network in a random-walk fashion until it either terminates at a destination node, or until an arc fails while being traversed. We study the problem of assessing the probability that the random walk reaches the destination node, which we call the survival probability of the network. Complicating our analysis is the assumption that certain arcs have "memory," in the sense that after a memory arc is successfully traversed, it cannot fail on any subsequent traversal during the walk. We prove that this problem is #P-hard, provide methods for obtaining lower and upper bounds on the survival probability, and demonstrate the effectiveness of our bounding methods on randomly generated networks.

Original language | English (US) |
---|---|

Pages (from-to) | 67-86 |

Number of pages | 20 |

Journal | Networks |

Volume | 66 |

Issue number | 1 |

DOIs | |

State | Published - Aug 1 2015 |

Externally published | Yes |

## Keywords

- #P-hard
- Markov chain
- computational complexity
- heuristics
- network reliability
- random walks on graphs
- survival probability

## ASJC Scopus subject areas

- Software
- Information Systems
- Hardware and Architecture
- Computer Networks and Communications