结合条件蒙特卡罗和近似零方差重要抽样的网络可靠性估计

H. Cancela, P. L'Ecuyer, G. Rubino, B. Tuffin
{"title":"结合条件蒙特卡罗和近似零方差重要抽样的网络可靠性估计","authors":"H. Cancela, P. L'Ecuyer, G. Rubino, B. Tuffin","doi":"10.1109/WSC.2010.5679066","DOIUrl":null,"url":null,"abstract":"We study the combination of two efficient rare event Monte Carlo simulation techniques for the estimation of the connectivity probability of a given set of nodes in a graph when links can fail: approximate zero-variance importance sampling and a conditional Monte Carlo method which conditions on the event that a prespecified set of disjoint minpaths linking the set of nodes fails. Those two methods have been applied separately. Here we show how their combination can be defined and implemented, we derive asymptotic robustness properties of the resulting estimator when reliabilities of individual links go arbitrarily close to one, and we illustrate numerically the efficiency gain that can be obtained.","PeriodicalId":272260,"journal":{"name":"Proceedings of the 2010 Winter Simulation Conference","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Combination of conditional Monte Carlo and approximate zero-variance importance sampling for network reliability estimation\",\"authors\":\"H. Cancela, P. L'Ecuyer, G. Rubino, B. Tuffin\",\"doi\":\"10.1109/WSC.2010.5679066\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the combination of two efficient rare event Monte Carlo simulation techniques for the estimation of the connectivity probability of a given set of nodes in a graph when links can fail: approximate zero-variance importance sampling and a conditional Monte Carlo method which conditions on the event that a prespecified set of disjoint minpaths linking the set of nodes fails. Those two methods have been applied separately. Here we show how their combination can be defined and implemented, we derive asymptotic robustness properties of the resulting estimator when reliabilities of individual links go arbitrarily close to one, and we illustrate numerically the efficiency gain that can be obtained.\",\"PeriodicalId\":272260,\"journal\":{\"name\":\"Proceedings of the 2010 Winter Simulation Conference\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2010 Winter Simulation Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WSC.2010.5679066\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2010 Winter Simulation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WSC.2010.5679066","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

摘要

我们研究了两种有效的稀有事件蒙特卡罗模拟技术的组合,用于估计图中给定节点集在连接可能失效时的连通性概率:近似零方差重要抽样和条件蒙特卡罗方法,该方法的条件是连接节点集的预先指定的一组不相交的minpaths失效。这两种方法是分别应用的。在这里,我们展示了如何定义和实现它们的组合,当单个链路的可靠性任意接近于1时,我们推导了结果估计器的渐近鲁棒性,并且我们用数值说明了可以获得的效率增益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Combination of conditional Monte Carlo and approximate zero-variance importance sampling for network reliability estimation
We study the combination of two efficient rare event Monte Carlo simulation techniques for the estimation of the connectivity probability of a given set of nodes in a graph when links can fail: approximate zero-variance importance sampling and a conditional Monte Carlo method which conditions on the event that a prespecified set of disjoint minpaths linking the set of nodes fails. Those two methods have been applied separately. Here we show how their combination can be defined and implemented, we derive asymptotic robustness properties of the resulting estimator when reliabilities of individual links go arbitrarily close to one, and we illustrate numerically the efficiency gain that can be obtained.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信