{"id":"https://openalex.org/W3115083469","doi":"https://doi.org/10.1145/3593809","title":"Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers","display_name":"Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers","publication_year":2024,"publication_date":"2024-02-03","ids":{"openalex":"https://openalex.org/W3115083469","doi":"https://doi.org/10.1145/3593809","mag":"3115083469"},"language":"en","primary_location":{"id":"doi:10.1145/3593809","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3593809","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3593809","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3593809","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050732684","display_name":"Arun Jambulapati","orcid":"https://orcid.org/0009-0007-9964-893X"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Arun Jambulapati","raw_affiliation_strings":["University of Washington","University of Washington, USA"],"raw_orcid":"https://orcid.org/0009-0007-9964-893X","affiliations":[{"raw_affiliation_string":"University of Washington","institution_ids":["https://openalex.org/I201448701"]},{"raw_affiliation_string":"University of Washington, USA","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"last","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","Stanford University, USA"],"raw_orcid":"https://orcid.org/0000-0003-2675-7610","affiliations":[{"raw_affiliation_string":"Stanford University","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050732684"],"corresponding_institution_ids":["https://openalex.org/I201448701"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.00313811,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"21","issue":"3","first_page":"1","last_page":"49"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9994999766349792,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9994999766349792,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9991000294685364,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9954000115394592,"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/computer-science","display_name":"Computer science","score":0.49467727541923523}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49467727541923523}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3593809","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3593809","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3593809","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3593809","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3593809","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3593809","source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"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/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":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3115083469.pdf","grobid_xml":"https://content.openalex.org/works/W3115083469.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1531368347","https://openalex.org/W1593361707","https://openalex.org/W1981859328","https://openalex.org/W1991838331","https://openalex.org/W2043093325","https://openalex.org/W2058292646","https://openalex.org/W2092534058","https://openalex.org/W2099143789","https://openalex.org/W2106759055","https://openalex.org/W2124768887","https://openalex.org/W2151748243","https://openalex.org/W2169871260","https://openalex.org/W2208409594","https://openalex.org/W2547436936","https://openalex.org/W2561675875","https://openalex.org/W2624960300","https://openalex.org/W2903365982","https://openalex.org/W2936995161","https://openalex.org/W2963324223","https://openalex.org/W2963541115","https://openalex.org/W2963915537","https://openalex.org/W2964070071","https://openalex.org/W3016564237","https://openalex.org/W3034415339","https://openalex.org/W3143204987","https://openalex.org/W4298844065"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W2350741829","https://openalex.org/W2530322880","https://openalex.org/W1596801655"],"abstract_inverted_index":{"In":[0],"this":[1,54,75,127,191],"article,":[2],"we":[3,56,77,155],"provide":[4,57],"an":[5,102],"O":[6,10,108,167],"(":[7,109,168],"m":[8,24],"loglog":[9],"(1)":[11],"n":[12,22,41,163,184,204],"log":[13],"(1/\u03b5))-expected":[14],"time":[15],"algorithm":[16],"for":[17,74,80,146,178,186,197],"solving":[18],"Laplacian":[19],"systems":[20],"on":[21],"-node":[23],"-edge":[25],"graphs,":[26],"improving":[27],"upon":[28,129,193],"the":[29,130,147,152,194],"previous":[30,131,195],"best":[31,132],"expected":[32],"runtime":[33],"of":[34,60,83,114,136,172],"\\(O(m":[35],"\\sqrt":[36],"{\\log":[37],"n}":[38],"\\mathrm{log":[39],"log}^{O(1)}":[40],"\\log":[42],"(1/\\epsilon))\\)":[43],"achieved":[44],"by":[45,92],"Cohen":[46],"et":[47],"al.":[48],"[":[49],"12":[50],"].":[51],"To":[52],"obtain":[53,162],"result,":[55],"efficient":[58],"constructions":[59],"low":[61],"spectral":[62],"stretch":[63,68],"graph":[64,148,153],"approximations":[65],"with":[66,104],"improved":[67],"and":[69,94],"sparsity":[70],"bounds.":[71],"As":[72],"motivation":[73],"work,":[76],"show":[78],"that,":[79],"every":[81],"set":[82],"vectors":[84,113],"in":[85,151],"\\(\\mathbb":[86],"{R}^d\\)":[87],"(not":[88],"just":[89],"those":[90],"induced":[91],"graphs)":[93],"all":[95],"integer":[96],"k":[97,120,125,176,179,198],"&gt;":[98,189],"1,":[99],"there":[100],"exist":[101],"ultra-sparsifier":[103],"d":[105],"-1":[106],"+":[107,166],"d/k":[110],")":[111,185],"re-weighted":[112],"relative":[115,173],"condition":[116,174],"number":[117,175],"at":[118],"most":[119],"2":[121],".":[122],"For":[123],"small":[124],",":[126,141],"improves":[128,192],"known":[133,145],"multiplicative":[134],"factor":[135],"\\(k":[137],"\\cdot":[138],"\\tilde{O}(\\log":[139],"d)\\)":[140],"which":[142],"is":[143],"only":[144],"case.":[149],"Additionally,":[150],"case,":[154],"employ":[156],"our":[157],"low-stretch":[158],"subgraph":[159],"construction":[160],"to":[161],"-":[164],"1":[165],"n/k":[169],")-edge":[170],"ultrasparsifiers":[171],"1+o(1)":[177],"=":[180,199],"\u03c9":[181],"(log":[182,202],"\u03b4":[183,188],"any":[187],"0:":[190],"work":[196],"o":[200],"(exp":[201],"1/2-\u03b4":[203],")).":[205]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}
