{"id":"https://openalex.org/W7160923273","doi":"https://doi.org/10.48550/arxiv.2605.09814","title":"Streaming Complexity Separations for Dense and Sparse Graphs","display_name":"Streaming Complexity Separations for Dense and Sparse Graphs","publication_year":2026,"publication_date":"2026-05-10","ids":{"openalex":"https://openalex.org/W7160923273","doi":"https://doi.org/10.48550/arxiv.2605.09814"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.09814","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.09814","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.2605.09814","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135994041","display_name":"Yang P. Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Yang P.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101193184","display_name":"Hoai-An Nguyen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nguyen, Hoai-An","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135992217","display_name":"Noah G. Singer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Singer, Noah G.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135972441","display_name":"David P. Woodruff","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Woodruff, David P.","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.9010999798774719,"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.9010999798774719,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.07429999858140945,"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/T11478","display_name":"Caching and Content Delivery","score":0.00279999990016222,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/logarithm","display_name":"Logarithm","score":0.6292999982833862},{"id":"https://openalex.org/keywords/streaming-algorithm","display_name":"Streaming algorithm","score":0.6115999817848206},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.6101999878883362},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5066999793052673},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4909999966621399},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4887000024318695},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4424999952316284}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6297000050544739},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6292999982833862},{"id":"https://openalex.org/C187166803","wikidata":"https://www.wikidata.org/wiki/Q2835831","display_name":"Streaming algorithm","level":3,"score":0.6115999817848206},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.6101999878883362},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5178999900817871},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5066999793052673},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4909999966621399},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4887000024318695},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4424999952316284},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4253999888896942},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4018999934196472},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.365200012922287},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.36329999566078186},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.34540000557899475},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30230000615119934},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.295199990272522},{"id":"https://openalex.org/C103278499","wikidata":"https://www.wikidata.org/wiki/Q254465","display_name":"Similarity (geometry)","level":3,"score":0.27720001339912415},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2732999920845032},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.2732999920845032},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.26489999890327454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.09814","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.09814","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.09814","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.09814","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,77],"identify":[1],"a":[2,91,126,144],"sharp":[3,108],"separation":[4,109],"in":[5,110,136],"the":[6,14,24,50,58,72,95,98,111,130,133],"streaming":[7,112],"space":[8,34,40,64,113,134],"complexity":[9,114,135],"of":[10,75,97,115],"Maximum":[11],"Cut":[12],"when":[13],"algorithm":[15],"must":[16],"output":[17],"an":[18,80,106],"approximate":[19,25],"cut":[20],"(rather":[21],"than":[22],"only":[23],"value).":[26],"For":[27],"dense":[28,137],"graphs,":[29],"we":[30,55,104],"show":[31,56,119],"that":[32,38,57,120],"$O(n/\\varepsilon^2)$":[33],"is":[35,41,52,69],"sufficient":[36],"and":[37,118,129],"$\u03a9(n)$":[39],"necessary.":[42],"In":[43],"contrast,":[44],"for":[45,65,71,89,121],"graphs":[46],"with":[47],"$\u0398(n/\\varepsilon^2)$":[48],"edges,":[49],"situation":[51],"markedly":[53],"different:":[54],"problem":[59,132],"requires":[60],"$\u03a9(n":[61,81],"\\log(\\varepsilon^2":[62],"n)/\\varepsilon^2)$":[63],"any":[66],"$\\varepsilon=\u03c9(1/\\sqrt{n})$,":[67],"which":[68],"tight":[70],"full":[73],"range":[74],"$\\varepsilon$.":[76],"also":[78],"give":[79],"\\log":[82],"n/\\varepsilon^2)$-space":[83],"lower":[84],"bound":[85],"against":[86],"deterministic":[87],"algorithms":[88],"outputting":[90],"$(1-\\varepsilon)$":[92],"approximation":[93],"to":[94],"value":[96],"maximum":[99],"cut.":[100],"Using":[101],"similar":[102],"techniques":[103],"prove":[105],"analogous":[107],"Densest":[116],"Subgraph":[117],"every":[122],"constant-arity":[123],"CSP":[124],"over":[125],"constant-size":[127],"alphabet":[128],"Similarity":[131],"streams":[138],"can":[139],"be":[140],"improved":[141],"by":[142],"shaving":[143],"logarithmic":[145],"factor.":[146]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-13T00:00:00"}