{"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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
