{"id":"https://openalex.org/W7129033085","doi":"https://doi.org/10.1007/s00453-026-01372-w","title":"Concentration of Submodular Functions and Read-k Families Under Negative Dependence","display_name":"Concentration of Submodular Functions and Read-k Families Under Negative Dependence","publication_year":2026,"publication_date":"2026-02-16","ids":{"openalex":"https://openalex.org/W7129033085","doi":"https://doi.org/10.1007/s00453-026-01372-w"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-026-01372-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-026-01372-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-026-01372-w.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-026-01372-w.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009952954","display_name":"Sharmila Duppala","orcid":"https://orcid.org/0000-0001-6809-8858"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sharmila Duppala","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126075491","display_name":"George Z. Li","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"George Z. Li","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102838487","display_name":"Juan Luque","orcid":"https://orcid.org/0000-0002-6565-4684"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Juan Luque","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126147390","display_name":"Aravind Srinivasan","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5092855499","display_name":"Renata Valieva","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Renata Valieva","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5009952954"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.35140705,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"88","issue":"2","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.4936999976634979,"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.4936999976634979,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.17880000174045563,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.11890000104904175,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9128999710083008},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.6448000073432922},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.604200005531311},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.328900009393692},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3075999915599823},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.305400013923645}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9128999710083008},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7515000104904175},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.6448000073432922},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.604200005531311},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5260999798774719},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.475600004196167},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.328900009393692},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3075999915599823},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.305400013923645},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.30059999227523804},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.2937000095844269},{"id":"https://openalex.org/C2777169571","wikidata":"https://www.wikidata.org/wiki/Q5158328","display_name":"Concentration inequality","level":2,"score":0.2915000021457672},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.28049999475479126},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26080000400543213},{"id":"https://openalex.org/C45555294","wikidata":"https://www.wikidata.org/wiki/Q28113351","display_name":"Inequality","level":2,"score":0.25130000710487366}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-026-01372-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-026-01372-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-026-01372-w.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00453-026-01372-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-026-01372-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-026-01372-w.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.6459620594978333}],"awards":[{"id":"https://openalex.org/G1918829015","display_name":null,"funder_award_id":"CCF-1918749","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7556557724","display_name":"Expeditions: Collaborative Research: Global Pervasive Computational Epidemiology","funder_award_id":"1918749","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7795196665","display_name":null,"funder_award_id":"CF-1918749","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":false},"content_urls":{"pdf":"https://content.openalex.org/works/W7129033085.pdf"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1509845037","https://openalex.org/W1526762477","https://openalex.org/W1965765215","https://openalex.org/W1968135284","https://openalex.org/W1989274820","https://openalex.org/W1997988698","https://openalex.org/W1999678910","https://openalex.org/W2007604989","https://openalex.org/W2008095352","https://openalex.org/W2042587503","https://openalex.org/W2063844956","https://openalex.org/W2077204415","https://openalex.org/W2080051189","https://openalex.org/W2144407406","https://openalex.org/W2158343516","https://openalex.org/W2295578127","https://openalex.org/W2771798078","https://openalex.org/W2952110341","https://openalex.org/W2952567852","https://openalex.org/W2965173882","https://openalex.org/W3167350281","https://openalex.org/W4233413206","https://openalex.org/W6910517027"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"We":[1,22,67,79],"study":[2],"the":[3,29,33,84,104],"question":[4],"of":[5,9,15,71,86,94,103,107],"whether":[6],"submodular":[7],"functions":[8],"random":[10,34,57],"variables":[11,35,58],"satisfying":[12],"various":[13],"notions":[14],"negative":[16,37,40,95],"dependence":[17],"satisfy":[18,36],"Chernoff-like":[19],"concentration":[20,26,54,85],"inequalities.":[21],"prove":[23],"such":[24,53],"a":[25,100],"inequality":[27],"for":[28,56],"lower":[30],"tail":[31],"when":[32],"association":[38],"or":[39],"regression,":[41],"partially":[42],"resolving":[43],"an":[44],"open":[45],"problem":[46],"raised":[47],"in":[48],"([1]).":[49],"Previous":[50],"work":[51],"showed":[52],"results":[55,73],"that":[59],"come":[60],"from":[61],"specific":[62],"dependent-rounding":[63],"algorithms":[64],"([2,":[65],"3]).":[66],"discuss":[68],"some":[69],"applications":[70,82],"our":[72],"to":[74,83],"combinatorial":[75],"optimization":[76],"and":[77],"beyond.":[78],"also":[80],"show":[81,99],"read-":[87],"k":[88],"families":[89],"[4]":[90],"under":[91],"certain":[92],"forms":[93],"dependence;":[96],"we":[97],"further":[98],"simplified":[101],"proof":[102],"entropy-method":[105],"approach":[106],"[4].":[108]},"counts_by_year":[],"updated_date":"2026-04-28T14:05:53.105641","created_date":"2026-02-17T00:00:00"}