{"id":"https://openalex.org/W3037073585","doi":"https://doi.org/10.1145/3357713.3384336","title":"A phase transition and a quadratic time unbiased estimator for network reliability","display_name":"A phase transition and a quadratic time unbiased estimator for network reliability","publication_year":2020,"publication_date":"2020-06-22","ids":{"openalex":"https://openalex.org/W3037073585","doi":"https://doi.org/10.1145/3357713.3384336","mag":"3037073585"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384336","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384336","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384336","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384336","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028448267","display_name":"David R. Karger","orcid":"https://orcid.org/0000-0002-0024-5847"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"David R. Karger","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028448267"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.3808,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.60085156,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"485","last_page":"495"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9958999752998352,"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.9958999752998352,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.987500011920929,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"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/T11476","display_name":"Graph theory and applications","score":0.9785000085830688,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tweaking","display_name":"Tweaking","score":0.6471292972564697},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5647315382957458},{"id":"https://openalex.org/keywords/estimator","display_name":"Estimator","score":0.5455054044723511},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.5298336148262024},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5209463834762573},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5156049132347107},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.48471498489379883},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46939295530319214},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37931734323501587},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34848272800445557},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34638282656669617},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31723517179489136},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1790798008441925}],"concepts":[{"id":"https://openalex.org/C2780200862","wikidata":"https://www.wikidata.org/wiki/Q4453309","display_name":"Tweaking","level":2,"score":0.6471292972564697},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5647315382957458},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.5455054044723511},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.5298336148262024},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5209463834762573},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5156049132347107},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.48471498489379883},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46939295530319214},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37931734323501587},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34848272800445557},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34638282656669617},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31723517179489136},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1790798008441925},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"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/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3357713.3384336","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384336","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384336","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/146218","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/146218","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM|Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"doi:10.1145/3357713.3384336","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384336","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384336","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3037073585.pdf","grobid_xml":"https://content.openalex.org/works/W3037073585.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W1975407578","https://openalex.org/W2104410402","https://openalex.org/W2115826669","https://openalex.org/W2117889403","https://openalex.org/W2168919539","https://openalex.org/W2260028672","https://openalex.org/W2531366450","https://openalex.org/W2747217709","https://openalex.org/W2770673807","https://openalex.org/W2795481904","https://openalex.org/W2949441583","https://openalex.org/W2982592370"],"related_works":["https://openalex.org/W4241780599","https://openalex.org/W2968428037","https://openalex.org/W1981619058","https://openalex.org/W4244708442","https://openalex.org/W2152101763","https://openalex.org/W4323777416","https://openalex.org/W2505446473","https://openalex.org/W2057518680","https://openalex.org/W4394339218","https://openalex.org/W2738037186"],"abstract_inverted_index":{"We":[0,11],"improve":[1],"the":[2,45,54,68,71,114,124,139,146,158],"time":[3,116],"for":[4,137],"approximating":[5],"network":[6],"(un)reliability":[7],"to":[8,49,81,102,178],"(n":[9],"2).":[10],"do":[12],"so":[13],"not":[14,112],"with":[15,20],"a":[16,21,38,50,127,149,161],"new":[17,135,155],"algorithm,":[18],"but":[19,118],"deeper":[22],"analysis":[23],"and":[24,62],"tweaking":[25],"of":[26,57,108,123,126,141,148,160,172],"algorithms":[27],"from":[28],"our":[29,173],"previous":[30],"work.":[31],"In":[32],"particular,":[33],"we":[34,77],"show":[35],"that":[36],"once":[37],"graph\u2019s":[39,72,128,162],"failure":[40,73,147],"probability":[41],"shrinks":[42],"below":[43],"1/2,":[44],"graph":[46],"rapidly":[47],"transitions":[48],"regime":[51],"where":[52],"even":[53],"expected":[55],"number":[56],"cut":[58,87,94,142],"failures":[59,95,143],"is":[60,65,111],"small,":[61],"in":[63],"fact":[64],"almost":[66],"exactly":[67],"same":[69],"as":[70,96,152,154,164],"probability.":[74],"That":[75],"is,":[76],"are":[78,166],"very":[79],"unlikely":[80],"ever":[82],"see":[83],"more":[84,176],"than":[85],"one":[86],"fail.":[88],"This":[89],"lets":[90],"us":[91],"treat":[92],"these":[93],"essentially":[97],"independent,":[98],"making":[99],"it":[100],"easier":[101],"estimate":[103],"their":[104],"likelihood.":[105],"The":[106],"contribution":[107],"this":[109,120],"paper":[110],"just":[113],"improved":[115],"bound,":[117],"also":[119],"clearer":[121],"understanding":[122],"evolution":[125,159],"reliability.":[129],"Our":[130],"results":[131,174],"rely":[132],"on":[133,145],"some":[134],"methods":[136],"analyzing":[138],"distribution":[140],"conditioned":[144],"particular":[150],"cut,":[151],"well":[153],"insights":[156],"into":[157],"connectivity":[163],"edges":[165],"randomly":[167],"added":[168],"over":[169],"time.":[170],"Some":[171],"apply":[175],"broadly,":[177],"all":[179],"monotone":[180],"reliability":[181],"systems.":[182]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}