{"id":"https://openalex.org/W2547436936","doi":"https://doi.org/10.1145/3055399.3055463","title":"Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs","display_name":"Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs","publication_year":2017,"publication_date":"2017-06-15","ids":{"openalex":"https://openalex.org/W2547436936","doi":"https://doi.org/10.1145/3055399.3055463","mag":"2547436936"},"language":"en","primary_location":{"id":"doi:10.1145/3055399.3055463","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3055399.3055463","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3055463&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th 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":"http://dl.acm.org/ft_gateway.cfm?id=3055463&type=pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059735243","display_name":"Michael B. Cohen","orcid":"https://orcid.org/0000-0002-7388-6936"},"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":"Michael B. Cohen","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022068777","display_name":"Jonathan A. Kelner","orcid":null},"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":false,"raw_author_name":"Jonathan Kelner","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058487388","display_name":"John Peebles","orcid":null},"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":false,"raw_author_name":"John Peebles","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112534230","display_name":"Richard Peng","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Richard Peng","raw_affiliation_strings":["Georgia Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034026499","display_name":"Anup Rao","orcid":"https://orcid.org/0009-0004-7226-7860"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anup B. Rao","raw_affiliation_strings":["Georgia Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086787265","display_name":"Aaron Sidford","orcid":"https://orcid.org/0000-0003-2675-7610"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aaron Sidford","raw_affiliation_strings":["Stanford University, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091392485","display_name":"Adrian Vladu","orcid":"https://orcid.org/0009-0006-1169-3158"},"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":false,"raw_author_name":"Adrian Vladu","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":7,"corresponding_author_ids":["https://openalex.org/A5059735243"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":12.6849,"has_fulltext":true,"cited_by_count":60,"citation_normalized_percentile":{"value":0.99336821,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"410","last_page":"419"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9991999864578247,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9984999895095825,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.7154818177223206},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.6308490037918091},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5652865171432495},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5252261161804199},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.49915122985839844},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45264437794685364},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43943724036216736},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4359528720378876},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42914339900016785},{"id":"https://openalex.org/keywords/spectral-gap","display_name":"Spectral gap","score":0.42651915550231934},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.4138185679912567},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.41166001558303833},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40917885303497314},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37226247787475586},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.29764360189437866},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1897767186164856},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.18344402313232422},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.17550092935562134}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.7154818177223206},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.6308490037918091},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5652865171432495},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5252261161804199},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.49915122985839844},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45264437794685364},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43943724036216736},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4359528720378876},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42914339900016785},{"id":"https://openalex.org/C2778114796","wikidata":"https://www.wikidata.org/wiki/Q7575194","display_name":"Spectral gap","level":2,"score":0.42651915550231934},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.4138185679912567},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.41166001558303833},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40917885303497314},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37226247787475586},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29764360189437866},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1897767186164856},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.18344402313232422},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.17550092935562134},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3055399.3055463","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3055399.3055463","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3055463&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/115991","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/115991","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-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"doi:10.1145/3055399.3055463","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3055399.3055463","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3055463&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1486682830","display_name":null,"funder_award_id":"1111109,1553428,1122374,1637566,1065125","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1739214","display_name":null,"funder_award_id":"1065125","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3329116365","display_name":"CAREER: Fast Graph Algorithms and Continuous Optimization","funder_award_id":"1553428","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3526151021","display_name":null,"funder_award_id":"1122374","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5635854791","display_name":null,"funder_award_id":"112237","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5640471567","display_name":null,"funder_award_id":"1637566","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5996581877","display_name":null,"funder_award_id":"1111109","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7297461854","display_name":null,"funder_award_id":"122374","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8926491534","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320333566","funder_display_name":"National Defense Science and Engineering Graduate"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320333566","display_name":"National Defense Science and Engineering Graduate","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2547436936.pdf","grobid_xml":"https://content.openalex.org/works/W2547436936.grobid-xml"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W755406177","https://openalex.org/W1506342804","https://openalex.org/W1514324734","https://openalex.org/W1550304976","https://openalex.org/W1558308955","https://openalex.org/W1800323139","https://openalex.org/W1842952013","https://openalex.org/W1916091028","https://openalex.org/W1964510837","https://openalex.org/W1979505770","https://openalex.org/W1983193888","https://openalex.org/W1997315949","https://openalex.org/W2019040312","https://openalex.org/W2051540665","https://openalex.org/W2054579824","https://openalex.org/W2058706632","https://openalex.org/W2067081844","https://openalex.org/W2068888615","https://openalex.org/W2069992656","https://openalex.org/W2081750247","https://openalex.org/W2084990336","https://openalex.org/W2102560346","https://openalex.org/W2107499877","https://openalex.org/W2129027292","https://openalex.org/W2129575457","https://openalex.org/W2133352257","https://openalex.org/W2149841335","https://openalex.org/W2164853353","https://openalex.org/W2238928839","https://openalex.org/W2295766446","https://openalex.org/W2319135850","https://openalex.org/W2345496427","https://openalex.org/W2375314448","https://openalex.org/W2949556662","https://openalex.org/W2952965188","https://openalex.org/W2963541115","https://openalex.org/W2963751092","https://openalex.org/W2964070071","https://openalex.org/W3104306072"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W1998712144","https://openalex.org/W2106828717","https://openalex.org/W4300165677","https://openalex.org/W4297817344","https://openalex.org/W4287028074","https://openalex.org/W3191289342","https://openalex.org/W4322810890","https://openalex.org/W3196191381","https://openalex.org/W1036516582"],"abstract_inverted_index":{"In":[0,48],"this":[1,62,77],"paper,":[2],"we":[3,50,81,100],"begin":[4],"to":[5,69,144],"address":[6],"the":[7,33,83,93,107,130,154,159,163,175,180,188],"longstanding":[8],"algorithmic":[9],"gap":[10],"between":[11],"general":[12],"and":[13,36,66,122,177,198],"reversible":[14],"Markov":[15,112],"chains.":[16],"We":[17,183],"develop":[18],"directed":[19,44,57,86,120,194,216],"analogues":[20],"of":[21,54,79,96,110,135,156,165,212],"several":[22],"spectral":[23,195],"graph-theoretic":[24],"tools":[25],"that":[26,43,199],"had":[27],"previously":[28],"been":[29],"available":[30],"only":[31],"in":[32,72,118,158],"undirected":[34],"setting,":[35],"for":[37,56,105,190,207,215],"which":[38],"it":[39],"was":[40],"not":[41],"clear":[42],"versions":[45],"even":[46],"existed.":[47],"particular,":[49],"provide":[51],"a":[52,111,119,169,204,209],"notion":[53,63,78],"approximation":[55],"graphs,":[58],"prove":[59],"sparsifiers":[60],"under":[61],"always":[64],"exist,":[65],"show":[67],"how":[68],"construct":[70],"them":[71],"almost":[73],"linear":[74],"time.":[75],"Using":[76],"approximation,":[80],"design":[82],"first":[84],"almost-linear-time":[85,103],"Laplacian":[87],"system":[88],"solver,":[89],"and,":[90],"by":[91],"leveraging":[92],"recent":[94],"framework":[95],"[Cohen-Kelner-Peebles-Peng-Sidford-Vladu,":[97],"FOCS":[98],"'16],":[99],"also":[101],"obtain":[102],"algorithms":[104,128,214],"computing":[106,114],"stationary":[108],"distribution":[109],"chain,":[113],"expected":[115],"commute":[116],"times":[117,134],"graph,":[121,160],"more.":[123],"For":[124],"each":[125],"problem,":[126,176],"our":[127],"improve":[129],"previous":[131],"best":[132],"running":[133],"O((nm3/4":[136],"+":[137,146],"n2/3":[138],"m)":[139],"logO(1)":[140,148],"(n":[141,149],"\u03ba":[142,167],"\u03b5-1))":[143],"O((m":[145],"n2O(\u221alognloglogn))":[147],"\u03ba\u03b5-1))":[150],"where":[151],"n":[152],"is":[153,162,168,179],"number":[155,164,172],"vertices":[157],"m":[161],"edges,":[166],"natural":[170],"condition":[171],"associated":[173],"with":[174],"\u03b5":[178],"desired":[181],"accuracy.":[182],"hope":[184],"these":[185],"results":[186],"open":[187],"door":[189],"further":[191],"studies":[192],"into":[193],"graph":[196],"theory,":[197],"they":[200],"will":[201],"serve":[202],"as":[203],"stepping":[205],"stone":[206],"designing":[208],"new":[210],"generation":[211],"fast":[213],"graphs.":[217]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}