{"id":"https://openalex.org/W2005059149","doi":"https://doi.org/10.1145/1462153.1462154","title":"Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations","display_name":"Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2005059149","doi":"https://doi.org/10.1145/1462153.1462154","mag":"2005059149"},"language":"en","primary_location":{"id":"doi:10.1145/1462153.1462154","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1462153.1462154","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","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/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":false,"raw_author_name":"Kousha Etessami","raw_affiliation_strings":["University of Edinburgh, Edinburgh, UK","University of Edinburgh, Edinburgh , UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Edinburgh, Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"University of Edinburgh, Edinburgh , UK","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/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mihalis Yannakakis","raw_affiliation_strings":["Columbia University, New York, New York"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Columbia University, New York, New York","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":57.0859,"has_fulltext":false,"cited_by_count":521,"citation_normalized_percentile":{"value":0.99976972,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"56","issue":"1","first_page":"1","last_page":"66"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9984999895095825,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9984999895095825,"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"}},{"id":"https://openalex.org/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/markov-chain","display_name":"Markov chain","score":0.6401704549789429},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.5877464413642883},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.5759416222572327},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5536004900932312},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5419015288352966},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.4667857885360718},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.4653412103652954},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.455154150724411},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3821302056312561},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3778110146522522},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.3501847982406616},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33899223804473877},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33163806796073914},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3288215100765228}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6401704549789429},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.5877464413642883},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5759416222572327},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5536004900932312},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5419015288352966},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.4667857885360718},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.4653412103652954},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.455154150724411},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3821302056312561},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3778110146522522},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3501847982406616},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33899223804473877},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33163806796073914},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3288215100765228},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1462153.1462154","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1462153.1462154","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.7200000286102295,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G2022773221","display_name":null,"funder_award_id":"CCF-04-30946CCF-07-28736","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":80,"referenced_works":["https://openalex.org/W80790317","https://openalex.org/W94647076","https://openalex.org/W391578156","https://openalex.org/W1256121109","https://openalex.org/W1482647296","https://openalex.org/W1491036809","https://openalex.org/W1498910922","https://openalex.org/W1519444547","https://openalex.org/W1523572153","https://openalex.org/W1534808934","https://openalex.org/W1545759797","https://openalex.org/W1549364818","https://openalex.org/W1550331971","https://openalex.org/W1559984321","https://openalex.org/W1574151794","https://openalex.org/W1574901103","https://openalex.org/W1589224558","https://openalex.org/W1595179046","https://openalex.org/W1844369525","https://openalex.org/W1864873123","https://openalex.org/W1965399019","https://openalex.org/W1971947347","https://openalex.org/W1991624978","https://openalex.org/W1991813962","https://openalex.org/W2001255903","https://openalex.org/W2002089154","https://openalex.org/W2002326865","https://openalex.org/W2002644257","https://openalex.org/W2009570821","https://openalex.org/W2010994761","https://openalex.org/W2017108005","https://openalex.org/W2023206235","https://openalex.org/W2033260394","https://openalex.org/W2034441788","https://openalex.org/W2036758357","https://openalex.org/W2047206742","https://openalex.org/W2051271936","https://openalex.org/W2062573385","https://openalex.org/W2066194644","https://openalex.org/W2067754486","https://openalex.org/W2090963365","https://openalex.org/W2093080079","https://openalex.org/W2100440346","https://openalex.org/W2107771181","https://openalex.org/W2111041233","https://openalex.org/W2117685302","https://openalex.org/W2117805292","https://openalex.org/W2120349285","https://openalex.org/W2123852216","https://openalex.org/W2124091985","https://openalex.org/W2126544654","https://openalex.org/W2128978199","https://openalex.org/W2151033164","https://openalex.org/W2151549243","https://openalex.org/W2151670874","https://openalex.org/W2152923292","https://openalex.org/W2154602821","https://openalex.org/W2158487182","https://openalex.org/W2167246417","https://openalex.org/W2318517401","https://openalex.org/W2325649338","https://openalex.org/W2568511220","https://openalex.org/W2610857016","https://openalex.org/W2975330931","https://openalex.org/W2977679477","https://openalex.org/W3121437753","https://openalex.org/W3143684945","https://openalex.org/W4231137976","https://openalex.org/W4235035462","https://openalex.org/W4244638572","https://openalex.org/W4245668478","https://openalex.org/W4253707970","https://openalex.org/W4285719527","https://openalex.org/W4293860921","https://openalex.org/W4299637698","https://openalex.org/W4301168154","https://openalex.org/W6632842483","https://openalex.org/W6641409908","https://openalex.org/W6844068983","https://openalex.org/W6999079805"],"related_works":["https://openalex.org/W1489292980","https://openalex.org/W2951610245","https://openalex.org/W2795079910","https://openalex.org/W1430963189","https://openalex.org/W1974262772","https://openalex.org/W2049901819","https://openalex.org/W3037410748","https://openalex.org/W2052430123","https://openalex.org/W1983437306","https://openalex.org/W4387778523"],"abstract_inverted_index":{"We":[0,77,132,166,187,213,225,268,307],"define":[1],"Recursive":[2],"Markov":[3,12,30],"Chains":[4],"(RMCs),":[5],"a":[6,26,40,46,58,61,97,157,178,189,195,280],"class":[7],"of":[8,25,28,63,126,138,152,185,198,233,330,342],"finitely":[9],"presented":[10],"denumerable":[11],"chains,":[13],"and":[14,72,83,114,148,202,239,261,291,317,333],"we":[15],"study":[16],"algorithms":[17,80,228],"for":[18,50,81,86,181,229,237,242,253,327,339],"their":[19],"analysis.":[20],"Informally,":[21],"an":[22,93,292],"RMC":[23,94],"consists":[24],"collection":[27],"finite-state":[29],"chains":[31],"with":[32,53,130,156],"the":[33,90,135,141,149,154,182,210,245,257,287,301,314,319,335],"ability":[34],"to":[35,122,163,209,220,313,318,334],"invoke":[36],"each":[37],"other":[38],"in":[39,57,111,175,251,266],"potentially":[41],"recursive":[42,255],"manner.":[43],"RMCs":[44,256],"offer":[45],"natural":[47],"abstract":[48],"model":[49],"probabilistic":[51],"programs":[52],"procedures.":[54],"They":[55],"generalize,":[56],"precise":[59],"sense,":[60],"number":[62],"well-studied":[64],"stochastic":[65],"models,":[66],"including":[67],"Stochastic":[68],"Context-Free":[69],"Grammars":[70],"(SCFG)":[71],"Multi-Type":[73],"Branching":[74],"Processes":[75],"(MT-BP).":[76],"focus":[78],"on":[79,194,282,300],"reachability":[82],"termination":[84,328,340],"analysis":[85],"RMCs:":[87],"what":[88],"is":[89],"probability":[91],"that":[92,105,168,204,270,297,309],"started":[95],"from":[96],"given":[98,158],"state":[99],"reaches":[100],"another":[101],"target":[102],"state,":[103],"or":[104,146,160],"it":[106,205],"terminates?":[107],"These":[108],"probabilities":[109,142,155,258,329],"are":[110,143,259],"general":[112,331],"irrational,":[113],"they":[115],"arise":[116],"as":[117],"(least)":[118],"fixed":[119],"point":[120],"solutions":[121],"certain":[123],"(monotone)":[124],"systems":[125],"nonlinear":[127],"equations":[128],"associated":[129],"RMCs.":[131,234],"address":[133],"both":[134],"qualitative":[136,246,315],"problem":[137,247,290,296,316,321,338],"determining":[139],"whether":[140],"0,":[144],"1":[145],"in-between,":[147],"quantitative":[150,336],"problems":[151,171,311],"comparing":[153],"bound,":[159],"approximating":[161],"them":[162],"desired":[164,211],"precision.":[165],"show":[167,214,269,308],"all":[169],"these":[170,310],"can":[172,248,262],"be":[173,249,263,276],"solved":[174,250],"PSPACE":[176,272],"using":[177],"decision":[179,295,337],"procedure":[180],"Existential":[183],"Theory":[184],"Reals.":[186],"provide":[188],"more":[190,218],"practical":[191],"algorithm,":[192],"based":[193],"decomposed":[196],"version":[197],"multi-variate":[199],"Newton's":[200],"method,":[201],"prove":[203],"always":[206],"converges":[207],"monotonically":[208],"probabilities.":[212],"this":[215],"method":[216],"applies":[217],"generally":[219],"any":[221,324],"monotone":[222],"polynomial":[223],"system.":[224],"obtain":[226],"polynomial-time":[227],"various":[230],"special":[231],"subclasses":[232],"Among":[235],"these:":[236],"SCFGs":[238,343],"MT-BPs":[240],"(equivalently,":[241],"1-exit":[243],"RMCs)":[244],"P-time;":[252],"linearly":[254],"rational":[260,303],"computed":[264],"exactly":[265],"P-time.":[267],"our":[271],"upper":[273],"bounds":[274],"cannot":[275],"substantially":[277],"improved":[278],"without":[279],"breakthrough":[281],"long":[283],"standing":[284],"open":[285],"problems:":[286],"square-root":[288],"sum":[289],"arithmetic":[293,304],"circuit":[294],"captures":[298],"P-time":[299],"unit-cost":[302],"RAM":[305],"model.":[306],"reduce":[312],"approximation":[320],"(to":[322],"within":[323],"nontrivial":[325],"error)":[326],"RMCs,":[332],"(extinction)":[341],"(MT-BPs).":[344]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":39},{"year":2020,"cited_by_count":28},{"year":2019,"cited_by_count":27},{"year":2018,"cited_by_count":30},{"year":2017,"cited_by_count":29},{"year":2016,"cited_by_count":30},{"year":2015,"cited_by_count":36},{"year":2014,"cited_by_count":39},{"year":2013,"cited_by_count":53},{"year":2012,"cited_by_count":59}],"updated_date":"2026-06-27T08:28:00.272161","created_date":"2025-10-10T00:00:00"}