{"id":"https://openalex.org/W7171634129","doi":"https://doi.org/10.48550/arxiv.2607.25059","title":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","display_name":"Parallel Spectral Graph Sparsification via Low Diameter Decompositions","publication_year":2026,"publication_date":"2026-07-27","ids":{"openalex":"https://openalex.org/W7171634129","doi":"https://doi.org/10.48550/arxiv.2607.25059"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.25059","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.25059","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.25059","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5143980317","display_name":"Yves Baumann","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Baumann, Yves","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5143963905","display_name":"Gernot Z\u00f6cklein","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Z\u00f6cklein, Gernot","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.33000001311302185,"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.33000001311302185,"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.3249000012874603,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.17630000412464142,"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/complement","display_name":"Complement (music)","score":0.6347000002861023},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4869000017642975},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46880000829696655},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4253999888896942},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41519999504089355},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.3831999897956848},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3619000017642975},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.35749998688697815}],"concepts":[{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.6347000002861023},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5863999724388123},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.527899980545044},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4869000017642975},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46880000829696655},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4253999888896942},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41519999504089355},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.3831999897956848},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3637999892234802},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3619000017642975},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.35749998688697815},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3427000045776367},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32589998841285706},{"id":"https://openalex.org/C13251829","wikidata":"https://www.wikidata.org/wiki/Q3085841","display_name":"Dense graph","level":5,"score":0.31679999828338623},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.31610000133514404},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.30869999527931213},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.295199990272522},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.2766000032424927},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.27630001306533813},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2685000002384186},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2590000033378601},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.2558000087738037},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.2524000108242035}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.25059","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.25059","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.25059","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.25059","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,79,182],"present":[1],"a":[2,43,121,136],"new":[3],"solver-free":[4,30],"parallel":[5,16,31],"spectral":[6],"sparsification":[7,32],"algorithm":[8,62],"for":[9,38,42,163,180],"weighted":[10],"graphs":[11,99,196],"that":[12],"relies":[13],"only":[14],"on":[15,49,149],"low-diameter":[17],"decompositions":[18],"and":[19,59,76,132,197],"independent":[20],"sampling.":[21],"This":[22],"yields":[23],"the":[24,39,50,56,84,128,139,150,154,169,185],"first":[25,40],"algorithmic":[26],"improvement":[27],"over":[28],"prior,":[29],"approaches":[33],"since":[34],"Koutis":[35],"(2014)":[36],"and,":[37],"time":[41],"practical":[44],"algorithm,":[45],"eliminates":[46],"any":[47],"dependence":[48],"target":[51],"approximation":[52],"accuracy":[53],"$\u03b5$":[54],"in":[55,89,104,125,138],"algorithm's":[57],"work":[58],"depth.":[60],"Our":[61],"works":[63],"by":[64,74],"sub-sampling":[65],"edges":[66],"according":[67],"to":[68,82,175],"their":[69],"robust":[70,85,151],"connectivity,":[71],"as":[72],"introduced":[73],"Kapralov":[75],"Panigrahy":[77],"(2012).":[78],"show":[80],"how":[81],"estimate":[83],"connectivities":[86],"of":[87,127,153,168],"$G$":[88,105],"an":[90,146,188],"extremely":[91],"simple":[92],"manner:":[93],"we":[94,119],"create":[95],"multiple":[96],"random":[97],"sub":[98],"$G_p$,":[100],"where":[101],"each":[102,126],"edge":[103,155],"is":[106],"sub-sampled":[107],"independently":[108],"with":[109,145,187],"probability":[110],"$p_e":[111],"=":[112,157],"\\min":[113],"\\{w_e":[114],"\\cdot":[115],"p,":[116],"1\\}$.":[117],"Then,":[118],"run":[120],"Low":[122],"Diameter":[123],"Decomposition":[124],"graphs.":[129],"If":[130],"$u$":[131],"$v$":[133],"often":[134],"share":[135],"cluster":[137],"LDDs,":[140],"then":[141,172],"this":[142,161],"provides":[143],"us":[144,174],"upper":[147],"bound":[148],"connectivity":[152],"$e":[156],"(u,v)$.":[158],"Carefully":[159],"invoking":[160],"procedure":[162],"$O(\\log":[164],"n)$":[165],"different":[166],"values":[167],"probabilities":[170],"$p$":[171],"allows":[173],"obtain":[176],"sufficiently":[177],"good":[178],"estimates":[179],"sub-sampling.":[181],"additionally":[183],"complement":[184],"theory":[186],"experimental":[189],"evaluation":[190],"demonstrating":[191],"strong":[192],"performance":[193],"across":[194],"relevant":[195],"sparsity":[198],"regimes.":[199]},"counts_by_year":[],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2026-07-30T00:00:00"}