Failure of random networks
From MaRDI portal
Summary: This paper studies random failure of networks when we know the probability of failure of each link but we know nothing about the intercorrelation of these failures. Without any assumption on the structure of the network, we compute the probability that there still exists a path from the source to the sink after the worst possible failure of the network.
Recommendations
- Failure in Complex Social Networks
- Cascading failures in congested scale-free networks
- Percolation theories for multipartite networked systems under random failures
- Probabilistic analysis of cascade failure dynamics in complex network
- Abnormal cascading failure spreading on complex networks
- OPTIMIZATION OF SCALE-FREE NETWORK FOR RANDOM FAILURES
- Robustness of multipartite networks in face of random node failure
- Principles of Distributed Systems
- Navigability of interconnected networks under random failures
Cited in
(12)- Percolation in dense storage arrays
- Robustness of square networks
- Impact of random failures and attacks on Poisson and power-law random networks
- Effect of random edge failure on the average path length
- Bounds on expected performance of networks with links subject to failure
- scientific article; zbMATH DE number 3968289 (Why is no real title available?)
- Binary strings and reliability of path networks
- On a random walk survivability problem with arc failures and memory
- Detecting a Network Failure
- Principles of Distributed Systems
- On the probability of facing random breakdowns: a measure of networks' vulnerability
- An accurate generic model to measure of robustness and fragility of networks to random breakdowns
This page was built for publication: Failure of random networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825855)
