网络可靠性多项式系数的快速粗糙界

2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS) Pub Date : 2019-08-01 DOI:10.1109/OPCS.2019.8880191

A. Rodionov

{"title":"网络可靠性多项式系数的快速粗糙界","authors":"A. Rodionov","doi":"10.1109/OPCS.2019.8880191","DOIUrl":null,"url":null,"abstract":"The problem of fast estimating of reliability polynomial’ coefficients is considered in the paper in the case of all-terminal reliability (probability of a graph being connected). Obtaining lower and upper bounds for each coefficient of a reliability polynomial in one of its possible representation is based on counting all trivially known connected and disconnected realizations (states) of a random graph, based on easily derived information about graph’s structure, such as existence of chains and their lengths.","PeriodicalId":288547,"journal":{"name":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Fast Rough Bounds for the Coefficients of the Network Reliability Polynomial\",\"authors\":\"A. Rodionov\",\"doi\":\"10.1109/OPCS.2019.8880191\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of fast estimating of reliability polynomial’ coefficients is considered in the paper in the case of all-terminal reliability (probability of a graph being connected). Obtaining lower and upper bounds for each coefficient of a reliability polynomial in one of its possible representation is based on counting all trivially known connected and disconnected realizations (states) of a random graph, based on easily derived information about graph’s structure, such as existence of chains and their lengths.\",\"PeriodicalId\":288547,\"journal\":{\"name\":\"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/OPCS.2019.8880191\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/OPCS.2019.8880191","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文研究了全端可靠度(图连通概率)情况下可靠度多项式系数的快速估计问题。可靠性多项式在其可能表示形式中的每个系数的下界和上界是基于计算随机图的所有已知的连通和不连通实现(状态)，并基于图的结构信息，如链的存在及其长度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Fast Rough Bounds for the Coefficients of the Network Reliability Polynomial

The problem of fast estimating of reliability polynomial’ coefficients is considered in the paper in the case of all-terminal reliability (probability of a graph being connected). Obtaining lower and upper bounds for each coefficient of a reliability polynomial in one of its possible representation is based on counting all trivially known connected and disconnected realizations (states) of a random graph, based on easily derived information about graph’s structure, such as existence of chains and their lengths.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2019 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)

自引率

0.00%

发文量