{"id":"https://openalex.org/W3034963086","doi":"https://doi.org/10.1137/19m1247632","title":"Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions","display_name":"Graph Sparsification, Spectral Sketches, and Faster Resistance Computation via Short Cycle Decompositions","publication_year":2020,"publication_date":"2020-06-09","ids":{"openalex":"https://openalex.org/W3034963086","doi":"https://doi.org/10.1137/19m1247632","mag":"3034963086"},"language":"en","primary_location":{"id":"doi:10.1137/19m1247632","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1247632","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5003427958","display_name":"Timothy Chu","orcid":"https://orcid.org/0000-0003-3822-3253"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Timothy Chu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076578170","display_name":"Yu Gao","orcid":"https://orcid.org/0000-0002-8535-3889"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yu Gao","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112534230","display_name":"Richard Peng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Richard Peng","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067464936","display_name":"Sushant Sachdeva","orcid":"https://orcid.org/0000-0002-5393-9324"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sushant Sachdeva","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074374806","display_name":"Saurabh Sawlani","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saurabh Sawlani","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5090423452","display_name":"Junxing Wang","orcid":"https://orcid.org/0000-0002-4381-1634"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Junxing Wang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5003427958"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8669,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.79290511,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"52","issue":"6","first_page":"FOCS18","last_page":"85"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"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.9962999820709229,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9959999918937683,"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.6774857044219971},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6003283858299255},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5054478645324707},{"id":"https://openalex.org/keywords/laplace-operator","display_name":"Laplace operator","score":0.46255746483802795},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4621039628982544},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4399656355381012},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.43496447801589966},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3603936433792114},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36000025272369385}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6774857044219971},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6003283858299255},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5054478645324707},{"id":"https://openalex.org/C165700671","wikidata":"https://www.wikidata.org/wiki/Q203484","display_name":"Laplace operator","level":2,"score":0.46255746483802795},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4621039628982544},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4399656355381012},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.43496447801589966},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3603936433792114},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36000025272369385},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/19m1247632","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1247632","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4422129589","display_name":null,"funder_award_id":"1637523","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6131769007","display_name":null,"funder_award_id":"1718533","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"},{"id":"https://openalex.org/F4320324245","display_name":"Connaught Fund","ror":"https://ror.org/03dbr7087"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W1558308955","https://openalex.org/W1601422707","https://openalex.org/W1800323139","https://openalex.org/W1916091028","https://openalex.org/W1976125024","https://openalex.org/W1983193888","https://openalex.org/W1993111701","https://openalex.org/W1997315949","https://openalex.org/W2002240881","https://openalex.org/W2002894241","https://openalex.org/W2009695707","https://openalex.org/W2017322423","https://openalex.org/W2051540665","https://openalex.org/W2063860324","https://openalex.org/W2066308383","https://openalex.org/W2067081844","https://openalex.org/W2099143789","https://openalex.org/W2102560346","https://openalex.org/W2106759055","https://openalex.org/W2107411554","https://openalex.org/W2107997203","https://openalex.org/W2129027292","https://openalex.org/W2129575457","https://openalex.org/W2169528477","https://openalex.org/W2176494464","https://openalex.org/W2265341574","https://openalex.org/W2278710066","https://openalex.org/W2547436936","https://openalex.org/W2552685338","https://openalex.org/W2570775423","https://openalex.org/W2571471359","https://openalex.org/W2594480752","https://openalex.org/W2748196059","https://openalex.org/W2768897923","https://openalex.org/W2778505201","https://openalex.org/W2903365982","https://openalex.org/W2949824190","https://openalex.org/W2950542405","https://openalex.org/W2952477043","https://openalex.org/W2962911929","https://openalex.org/W2963324223","https://openalex.org/W2963841171","https://openalex.org/W2963934882","https://openalex.org/W2964070071","https://openalex.org/W3098045837","https://openalex.org/W3127358834","https://openalex.org/W4235946010","https://openalex.org/W4250700905","https://openalex.org/W4252842032","https://openalex.org/W4255005259","https://openalex.org/W4294351786","https://openalex.org/W4390575860"],"related_works":["https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W4256429076","https://openalex.org/W2012063272","https://openalex.org/W2348092930","https://openalex.org/W2062850566","https://openalex.org/W4308716484","https://openalex.org/W2098284475","https://openalex.org/W2587900963","https://openalex.org/W2132864204"],"abstract_inverted_index":{"We":[0,74,119,177],"develop":[1],"a":[2,11,19,33,81,159,164,202,211],"framework":[3],"for":[4,79,154,210,316,346,353],"graph":[5,24,45,116,160,241,283],"sparsification":[6,336],"and":[7,68,90,97,128,189,225,243,326,333],"sketching,":[8],"based":[9],"on":[10,47,110,313],"new":[12],"tool,":[13],"short":[14,30,82,276,348,354],"cycle":[15,83,277,349,355],"decomposition,":[16,84],"which":[17],"is":[18,201,239,245,308],"decomposition":[20,102],"of":[21,29,36,61,87,100,134,143,158,166,181,252,268,289,302,329,343,363],"an":[22,26,76,121,152],"unweighted":[23],"into":[25,59],"edge-disjoint":[27],"collection":[28],"cycles,":[31],"plus":[32],"small":[34],"number":[35],"extra":[37,72,92],"edges.":[38,73,93],"A":[39,197],"simple":[40],"observation":[41],"shows":[42],"that":[43,123,209,260],"every":[44,266],"$G$":[46],"$n$":[48],"vertices":[49,269],"with":[50,85,185,234,255,279],"$m$":[51],"edges":[52,259],"can":[53],"be":[54],"decomposed":[55],"in":[56,114,125,149,169,282,320,361],"$O(mn)$":[57],"time":[58,126,325],"cycles":[60,86],"length":[62,88],"at":[63,69],"most":[64,70],"$2":[65],"\\log":[66],"n,$":[67],"$2n$":[71],"give":[75,191],"$(m^{1+o(1)})$-time":[77],"algorithm":[78,122,153],"constructing":[80,347],"$n^{o(1)},$":[89],"$n^{1+o(1)}$":[91],"Both":[94],"the":[95,107,139,156,179,240,250,262,287,341],"existential":[96],"algorithmic":[98],"variants":[99],"this":[101],"enable":[103],"us":[104],"to":[105,131,163,194,271,310,359],"make":[106],"following":[108],"progress":[109],"several":[111],"open":[112],"problems":[113],"randomized":[115],"algorithms:":[117],"(1)":[118],"present":[120],"runs":[124],"$m^{1+o(1)}\\varepsilon^{-1.5}$":[127],"returns":[129],"$(1\\pm\\varepsilon)$-approximations":[130],"effective":[132,263],"resistances":[133],"all":[135],"edges,":[136,188],"improving":[137],"over":[138,204],"previous":[140],"best":[141],"runtime":[142],"$\\widetilde{{O}}(\\min\\{m\\varepsilon^{-2},":[144],"n^{2}":[145],"\\varepsilon^{-1}\\})$.":[146],"This":[147,248],"routine":[148],"turn":[150],"gives":[151],"approximating":[155],"determinant":[157],"Laplacian":[161,242],"up":[162,270],"factor":[165],"$(1\\pm":[167],"\\varepsilon)$":[168],"$m^{1":[170],"+":[171,173],"o(1)}":[172],"n^{\\nicefrac{15}{8}+o(1)}\\varepsilon^{-\\nicefrac{7}{4}}$":[174],"time.":[175],"(2)":[176],"show":[178,286],"existence":[180,251,288],"graphical":[182,198],"spectral":[183,199,294,331],"sketches":[184],"about":[186,256],"$n\\varepsilon^{-1}$":[187],"also":[190],"efficient":[192],"algorithms":[193,315,337,352],"construct":[195],"them.":[196],"sketch":[200,332],"distribution":[203],"sparse":[205],"graphs":[206],"$H$":[207],"such":[208],"fixed":[212],"vector":[213],"${\\mathit{x}}$,":[214],"we":[215,285],"have":[216],"${{x}}^{\\top}":[217,226],"{L}_H":[218],"{{x}}":[219,228],"=":[220,229],"(1\\pm\\varepsilon)":[221,230],"{{x}}^{\\top}":[222,231],"{L}_G":[223],"{{x}}$":[224,233],"{L}^{+}_H":[227],"{L}^{+}_G":[232],"high":[235],"probability,":[236],"where":[237],"${L}$":[238],"${L}^{+}$":[244],"its":[246],"pseudoinverse.":[247],"implies":[249],"resistance":[253,264],"sparsifiers":[254],"$n":[257],"\\varepsilon^{-1}$":[258],"preserve":[261],"between":[265],"pair":[267],"$(1\\pm\\varepsilon)$.":[272],"(3)":[273],"By":[274],"combining":[275],"decompositions":[278,356],"known":[280],"tools":[281],"sparsification,":[284],"nearly":[290],"linear":[291,318],"sized":[292],"degree-preserving":[293,334],"sparsifiers,":[295],"as":[296,298],"well":[297],"significantly":[299],"sparser":[300],"approximations":[301],"Eulerian":[303],"directed":[304,321],"graphs.":[305],"The":[306,323],"latter":[307],"critical":[309],"recent":[311],"breakthroughs":[312],"faster":[314],"solving":[317],"systems":[319],"Laplacians.":[322],"running":[324],"output":[327],"qualities":[328],"our":[330,344],"(directed)":[335],"are":[338],"limited":[339],"by":[340],"efficiency":[342],"routines":[345],"decompositions.":[350],"Improved":[351],"will":[357],"lead":[358],"improvement":[360],"each":[362],"these":[364],"algorithms.":[365]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}