{"id":"https://openalex.org/W2759095527","doi":"https://doi.org/10.1137/16m105678x","title":"A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes","display_name":"A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2759095527","doi":"https://doi.org/10.1137/16m105678x","mag":"2759095527"},"language":"en","primary_location":{"id":"doi:10.1137/16m105678x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m105678x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/3f21cb0e-01cf-45a7-a0e0-60542e95a449","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003946901","display_name":"Kousha Etessami","orcid":"https://orcid.org/0000-0001-5700-3462"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Kousha Etessami","raw_affiliation_strings":["U. of Edinburgh"],"affiliations":[{"raw_affiliation_string":"U. of Edinburgh","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5106184727","display_name":"Alistair Stewart","orcid":null},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Alistair Stewart","raw_affiliation_strings":["U. of Edinburgh"],"affiliations":[{"raw_affiliation_string":"U. of Edinburgh","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043084405","display_name":"Mihalis Yannakakis","orcid":"https://orcid.org/0000-0003-2857-1860"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mihalis Yannakakis","raw_affiliation_strings":["U. of Edinburgh"],"affiliations":[{"raw_affiliation_string":"U. of Edinburgh","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5003946901"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":0.5548,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.65838681,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"46","issue":"5","first_page":"1515","last_page":"1553"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9666000008583069,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9666000008583069,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9193999767303467,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9003000259399414,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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/monotone-polygon","display_name":"Monotone polygon","score":0.6544699668884277},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5894742608070374},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.5788151025772095},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5755547285079956},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5732274651527405},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5594468116760254},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.5347816944122314},{"id":"https://openalex.org/keywords/matrix-polynomial","display_name":"Matrix polynomial","score":0.5003328323364258},{"id":"https://openalex.org/keywords/system-of-polynomial-equations","display_name":"System of polynomial equations","score":0.4998500347137451},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47967958450317383},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4471479058265686},{"id":"https://openalex.org/keywords/multivariate-statistics","display_name":"Multivariate statistics","score":0.4451344907283783},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.42716100811958313},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4122551679611206},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08762851357460022},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07070156931877136}],"concepts":[{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6544699668884277},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5894742608070374},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.5788151025772095},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5755547285079956},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5732274651527405},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5594468116760254},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.5347816944122314},{"id":"https://openalex.org/C101044782","wikidata":"https://www.wikidata.org/wiki/Q6787887","display_name":"Matrix polynomial","level":3,"score":0.5003328323364258},{"id":"https://openalex.org/C105335568","wikidata":"https://www.wikidata.org/wiki/Q7663735","display_name":"System of polynomial equations","level":3,"score":0.4998500347137451},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47967958450317383},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4471479058265686},{"id":"https://openalex.org/C161584116","wikidata":"https://www.wikidata.org/wiki/Q1952580","display_name":"Multivariate statistics","level":2,"score":0.4451344907283783},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.42716100811958313},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4122551679611206},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08762851357460022},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07070156931877136},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/16m105678x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m105678x","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/3f21cb0e-01cf-45a7-a0e0-60542e95a449","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/3f21cb0e-01cf-45a7-a0e0-60542e95a449","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Etessami, K, Sinclair, A & Yannakakis, M 2017, 'A polynomial time algorithm for computing extinction probabilities of multi-type branching processes', SIAM Journal on Scientific Computing, vol. 46, no. 5, pp. 1515-1553. https://doi.org/10.1137/16M105678X","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.ed.ac.uk:publications/3f21cb0e-01cf-45a7-a0e0-60542e95a449","is_oa":false,"landing_page_url":"http://hdl.handle.net/20.500.11820/3f21cb0e-01cf-45a7-a0e0-60542e95a449","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/3f21cb0e-01cf-45a7-a0e0-60542e95a449","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/3f21cb0e-01cf-45a7-a0e0-60542e95a449","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Etessami, K, Sinclair, A & Yannakakis, M 2017, 'A polynomial time algorithm for computing extinction probabilities of multi-type branching processes', SIAM Journal on Scientific Computing, vol. 46, no. 5, pp. 1515-1553. https://doi.org/10.1137/16M105678X","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7321214131","display_name":null,"funder_award_id":"IE 120964","funder_id":"https://openalex.org/F4320320006","funder_display_name":"Royal Society"},{"id":"https://openalex.org/G8020882014","display_name":null,"funder_award_id":"CCF1320654","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320006","display_name":"Royal Society","ror":"https://ror.org/03wnrjx87"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1968272180","https://openalex.org/W1991624978","https://openalex.org/W2023206235","https://openalex.org/W2040721698","https://openalex.org/W2050399394","https://openalex.org/W2057078623","https://openalex.org/W2060468169","https://openalex.org/W2078982362","https://openalex.org/W2132315300","https://openalex.org/W2133667894","https://openalex.org/W2148701797","https://openalex.org/W2171048418","https://openalex.org/W2557326367","https://openalex.org/W4236233420","https://openalex.org/W4253707970"],"related_works":["https://openalex.org/W2418118208","https://openalex.org/W1998639298","https://openalex.org/W1978778998","https://openalex.org/W185179213","https://openalex.org/W2580281957","https://openalex.org/W1977380678","https://openalex.org/W1971343294","https://openalex.org/W1983297160","https://openalex.org/W33739186","https://openalex.org/W2089648692","https://openalex.org/W2768220934","https://openalex.org/W2022078407","https://openalex.org/W2155839837","https://openalex.org/W2025911494","https://openalex.org/W2133861730","https://openalex.org/W2089113283","https://openalex.org/W2094462297","https://openalex.org/W2006978604","https://openalex.org/W2007694568","https://openalex.org/W2913177636"],"abstract_inverted_index":{"We":[0,59],"show":[1],"that":[2],"one":[3],"can":[4],"approximate":[5],"the":[6,25,29,41,47,54,69],"least":[7],"fixed":[8],"point":[9],"solution":[10],"for":[11],"a":[12],"multivariate":[13],"system":[14,30],"of":[15,28,31,46,51,72],"monotone":[16],"probabilistic":[17],"polynomial":[18,22],"equations":[19,32],"in":[20,23,34],"time":[21],"both":[24],"encoding":[26],"size":[27],"and":[33,80,89],"$\\log(1/\\epsilon)$,":[35],"where":[36],"$\\epsilon":[37],">":[38],"0$":[39],"is":[40,53],"desired":[42],"additive":[43],"error":[44],"bound":[45],"solution.":[48],"(The":[49],"model":[50],"computation":[52],"standard":[55],"Turing":[56],"machine":[57],"model.)":[58],"use":[60],"this":[61],"result":[62],"to":[63],"resolve":[64],"several":[65],"open":[66],"problems":[67],"regarding":[68],"computational":[70],"complexity":[71],"computing":[73],"key":[74],"quantities":[75],"associated":[76],"with":[77],"some":[78],"classic":[79],"well":[81],"studied":[82],"stochastic":[83,90],"processes,":[84],"including":[85],"multitype":[86],"branching":[87],"processes":[88],"context-free":[91],"grammars.":[92]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}