{"id":"https://openalex.org/W7170145868","doi":"https://doi.org/10.4230/lipics.ccc.2026.2","title":"Bounded-Independence Sampling of Edges for Combinatorial Graph Properties","display_name":"Bounded-Independence Sampling of Edges for Combinatorial Graph Properties","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7170145868","doi":"https://doi.org/10.4230/lipics.ccc.2026.2"},"language":"en","primary_location":{"id":"doi:10.4230/lipics.ccc.2026.2","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.2","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.4230/lipics.ccc.2026.2","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091954510","display_name":"Aaron Putterman","orcid":"https://orcid.org/0000-0001-9737-2406"},"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":"Putterman, Aaron","raw_affiliation_strings":["Harvard University, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0001-9737-2406","affiliations":[{"raw_affiliation_string":"Harvard University, Cambridge, MA, USA","institution_ids":["https://openalex.org/I2801851002"]}]},{"author_position":"middle","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":"Vadhan, Salil","raw_affiliation_strings":["Harvard University, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0002-4059-4072","affiliations":[{"raw_affiliation_string":"Harvard University, Cambridge, MA, USA","institution_ids":["https://openalex.org/I2801851002"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5130782777","display_name":"Vadim Zaripov","orcid":null},"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":"Zaripov, Vadim","raw_affiliation_strings":["Harvard University, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0009-0004-7904-1274","affiliations":[{"raw_affiliation_string":"Harvard University, Cambridge, MA, USA","institution_ids":["https://openalex.org/I2801851002"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I2801851002"],"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":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4652999937534332},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.46480000019073486},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.44449999928474426},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.44449999928474426},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.42809998989105225},{"id":"https://openalex.org/keywords/probability-distribution","display_name":"Probability distribution","score":0.3978999853134155},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.39259999990463257},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.37229999899864197},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.367000013589859},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.35910001397132874}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7307000160217285},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6025999784469604},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.555899977684021},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4652999937534332},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.46480000019073486},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.44449999928474426},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.44449999928474426},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.42809998989105225},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.3978999853134155},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.39259999990463257},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.37229999899864197},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.367000013589859},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.35910001397132874},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.34929999709129333},{"id":"https://openalex.org/C103257674","wikidata":"https://www.wikidata.org/wiki/Q6934937","display_name":"Multiple edges","level":3,"score":0.34619998931884766},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.33410000801086426},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3206000030040741},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.30250000953674316},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.2994000017642975},{"id":"https://openalex.org/C30609935","wikidata":"https://www.wikidata.org/wiki/Q7291969","display_name":"Random geometric graph","level":5,"score":0.29829999804496765},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.29589998722076416},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2912999987602234},{"id":"https://openalex.org/C18653775","wikidata":"https://www.wikidata.org/wiki/Q1333358","display_name":"Joint probability distribution","level":2,"score":0.2858000099658966},{"id":"https://openalex.org/C4255713","wikidata":"https://www.wikidata.org/wiki/Q7291988","display_name":"Random regular graph","level":5,"score":0.28529998660087585},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.28519999980926514},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.27889999747276306},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.2687999904155731},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2685000002384186},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.26829999685287476},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.2630000114440918},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.25870001316070557},{"id":"https://openalex.org/C64731005","wikidata":"https://www.wikidata.org/wiki/Q333464","display_name":"Analysis of algorithms","level":2,"score":0.25679999589920044},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.2531999945640564},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.25119999051094055}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4230/lipics.ccc.2026.2","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.2","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.4230/lipics.ccc.2026.2","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.2","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"ConferencePaper"},"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":{"Random":[0],"subsampling":[1],"of":[2,16,54,73,78,81,91,101,233,241,255,271],"edges":[3],"is":[4,185,222],"a":[5,13,40,122,136,155,170,202,211,216],"commonly":[6],"employed":[7],"technique":[8,23],"in":[9,58,70,121,154,201,252],"graph":[10,123,156,203],"algorithms,":[11],"underlying":[12],"vast":[14],"array":[15],"modern":[17],"algorithmic":[18],"breakthroughs.":[19],"Unfortunately,":[20],"using":[21,194,242],"this":[22,48,52,263],"often":[24],"leads":[25],"to":[26,33,65,179,245],"randomized":[27,56],"algorithms":[28,244,270],"with":[29,124,130,157,164,189,204,225],"no":[30],"clear":[31],"path":[32],"derandomization":[34],"because":[35],"the":[36,71,79,102,219,231,238,253,268],"analyses":[37],"rely":[38],"on":[39],"union":[41],"bound":[42],"over":[43],"exponentially":[44],"many":[45],"events.":[46],"In":[47,262],"work,":[49],"we":[50,107,177,182,236,265],"revisit":[51,237],"goal":[53],"derandomizing":[55],"sampling":[57,117,150],"graphs.":[59],"We":[60],"give":[61],"several":[62,77],"results":[63,80],"related":[64],"bounded-independence":[66,89],"edge":[67,99],"subsampling,":[68],"and":[69,83,258,274],"process":[72],"doing":[74],"so,":[75],"generalize":[76],"Alon":[82],"Nussboim":[84],"(FOCS":[85,260],"2008),":[86],"who":[87],"studied":[88,251],"analogues":[90],"random":[92,197],"graphs":[93],"(which":[94],"can":[95,278],"be":[96,279],"viewed":[97],"as":[98],"subsamples":[100],"complete":[103],"graph).":[104],"Most":[105],"notably,":[106],"show:":[108],"1)":[109],"O(log(m))-wise":[110,142],"independence":[111,144],"suffices":[112,145],"for":[113,146],"preserving":[114],"connectivity":[115],"when":[116,149],"at":[118,151],"rate":[119,152],"1/2":[120,153,192],"minimum":[125,158,205],"cut":[126,206],"\u2265":[127,161,207],"\u03ba":[128,162,208],"log(m)":[129,163,209],"probability":[131,165,226],"1":[132,166],"-":[133,167],"1/poly(m)":[134,168],"(for":[135,169,210],"sufficiently":[137,171,212],"large":[138,172,213],"constant":[139,173,214],"\u03ba).":[140,174],"2)":[141],"(1/poly(m))-almost":[143],"ensuring":[147],"cycle-freeness":[148],"cycle":[159],"length":[160],"3)":[175],"If":[176],"relax":[178],"arbitrary":[180],"distributions,":[181],"show":[183,266],"there":[184],"an":[186],"explicit":[187],"distribution":[188,220],"marginals":[190],"\u2264":[191],"generated":[193],"O(log(m)log":[195],"log(m))":[196],"bits":[198],"such":[199],"that":[200,267],"\u03ba),":[215],"sample":[217],"from":[218],"has":[221],"still":[223],"connected":[224],"1-":[227],"1/poly(m).":[228],"To":[229],"demonstrate":[230],"utility":[232],"our":[234],"results,":[235],"classic":[239],"problem":[240],"parallel":[243],"find":[246],"graphic":[247],"matroid":[248],"bases,":[249],"first":[250],"work":[254],"Karp,":[256],"Upfal,":[257],"Wigderson":[259],"1985).":[261],"regime,":[264],"optimal":[269],"Khanna,":[272],"Putterman,":[273],"Song":[275],"(arxiv":[276],"2025)":[277],"explicitly":[280],"derandomized":[281],"while":[282],"maintaining":[283],"near-optimality.":[284]},"counts_by_year":[],"updated_date":"2026-07-24T06:07:23.975819","created_date":"2026-07-24T00:00:00"}