Network robustness and random processes
From MaRDI portal
Publication:1618381
DOI10.1016/j.physa.2015.01.056zbMath1400.93070OpenAlexW2023336067MaRDI QIDQ1618381
Jiří Sedoník, Michal Bíl, Rostislav Vodak
Publication date: 13 November 2018
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2015.01.056
Monte Carlo methods (65C05) Sensitivity (robustness) (93B35) Deterministic network models in operations research (90B10)
Related Items (1)
Cites Work
- Improving the network robustness against cascading failures by adding links
- Measuring the network robustness by Monte Carlo estimation of shortest path length distribution
- Network robustness to targeted attacks. The interplay of expansibility and degree distribution
- Robustness analysis of static routing on networks
- Robustness of star graph network under link failure
- Effect of random edge failure on the average path length
- Applying path-counting methods for measuring the robustness of the network-structured system
- ROBUSTNESS IN SCALE-FREE NETWORKS: COMPARING DIRECTED AND UNDIRECTED NETWORKS
- Enhancing the robustness of scale-free networks
- Finite Markov Chains and Algorithmic Applications
- A new way to improve the robustness of complex communication networks by allocating redundancy links
- OPTIMIZATION OF ROBUSTNESS OF SCALE-FREE NETWORK TO RANDOM AND TARGETED ATTACKS
This page was built for publication: Network robustness and random processes
