{"id":"https://openalex.org/W2145089782","doi":"https://doi.org/10.1145/1536414.1536491","title":"Random walks on polytopes and an affine interior point method for linear programming","display_name":"Random walks on polytopes and an affine interior point method for linear programming","publication_year":2009,"publication_date":"2009-05-31","ids":{"openalex":"https://openalex.org/W2145089782","doi":"https://doi.org/10.1145/1536414.1536491","mag":"2145089782"},"language":"en","primary_location":{"id":"doi:10.1145/1536414.1536491","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536491","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM symposium on Theory of computing","raw_type":"proceedings-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/A5059436381","display_name":"Ravi Kannan","orcid":null},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]},{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["IN","US"],"is_corresponding":true,"raw_author_name":"Ravi Kannan","raw_affiliation_strings":["Microsoft Research, Bangalore, India","Microsoft Research, Bangalore, India#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Bangalore, India","institution_ids":["https://openalex.org/I4210124949"]},{"raw_affiliation_string":"Microsoft Research, Bangalore, India#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029536777","display_name":"Hariharan Narayanan","orcid":"https://orcid.org/0000-0003-0568-7350"},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hariharan Narayanan","raw_affiliation_strings":["Department of Computer Science, Unversity of Chicago, Chicago, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Unversity of Chicago, Chicago, USA","institution_ids":["https://openalex.org/I40347166"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059436381"],"corresponding_institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"],"apc_list":null,"apc_paid":null,"fwci":1.4134,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.8375647,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"561","last_page":"570"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9998999834060669,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9983999729156494,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9961000084877014,"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/combinatorics","display_name":"Combinatorics","score":0.7531219124794006},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.7240813970565796},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.7130908370018005},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7094795107841492},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.6696142554283142},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.6671817302703857},{"id":"https://openalex.org/keywords/infimum-and-supremum","display_name":"Infimum and supremum","score":0.520095944404602},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48298871517181396},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.46471890807151794},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45256948471069336},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4188735783100128},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4175282120704651},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2285732924938202},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.14026764035224915},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.12627780437469482},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07078030705451965}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7531219124794006},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.7240813970565796},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.7130908370018005},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7094795107841492},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6696142554283142},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.6671817302703857},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.520095944404602},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48298871517181396},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.46471890807151794},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45256948471069336},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4188735783100128},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4175282120704651},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2285732924938202},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.14026764035224915},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12627780437469482},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07078030705451965}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1536414.1536491","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536491","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM symposium on Theory of computing","raw_type":"proceedings-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/W1508384000","https://openalex.org/W1573820523","https://openalex.org/W1632601927","https://openalex.org/W1973117121","https://openalex.org/W1973342538","https://openalex.org/W1980621453","https://openalex.org/W1980869082","https://openalex.org/W1986728528","https://openalex.org/W1993982015","https://openalex.org/W1996999318","https://openalex.org/W2041990574","https://openalex.org/W2061300678","https://openalex.org/W2063342497","https://openalex.org/W2063986634","https://openalex.org/W2076658620","https://openalex.org/W2079586969","https://openalex.org/W2088515005","https://openalex.org/W2107808918","https://openalex.org/W2117065890","https://openalex.org/W2137520161","https://openalex.org/W2159000620","https://openalex.org/W2611147814","https://openalex.org/W3023788998","https://openalex.org/W4251295118"],"related_works":["https://openalex.org/W2953175190","https://openalex.org/W4288318511","https://openalex.org/W2257286100","https://openalex.org/W2099602951","https://openalex.org/W2784344684","https://openalex.org/W2562705109","https://openalex.org/W2098184873","https://openalex.org/W4283118620","https://openalex.org/W2012159417","https://openalex.org/W3033742928"],"abstract_inverted_index":{"Let":[0],"K":[1],"be":[2],"a":[3,14,21,36,46,111,131,173,193],"polytope":[4],"in":[5],"Rn":[6],"defined":[7],"by":[8,208],"m":[9,153],"linear":[10,117],"inequalities.":[11],"We":[12,98],"give":[13],"new":[15],"Markov":[16,29],"Chain":[17,30],"algorithm":[18,108,191,206],"to":[19,34,82,102,115],"draw":[20],"nearly":[22],"uniform":[23],"sample":[24],"from":[25,45,76],"K.":[26],"The":[27,187],"underlying":[28],"is":[31,40,52,66,80,151,171,196,199],"the":[32,53,71,77,95,168,202],"first":[33],"have":[35],"mixing":[37],"time":[38],"that":[39,109,135,189,195],"strongly":[41],"polynomial":[42,198,213],"when":[43],"started":[44],"\"central\"":[47],"point":[48,107,132,174],"x0.":[49],"If":[50],"s":[51],"supremum":[54],"over":[55],"all":[56],"chords":[57],"pq":[58],"passing":[59],"through":[60],"x0":[61],"of":[62,94],"(|p-x0|)/(|q-x0|)":[63],"and":[64,140],"\u03b5":[65],"an":[67,104,152],"upper":[68],"bound":[69],"on":[70],"desired":[72],"total":[73],"variation":[74],"distance":[75],"uniform,":[78],"it":[79],"sufficient":[81],"take":[83],"O(m":[84],"n(":[85],"n":[86,155],"log":[87,91],"(s":[88],"m)":[89],"+":[90,147,164],"1/\u03b5))":[92],"steps":[93],"random":[96,113,169],"walk.":[97],"use":[99],"this":[100,190],"result":[101],"design":[103],"affine":[105,205],"interior":[106],"does":[110],"single":[112],"walk":[114,170],"solve":[116],"programs":[118],"approximately.":[119],"More":[120],"precisely,":[121],"suppose":[122],"Q":[123,145],"=":[124,160],"{z":[125],"|":[126],"Bz":[127],"\u2264":[128],"1}":[129],"contains":[130],"z":[133,137],"such":[134],"cT":[136,178],"\u2265":[138,180],"d":[139],"r":[141],":=":[142],"supz":[143],"\u2208":[144],"|Bz|":[146],"1,":[148],"where":[149],"B":[150],"x":[154],"matrix.":[156],"Then,":[157],"after":[158],"\u03c4":[159],"O(mn":[161],"(n":[162],"ln(mr/\u03b5)":[163],"ln":[165],"1/\u03b4))":[166],"steps,":[167],"at":[172],"x\u03c4":[175,179],"for":[176],"which":[177],"d(1-\u03b5)":[181],"with":[182],"probability":[183],"greater":[184],"than":[185],"1-\u03b4.":[186],"fact":[188],"has":[192,210],"run-time":[194],"provably":[197],"notable":[200],"since":[201],"analogous":[203],"deterministic":[204],"analyzed":[207],"Dikin":[209],"no":[211],"known":[212],"guarantees.":[214]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"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":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}