{"id":"https://openalex.org/W2031807474","doi":"https://doi.org/10.1002/net.3230200303","title":"Combining monte carlo estimates and bounds for network reliability","display_name":"Combining monte carlo estimates and bounds for network reliability","publication_year":1990,"publication_date":"1990-05-01","ids":{"openalex":"https://openalex.org/W2031807474","doi":"https://doi.org/10.1002/net.3230200303","mag":"2031807474"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230200303","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230200303","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Louis D. Nel","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Louis D. Nel","raw_affiliation_strings":["Department of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1 Canada","Dept. of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Waterloo, Waterloo, Ontario, N2L 3G1 Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"Dept. of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038008468","display_name":"Charles J. Colbourn","orcid":"https://orcid.org/0000-0002-3104-9515"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Charles J. Colbourn","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, N2L 3G1 Canada","Department of Combinatorics & Optimization, University of Waterloo, Waterloo, Ontario,  N2L 3G1, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, N2L 3G1 Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"Department of Combinatorics & Optimization, University of Waterloo, Waterloo, Ontario,  N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.8761,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.88137208,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"20","issue":"3","first_page":"277","last_page":"298"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9890999794006348,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9890999794006348,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9887999892234802,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9886999726295471,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.7164980173110962},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.540287435054779},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.5150578022003174},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.49705222249031067},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48749685287475586},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4789179563522339},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44995173811912537},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.44821563363075256},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.42381197214126587},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4195573925971985},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39966291189193726},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.34023234248161316},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2638675570487976},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1522424817085266}],"concepts":[{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.7164980173110962},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.540287435054779},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.5150578022003174},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.49705222249031067},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48749685287475586},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4789179563522339},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44995173811912537},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.44821563363075256},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.42381197214126587},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4195573925971985},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39966291189193726},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.34023234248161316},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2638675570487976},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1522424817085266},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230200303","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230200303","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1980331282","https://openalex.org/W1994715527","https://openalex.org/W1998076865","https://openalex.org/W2006811678","https://openalex.org/W2017419657","https://openalex.org/W2018691712","https://openalex.org/W2028122921","https://openalex.org/W2029673229","https://openalex.org/W2030760029","https://openalex.org/W2042322483","https://openalex.org/W2043790108","https://openalex.org/W2044960217","https://openalex.org/W2066720893","https://openalex.org/W2093071349","https://openalex.org/W2101720181","https://openalex.org/W2111933629","https://openalex.org/W2117889403","https://openalex.org/W2118624390","https://openalex.org/W2119950759","https://openalex.org/W2146883641","https://openalex.org/W2159332695","https://openalex.org/W2169621137","https://openalex.org/W2218040560","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2058299944","https://openalex.org/W4323360720","https://openalex.org/W1550144461","https://openalex.org/W4233892543","https://openalex.org/W2783959783","https://openalex.org/W2602164040","https://openalex.org/W2037206237","https://openalex.org/W4310658774","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"simplified":[2],"model":[3],"of":[4,45,54,69,73,120,164],"a":[5,9,36,106],"communications":[6],"network":[7],"is":[8,78],"probabilistic":[10],"graph":[11],"in":[12,38,137],"which":[13],"each":[14],"edge":[15,40],"operates":[16],"with":[17],"the":[18,39,55,60,70,79,87,121,138,155,162,165],"same":[19],"probability.":[20,42],"The":[21,43],"all\u2010terminal":[22,126],"reliability":[23,76,127,163],",":[24],"or":[25],"probability":[26],"that":[27],"all":[28],"nodes":[29],"are":[30,48,84,99,128],"connected,":[31],"can":[32,64,92],"be":[33,65,93],"expressed":[34],"as":[35,134],"polynomial":[37,47],"operation":[41],"coefficients":[44,63,90,98,113],"this":[46,102],"obtained":[49,85,129],"from":[50],"an":[51],"interval":[52],"partitioning":[53],"cographic":[56],"matroid,":[57],"and":[58,91],"only":[59],"first":[61],"few":[62],"computed":[66],"efficiently.":[67],"One":[68],"best":[71],"sets":[72],"efficiently":[74,88],"computable":[75,89],"bounds":[77,83],"Ball\u2010Provan":[80,139],"bounds.":[81,140],"These":[82],"using":[86,131],"improved":[94],"substantially":[95],"if":[96],"additional":[97,112,135],"known.":[100],"In":[101,153],"paper,":[103],"we":[104],"develop":[105],"Monte":[107,148],"Carlo":[108,149],"method":[109],"for":[110,125],"estimating":[111],"by":[114,130],"randomly":[115],"sampling":[116],"over":[117,146],"spanning":[118],"trees":[119],"network.":[122,166],"Confidence":[123],"intervals":[124],"these":[132],"estimates":[133],"constraints":[136],"This":[141],"approach":[142],"has":[143],"some":[144],"advantages":[145],"conventional":[147],"point":[150],"estimate":[151],"methods.":[152],"particular,":[154],"computational":[156],"complexity":[157],"does":[158],"not":[159],"depend":[160],"on":[161]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-23T09:07:50.710637","created_date":"2025-10-10T00:00:00"}