{"id":"https://openalex.org/W2159332695","doi":"https://doi.org/10.1002/net.3230130210","title":"Calculating bounds on reachability and connectedness in stochastic networks","display_name":"Calculating bounds on reachability and connectedness in stochastic networks","publication_year":1983,"publication_date":"1983-06-01","ids":{"openalex":"https://openalex.org/W2159332695","doi":"https://doi.org/10.1002/net.3230130210","mag":"2159332695"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230130210","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230130210","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":"https://openalex.org/A5035102045","display_name":"Michael O. Ball","orcid":"https://orcid.org/0000-0003-2757-8569"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Michael O. Ball","raw_affiliation_strings":["College of Business and Management, University of Maryland, College Park, Maryland 20742"],"affiliations":[{"raw_affiliation_string":"College of Business and Management, University of Maryland, College Park, Maryland 20742","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005781105","display_name":"J. Scott Provan","orcid":null},"institutions":[{"id":"https://openalex.org/I1321296531","display_name":"National Institute of Standards and Technology","ror":"https://ror.org/05xpvk416","country_code":"US","type":"funder","lineage":["https://openalex.org/I1321296531","https://openalex.org/I1343035065"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. Scott Provan","raw_affiliation_strings":["Center for Applied Mathematics, National Bureau of Standards, Washington, DC 20234"],"affiliations":[{"raw_affiliation_string":"Center for Applied Mathematics, National Bureau of Standards, Washington, DC 20234","institution_ids":["https://openalex.org/I1321296531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5035102045"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":25.5288,"has_fulltext":false,"cited_by_count":146,"citation_normalized_percentile":{"value":0.99829816,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"13","issue":"2","first_page":"253","last_page":"278"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12423","display_name":"Software Reliability and Analysis Research","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11357","display_name":"Risk and Safety Analysis","score":0.9922000169754028,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8413658142089844},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.7405980229377747},{"id":"https://openalex.org/keywords/social-connectedness","display_name":"Social connectedness","score":0.6851887702941895},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6709660887718201},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6263319849967957},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6043688058853149},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5084013342857361},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.488739013671875},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.47405359148979187},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45734429359436035},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4523825943470001},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.45159149169921875},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4421412944793701},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36055392026901245},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3093484044075012},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19480064511299133}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8413658142089844},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.7405980229377747},{"id":"https://openalex.org/C201943243","wikidata":"https://www.wikidata.org/wiki/Q7551008","display_name":"Social connectedness","level":2,"score":0.6851887702941895},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6709660887718201},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6263319849967957},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6043688058853149},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5084013342857361},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.488739013671875},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.47405359148979187},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45734429359436035},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4523825943470001},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.45159149169921875},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4421412944793701},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36055392026901245},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3093484044075012},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19480064511299133},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230130210","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230130210","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W108232731","https://openalex.org/W1534511119","https://openalex.org/W1655990431","https://openalex.org/W1964119857","https://openalex.org/W1966657789","https://openalex.org/W1980331282","https://openalex.org/W2000791724","https://openalex.org/W2006811678","https://openalex.org/W2008292658","https://openalex.org/W2011039300","https://openalex.org/W2014091871","https://openalex.org/W2014757250","https://openalex.org/W2028244023","https://openalex.org/W2029478301","https://openalex.org/W2029673229","https://openalex.org/W2039086323","https://openalex.org/W2065447203","https://openalex.org/W2070505654","https://openalex.org/W2089213868","https://openalex.org/W2106573360","https://openalex.org/W2115826669","https://openalex.org/W2125690626","https://openalex.org/W2146354455","https://openalex.org/W2151718187","https://openalex.org/W2218040560","https://openalex.org/W2342164615","https://openalex.org/W3136243343","https://openalex.org/W3138807513","https://openalex.org/W4234163381","https://openalex.org/W4244424643","https://openalex.org/W4246377907","https://openalex.org/W6792319920"],"related_works":["https://openalex.org/W2136512912","https://openalex.org/W2127267268","https://openalex.org/W2156446763","https://openalex.org/W2067910792","https://openalex.org/W2150194458","https://openalex.org/W2143461633","https://openalex.org/W2889071233","https://openalex.org/W4321471459","https://openalex.org/W4221156924","https://openalex.org/W2120622178"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2],"article,":[3],"computational":[4],"procedures":[5],"are":[6,23,49,63,84,128],"presented":[7],"for":[8,73],"generating":[9],"bounds":[10,83,87,104,142],"on":[11,65],"measures":[12,18],"of":[13,53,76,82,99,116,122,135,140],"network":[14,101,118,124],"reliability.":[15],"The":[16,138],"two":[17],"considered,":[19],"reachability":[20],"and":[21,102,119,147],"connectedness,":[22],"the":[24,58,71,74,97,100,114,117,120,133,136,141],"probability":[25],"that":[26],"there":[27],"is":[28,91,108],"an":[29],"operating":[30],"path":[31,146],"from":[32],"a":[33,40,94,111],"node":[34],"to":[35],"all":[36],"other":[37],"nodes":[38],"in":[39,51,55,96,113],"directed":[41],"(respectively":[42],"undirected)":[43],"stochastic":[44],"network.":[45],"Our":[46],"bounds,":[47],"which":[48,131],"given":[50,130],"terms":[52],"polynomials":[54],"p":[56],",":[57],"common":[59],"arc":[60],"failure":[61],"probability,":[62],"based":[64],"recent":[66],"bounding":[67],"results":[68,127],"developed":[69],"by":[70,93,110],"authors":[72],"class":[75],"shellable":[77],"independence":[78],"systems.":[79],"Two":[80],"pairs":[81],"given:":[85],"weaker":[86],"whose":[88,105],"computation":[89,106],"time":[90,107],"bounded":[92,109],"polynomial":[95,112],"size":[98,115],"tighter":[103],"number":[121],"minimum\u2010cardinality":[123],"cuts.":[125],"Computational":[126],"also":[129],"evaluate":[132],"quality":[134],"bounds.":[137],"generation":[139],"involves":[143],"several":[144],"interesting":[145],"cut":[148],"counting":[149],"problems.":[150]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}