Measuring the network robustness by Monte Carlo estimation of shortest path length distribution

DOI10.1016/J.MATCOM.2010.07.022zbMath1230.90051OpenAlexW2066862931MaRDI QIDQ622179

Hozumi Morohosi

Publication date: 31 January 2011

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2010.07.022

zbMATH Keywords

Monte Carlo methodrandom graphnetwork robustness

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Stochastic network models in operations research (90B15)

Related Items (1)

Network robustness and random processes

Cites Work

• Applying the shortest-path-counting problem to evaluate the importance of city road segments and the connectedness of the network-structured system
• Monte Carlo Methods for Applied Scientists
• Unnamed Item
• Unnamed Item

This page was built for publication: Measuring the network robustness by Monte Carlo estimation of shortest path length distribution