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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Colbourn, C. J.: The Combinatorics of Network Reliability, Oxford University Press, 1987.
Fishman, G. S.: Monte Carlo: Concepts, Algorithms, and Applications, Springer, 1996.
Harms, D. D., M. Kraetzl, C. J. Colbourn, and J. S. Devitt: Network Reliability: Experiments with a Symbolic Algebra Environment, CRC Press, 1995.
Massart, P.: The tight constant in the Dvoretzky-Kiefer-Wolfowitz inequality, Annals of Probability, Vol. 18, pp. 1269–1283, 1990.
Oyama, T. and H. Morohosi: A quantitative method for evaluating stable connectedness of the network-structured system, Operations Research and Its Applications, Proc. the Fourth International Symposium, ISORA’ 02, X.-S. Zhang and D. Liu (eds.), World Publishing, Beijing, pp. 54–66, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morohosi, H., Oyama, T. (2004). Stable Connectivity of Networks and Its Monte Carlo Estimation. In: Niederreiter, H. (eds) Monte Carlo and Quasi-Monte Carlo Methods 2002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18743-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-18743-8_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20466-4
Online ISBN: 978-3-642-18743-8
eBook Packages: Springer Book Archive