{"id":"https://openalex.org/W4390098144","doi":"https://doi.org/10.1109/focs57990.2023.00054","title":"Singular Value Approximation and Sparsifying Random Walks on Directed Graphs","display_name":"Singular Value Approximation and Sparsifying Random Walks on Directed Graphs","publication_year":2023,"publication_date":"2023-11-06","ids":{"openalex":"https://openalex.org/W4390098144","doi":"https://doi.org/10.1109/focs57990.2023.00054"},"language":"en","primary_location":{"id":"doi:10.1109/focs57990.2023.00054","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/focs57990.2023.00054","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)","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/A5004090246","display_name":"AmirMahdi Ahmadinejad","orcid":null},"institutions":[{"id":"https://openalex.org/I58610484","display_name":"Seattle University","ror":"https://ror.org/02jqc0m91","country_code":"US","type":"education","lineage":["https://openalex.org/I58610484"]},{"id":"https://openalex.org/I1311688040","display_name":"Amazon (United States)","ror":"https://ror.org/04mv4n011","country_code":"US","type":"company","lineage":["https://openalex.org/I1311688040"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"AmirMahdi Ahmadinejad","raw_affiliation_strings":["Amazon,Seattle,USA","Amazon, Seattle, USA"],"affiliations":[{"raw_affiliation_string":"Amazon,Seattle,USA","institution_ids":["https://openalex.org/I1311688040","https://openalex.org/I58610484"]},{"raw_affiliation_string":"Amazon, Seattle, USA","institution_ids":["https://openalex.org/I1311688040","https://openalex.org/I58610484"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058487388","display_name":"John Peebles","orcid":null},"institutions":[{"id":"https://openalex.org/I4210153776","display_name":"Apple (United States)","ror":"https://ror.org/059hsda18","country_code":"US","type":"company","lineage":["https://openalex.org/I4210153776"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Peebles","raw_affiliation_strings":["Apple,Cupertino,USA","Apple, Cupertino, USA"],"affiliations":[{"raw_affiliation_string":"Apple,Cupertino,USA","institution_ids":["https://openalex.org/I4210153776"]},{"raw_affiliation_string":"Apple, Cupertino, USA","institution_ids":["https://openalex.org/I4210153776"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091109854","display_name":"Edward Pyne","orcid":"https://orcid.org/0000-0002-3454-2057"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Edward Pyne","raw_affiliation_strings":["MIT,Cambridge,USA","MIT, Cambridge, USA"],"affiliations":[{"raw_affiliation_string":"MIT,Cambridge,USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge, USA","institution_ids":["https://openalex.org/I4210110987"]}]},{"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"]},{"id":"https://openalex.org/I1743320","display_name":"Palo Alto University","ror":"https://ror.org/04f812k67","country_code":"US","type":"education","lineage":["https://openalex.org/I1743320"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aaron Sidford","raw_affiliation_strings":["Stanford University,Palo Alto,USA","Stanford University, Palo Alto, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University,Palo Alto,USA","institution_ids":["https://openalex.org/I1743320","https://openalex.org/I97018004"]},{"raw_affiliation_string":"Stanford University, Palo Alto, USA","institution_ids":["https://openalex.org/I1743320","https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016656677","display_name":"Salil Vadhan","orcid":"https://orcid.org/0000-0002-4059-4072"},"institutions":[{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Salil Vadhan","raw_affiliation_strings":["Harvard University,Cambridge,USA","Harvard University, Cambridge, USA"],"affiliations":[{"raw_affiliation_string":"Harvard University,Cambridge,USA","institution_ids":["https://openalex.org/I2801851002"]},{"raw_affiliation_string":"Harvard University, Cambridge, USA","institution_ids":["https://openalex.org/I2801851002"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5004090246"],"corresponding_institution_ids":["https://openalex.org/I1311688040","https://openalex.org/I58610484"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19106424,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"abs/1502.03496","issue":null,"first_page":"846","last_page":"854"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11716","display_name":"Random Matrices and Applications","score":0.9994999766349792,"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/T11716","display_name":"Random Matrices and Applications","score":0.9994999766349792,"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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9933000206947327,"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/T11476","display_name":"Graph theory and applications","score":0.9894999861717224,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6461122632026672},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.602146565914154},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.5925706028938293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.549734354019165},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.49616894125938416},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4885159730911255},{"id":"https://openalex.org/keywords/random-walk","display_name":"Random walk","score":0.4694760739803314},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4277046024799347},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24438518285751343},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.12463852763175964}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6461122632026672},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.602146565914154},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5925706028938293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.549734354019165},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.49616894125938416},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4885159730911255},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.4694760739803314},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4277046024799347},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24438518285751343},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.12463852763175964},{"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.1109/focs57990.2023.00054","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/focs57990.2023.00054","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320307764","display_name":"Microsoft","ror":"https://ror.org/00d0nc645"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1488557728","https://openalex.org/W1551005442","https://openalex.org/W1601422707","https://openalex.org/W1676380800","https://openalex.org/W1993111701","https://openalex.org/W2009281933","https://openalex.org/W2011438986","https://openalex.org/W2034331023","https://openalex.org/W2045107949","https://openalex.org/W2049516232","https://openalex.org/W2067081844","https://openalex.org/W2086254934","https://openalex.org/W2089703809","https://openalex.org/W2109176946","https://openalex.org/W2125664420","https://openalex.org/W2129027292","https://openalex.org/W2131115830","https://openalex.org/W2153441719","https://openalex.org/W2278710066","https://openalex.org/W2547436936","https://openalex.org/W2608846391","https://openalex.org/W2807192154","https://openalex.org/W2888277944","https://openalex.org/W2895053471","https://openalex.org/W2964070071","https://openalex.org/W2978378153","https://openalex.org/W3126958641","https://openalex.org/W3167705025","https://openalex.org/W3186546642","https://openalex.org/W3214807791","https://openalex.org/W4205550388","https://openalex.org/W4313227248","https://openalex.org/W6637172029","https://openalex.org/W6774526091","https://openalex.org/W6783513695","https://openalex.org/W6798338679","https://openalex.org/W6842153182","https://openalex.org/W6891672003"],"related_works":["https://openalex.org/W4244867043","https://openalex.org/W2110817230","https://openalex.org/W3091355678","https://openalex.org/W1606488336","https://openalex.org/W1988569331","https://openalex.org/W189995875","https://openalex.org/W4255193494","https://openalex.org/W2284958355","https://openalex.org/W2962894463","https://openalex.org/W4301487118"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,15,139,184],"introduce":[4],"a":[5,89,134,158,178,186,200],"new,":[6],"spectral":[7,28,35,210],"notion":[8],"of":[9,27,37,73,81,121,137,146,161,169,209],"approximation":[10,29,36,44,54,63],"between":[11],"directed":[12,46,56,99,131,193],"graphs,":[13,100,109],"which":[14],"call":[16],"singular":[17],"value":[18],"(SV)":[19],"approximation.":[20,211],"SV-approximation":[21],"is":[22,77],"stronger":[23],"than":[24],"previous":[25,71,207],"notions":[26,72,208],"considered":[30],"in":[31,151,173],"the":[32,117,142,147],"literature,":[33],"including":[34],"Laplacians":[38],"for":[39,45,55,93,110,181,206],"undirected":[40,197],"graphs":[41,47,57,194],"[ST04],":[42],"standard":[43],"[CKP<sup":[48],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[49,59,123],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">+</sup>17],":[50],"and":[51,84,133,165],"unit-circle":[52],"(UC)":[53],"[AKM<sup":[58],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">+</sup>20].":[60],"Further,":[61],"SV":[62],"enjoys":[64],"several":[65],"useful":[66],"properties":[67],"not":[68,204],"possessed":[69],"by":[70],"approximation,":[74],"e.g.,":[75],"it":[76],"preserved":[78],"under":[79],"products":[80],"randomwalk":[82],"matrices":[83],"bounded":[85],"matrices.":[86],"We":[87],"provide":[88,185],"nearly":[90,174],"linear-time":[91],"algorithm":[92],"SV-sparsifying":[94,191,196],"(and":[95],"hence":[96],"UC-sparsifying)":[97],"Eulerian":[98,118,192],"as":[101,103],"well":[102],"$\\ell$-step":[104,153],"random":[105,154],"walks":[106],"on":[107],"such":[108,199],"any":[111],"$\\ell":[112],"\\leq":[113],"\\operatorname{poly}(n)$.":[114],"Combined":[115],"with":[116],"scaling":[119],"algorithms":[120],"[CKK<sup":[122],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">+</sup>18],":[124],"given":[125],"an":[126,152,166],"arbitrary":[127],"(not":[128],"necessarily":[129],"Eulerian)":[130],"graph":[132],"set":[135],"S":[136],"vertices,":[138],"can":[140],"approximate":[141],"stationary":[143],"probability":[144],"mass":[145],"$\\left(S,":[148],"S^{c}\\right)$":[149],"cut":[150],"walk":[155],"to":[156,195],"within":[157],"multiplicative":[159],"error":[160,168],"$1":[162,170],"/":[163,171],"\\operatorname{polylog}(n)$":[164],"additive":[167],"\\operatorname{poly}(n)$":[172],"linear":[175],"time.":[176],"As":[177],"starting":[179],"point":[180],"these":[182],"results,":[183],"simple":[187],"black-box":[188],"reduction":[189,202],"from":[190],"graphs;":[198],"directed-to-undirected":[201],"was":[203],"known":[205]},"counts_by_year":[],"updated_date":"2025-12-25T23:11:45.687758","created_date":"2025-10-10T00:00:00"}