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

Hozumi Morohosi

Mathematics and Computers in Simulation (MATCOM), 2010, vol. 81, issue 3, 551-559

Abstract: Two kinds of robustness measure for networks are introduced and applied to the road network systems in Japan. One is on the connectivity of randomly chosen pair of vertices, another is on the shortest path length between pair of connected vertices. We devise Monte Carlo methods for the computation of two measures.

Keywords: Network robustness; Random graph; Monte Carlo method (search for similar items in EconPapers)
Date: 2010
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475410002594
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:81:y:2010:i:3:p:551-559

DOI: 10.1016/j.matcom.2010.07.022

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().