{"id":"https://openalex.org/W2978378153","doi":"https://doi.org/10.4086/toc.2021.v017a004","title":"","display_name":"","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W2978378153","doi":"https://doi.org/10.4086/toc.2021.v017a004","mag":"2978378153"},"language":"en","primary_location":{"id":"doi:10.4086/toc.2021.v017a004","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2021.v017a004","pdf_url":"http://www.theoryofcomputing.org/articles/v017a004/v017a004.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://www.theoryofcomputing.org/articles/v017a004/v017a004.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087016057","display_name":"Jack Murtagh","orcid":"https://orcid.org/0009-0005-7515-1879"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jack Murtagh","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086367709","display_name":"Omer Reingold","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Omer Reingold","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086787265","display_name":"Aaron Sidford","orcid":"https://orcid.org/0000-0003-2675-7610"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aaron Sidford","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5016656677","display_name":"Salil Vadhan","orcid":"https://orcid.org/0000-0002-4059-4072"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Salil Vadhan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5087016057"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.473,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.63812288,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"17","issue":"1","first_page":"1","last_page":"35"},"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.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"}},"topics":[{"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9968000054359436,"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/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9962000250816345,"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/mathematics","display_name":"Mathematics","score":0.7880558967590332},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6510670185089111},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.639965295791626},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5590100288391113},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5313789248466492},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5242048501968384},{"id":"https://openalex.org/keywords/laplace-operator","display_name":"Laplace operator","score":0.5159850716590881},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4990224838256836},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.4776524305343628},{"id":"https://openalex.org/keywords/expander-graph","display_name":"Expander graph","score":0.46593135595321655},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46085232496261597},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3545524477958679}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7880558967590332},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6510670185089111},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.639965295791626},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5590100288391113},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5313789248466492},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5242048501968384},{"id":"https://openalex.org/C165700671","wikidata":"https://www.wikidata.org/wiki/Q203484","display_name":"Laplace operator","level":2,"score":0.5159850716590881},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4990224838256836},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.4776524305343628},{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.46593135595321655},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46085232496261597},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3545524477958679},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4086/toc.2021.v017a004","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2021.v017a004","pdf_url":"http://www.theoryofcomputing.org/articles/v017a004/v017a004.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.4086/toc.2021.v017a004","is_oa":true,"landing_page_url":"https://doi.org/10.4086/toc.2021.v017a004","pdf_url":"http://www.theoryofcomputing.org/articles/v017a004/v017a004.pdf","source":{"id":"https://openalex.org/S142665794","display_name":"Theory of Computing","issn_l":"1557-2862","issn":["1557-2862"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310315690","host_organization_name":"University of Chicago","host_organization_lineage":["https://openalex.org/P4310315690"],"host_organization_lineage_names":["University of Chicago"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory of Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1724386851","display_name":"AF: Medium: Collaborative Research: Exploiting Opportunities in Pseudorandomness","funder_award_id":"1763311","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2893785016","display_name":"CAREER: Theory of Fast Graph Optimization","funder_award_id":"1844855","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3252592884","display_name":null,"funder_award_id":"CCF-1763299","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3806200841","display_name":"AF: Medium: Collaborative Research:  Exploiting Opportunities in Pseudorandomness","funder_award_id":"1763299","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5727344453","display_name":null,"funder_award_id":"CCF-1844855","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","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"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2978378153.pdf","grobid_xml":"https://content.openalex.org/works/W2978378153.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W808988294","https://openalex.org/W1488557728","https://openalex.org/W1527197079","https://openalex.org/W1540485574","https://openalex.org/W1551005442","https://openalex.org/W1631603072","https://openalex.org/W1676380800","https://openalex.org/W1714536202","https://openalex.org/W1993111701","https://openalex.org/W1997315949","https://openalex.org/W2003519998","https://openalex.org/W2010386444","https://openalex.org/W2011438986","https://openalex.org/W2019807548","https://openalex.org/W2045107949","https://openalex.org/W2045377861","https://openalex.org/W2048958388","https://openalex.org/W2049516232","https://openalex.org/W2099601775","https://openalex.org/W2121284046","https://openalex.org/W2129027292","https://openalex.org/W2129575457","https://openalex.org/W2132890668","https://openalex.org/W2141149699","https://openalex.org/W2156184725","https://openalex.org/W2163137752","https://openalex.org/W2395271957","https://openalex.org/W2547436936","https://openalex.org/W2591750614","https://openalex.org/W2934534750","https://openalex.org/W2950542405","https://openalex.org/W2953026212","https://openalex.org/W2963872281","https://openalex.org/W2964070071","https://openalex.org/W3014638838","https://openalex.org/W3103475671","https://openalex.org/W3126958641","https://openalex.org/W3127684563","https://openalex.org/W4226347946","https://openalex.org/W4229706427","https://openalex.org/W4252948584"],"related_works":["https://openalex.org/W2174440985","https://openalex.org/W2112526268","https://openalex.org/W1964089073","https://openalex.org/W2011643166","https://openalex.org/W4243213822","https://openalex.org/W4388968519","https://openalex.org/W2005018956","https://openalex.org/W4293997817","https://openalex.org/W2244037217","https://openalex.org/W2978378153"],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,13,18,37],"deterministic,":[3],"nearly":[4],"logarithmic-space":[5],"algorithm":[6,54],"that":[7],"given":[8],"an":[9,47,56],"undirected":[10],"multigraph":[11],"G,":[12],"positive":[14],"integer":[15],"r,":[16],"and":[17],"set":[19],"S":[20,27],"of":[21,26,39,63],"vertices,":[22],"approximates":[23],"the":[24,29,60,64],"conductance":[25],"in":[28],"r-step":[30,65],"random":[31],"walk":[32],"on":[33],"G":[34],"to":[35,59],"within":[36],"factor":[38],"1":[40],"+":[41],",":[42],"where":[43],">":[44],"0":[45],"is":[46],"arbitrarily":[48],"small":[49],"constant.":[50],"More":[51],"generally,":[52],"our":[53],"computes":[55],"-spectral":[57],"approximation":[58],"normalized":[61],"Laplacian":[62],"walk.":[66]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2019-10-10T00:00:00"}