Stable Connectivity of Networks and Its Monte Carlo Estimation

Hozumi Morohosi () and Tatsuo Oyama ()
Additional contact information
Hozumi Morohosi: National Graduate Institute for Policy Studies
Tatsuo Oyama: National Graduate Institute for Policy Studies

A chapter in Monte Carlo and Quasi-Monte Carlo Methods 2002, 2004, pp 357-366 from Springer

Abstract: Summary We propose a criterion for the stability of network-structured systems, which counts the number of paths between all the pairs of distinct nodes in the random network. In order to estimate the criterion we introduce a Monte Carlo algorithm. Some numerical experiments are presented to show the performance of our criterion.

Keywords: Road Network; Monte Carlo Algorithm; Empirical Distribution Function; Network Reliability; Monte Carlo Estimation (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:sprchp:978-3-642-18743-8_22

Ordering information: This item can be ordered from
http://www.springer.com/9783642187438

DOI: 10.1007/978-3-642-18743-8_22

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().