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

被引：23

作者：

Morohosi, Hozumi ^{[1
]}

机构：

[1] Natl Grad Inst Policy Studies, Minato Ku, Tokyo, Japan

来源：

MATHEMATICS AND COMPUTERS IN SIMULATION | 2010年 / 81卷 / 03期

关键词：

Network robustness; Random graph; Monte Carlo method;

D O I：

10.1016/j.matcom.2010.07.022

中图分类号：

TP39 [计算机的应用];

学科分类号：

080201 [机械制造及其自动化];

摘要：

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. (C) 2010 IMACS. Published by Elsevier B.V. All rights reserved.

引用

页码：551 / 559

页数：9

共 8 条

[1]

ALON N, 1994, AN S FDN CO, P24

[2]

Colbourn Charles J, 1987, The combinatorics of network reliability

[3]

Dimov I.T., 2008, Monte Carlo methods for applied scientists

[4]

Harms D.D., 1995, NETWORK RELIABILITY

[5]

Larson R. C., 1981, Urban operations research

[6]

Morohosi H, 2004, MONTE CARLO AND QUASI-MONTE CARLO METHODS 2002, P357

[7]

Oyama T., 2004, International Transactions in Operational Research, V11, P555, DOI 10.1111/j.1475-3995.2004.00476.x

[8]

Vaughan RJ., 1987, Urban spatial traffic patterns

← 1 →