{"id":"https://openalex.org/W4399523290","doi":"https://doi.org/10.1145/3618260.3649699","title":"Sampling Balanced Forests of Grids in Polynomial Time","display_name":"Sampling Balanced Forests of Grids in Polynomial Time","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399523290","doi":"https://doi.org/10.1145/3618260.3649699"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649699","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649699","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649699","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649699","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032733831","display_name":"Sarah Cannon","orcid":"https://orcid.org/0000-0001-6510-4669"},"institutions":[{"id":"https://openalex.org/I106107269","display_name":"Claremont McKenna College","ror":"https://ror.org/04n1me355","country_code":"US","type":"education","lineage":["https://openalex.org/I106107269"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sarah Cannon","raw_affiliation_strings":["Claremont McKenna College, Claremont, USA"],"affiliations":[{"raw_affiliation_string":"Claremont McKenna College, Claremont, USA","institution_ids":["https://openalex.org/I106107269"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054318475","display_name":"Wesley Pegden","orcid":"https://orcid.org/0000-0002-3680-1817"},"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":"Wesley Pegden","raw_affiliation_strings":["Carnegie Mellon University, Pittsburgh, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, Pittsburgh, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035370064","display_name":"Jamie Tucker-Foltz","orcid":"https://orcid.org/0000-0001-9174-3341"},"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":"Jamie Tucker-Foltz","raw_affiliation_strings":["Harvard University, Boston, USA"],"affiliations":[{"raw_affiliation_string":"Harvard University, Boston, USA","institution_ids":["https://openalex.org/I2801851002"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5032733831"],"corresponding_institution_ids":["https://openalex.org/I106107269"],"apc_list":null,"apc_paid":null,"fwci":1.5073,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.81689073,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1676","last_page":"1687"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9980999827384949,"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"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9980999827384949,"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"}},{"id":"https://openalex.org/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9965000152587891,"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/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9697999954223633,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"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/mathematics","display_name":"Mathematics","score":0.72474604845047},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6891345977783203},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6222493052482605},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.4943408966064453},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4814947843551636},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.4780305325984955},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4677082896232605},{"id":"https://openalex.org/keywords/tutte-polynomial","display_name":"Tutte polynomial","score":0.4648641049861908},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.4601711630821228},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4596836566925049},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4456423819065094},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.43121272325515747},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.3843148946762085},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3620832562446594},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.20230865478515625},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.1808682084083557},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.16533461213111877},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16261154413223267},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.11642718315124512}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.72474604845047},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6891345977783203},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6222493052482605},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.4943408966064453},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4814947843551636},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.4780305325984955},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4677082896232605},{"id":"https://openalex.org/C14447369","wikidata":"https://www.wikidata.org/wiki/Q7857002","display_name":"Tutte polynomial","level":5,"score":0.4648641049861908},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.4601711630821228},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4596836566925049},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4456423819065094},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.43121272325515747},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.3843148946762085},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3620832562446594},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.20230865478515625},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.1808682084083557},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.16533461213111877},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16261154413223267},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.11642718315124512},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3618260.3649699","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649699","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649699","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649699","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649699","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649699","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4399523290.pdf"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1600293573","https://openalex.org/W2021272950","https://openalex.org/W2059083101","https://openalex.org/W2899702797","https://openalex.org/W2987728585","https://openalex.org/W3012513771","https://openalex.org/W3033861466","https://openalex.org/W3035025356","https://openalex.org/W3042555039","https://openalex.org/W3044478838","https://openalex.org/W3122502295","https://openalex.org/W3128536916","https://openalex.org/W3135651976","https://openalex.org/W3162705107","https://openalex.org/W3164744817","https://openalex.org/W3168179120","https://openalex.org/W3203236016","https://openalex.org/W3206884469","https://openalex.org/W4206619443","https://openalex.org/W4233487623","https://openalex.org/W4316652458","https://openalex.org/W6781200654","https://openalex.org/W7039570959"],"related_works":["https://openalex.org/W2911818503","https://openalex.org/W2122848400","https://openalex.org/W1570175605","https://openalex.org/W4380840098","https://openalex.org/W2571550117","https://openalex.org/W2613462520","https://openalex.org/W2138987445","https://openalex.org/W2281826919","https://openalex.org/W2951308702","https://openalex.org/W2069643240"],"abstract_inverted_index":{"We":[0],"prove":[1],"that":[2,112,192],"a":[3,33,88,94,114,154],"polynomial":[4],"fraction":[5],"of":[6,9,22,35,75,78,81,91,99,117,153,188],"the":[7,13,43,59,69,76,92,100],"set":[8],"k-component":[10],"forests":[11],"in":[12,24],"m":[14],"\u00d7":[15],"n":[16],"grid":[17,54,101],"graph":[18,55,187],"have":[19,176,206],"equal":[20],"numbers":[21],"vertices":[23],"each":[25,65,82],"component,":[26],"for":[27,48,113,165,171],"any":[28,125,150],"constant":[29,130,132,140],"k.":[30],"This":[31,161],"resolves":[32],"conjecture":[34],"Charikar,":[36],"Liu,":[37,38],"and":[39,41,210],"Vuong,":[40],"establishes":[42],"first":[44],"provably":[45],"polynomial-time":[46,163],"algorithm":[47],"(exactly":[49],"or":[50],"approximately)":[51],"sampling":[52,166],"balanced":[53,106,168],"partitions":[56,170,205],"according":[57,67],"to":[58,68,124,178,216,219],"spanning":[60,79,97,146],"tree":[61,98],"distribution,":[62],"which":[63],"weights":[64],"k-partition":[66],"product,":[70],"across":[71],"its":[72],"k":[73,197],"pieces,":[74],"number":[77],"trees":[80,147],"piece.":[83],"Our":[84,174],"result":[85],"follows":[86],"from":[87,144],"careful":[89],"analysis":[90],"probability":[93],"uniformly":[95],"random":[96],"can":[102,148],"be":[103,194],"cut":[104],"into":[105,196],"pieces.":[107],"Beyond":[108],"grids,":[109],"we":[110,120,136],"show":[111,137],"broad":[115],"family":[116],"lattice-like":[118,172],"graphs,":[119],"achieve":[121],"balance":[122],"up":[123],"multiplicative":[126],"(1":[127],"\u00b1":[128],"\u03b5)":[129],"with":[131,139],"probability.":[133],"More":[134],"generally,":[135],"that,":[138],"probability,":[141],"components":[142],"derived":[143],"uniform":[145],"approximate":[149],"given":[151],"partition":[152],"planar":[155],"region":[156],"specified":[157],"by":[158],"Jordan":[159],"curves.":[160],"implies":[162],"algorithms":[164],"approximately":[167],"tree-weighted":[169,204],"graphs.":[173],"results":[175],"applications":[177],"understanding":[179],"political":[180],"districtings,":[181],"where":[182],"there":[183],"is":[184],"an":[185],"underlying":[186],"indivisible":[189],"geographic":[190],"units":[191],"must":[193],"partitioned":[195],"population-balanced":[198],"connected":[199],"subgraphs.":[200],"In":[201],"this":[202,211],"setting,":[203],"interesting":[207],"geometric":[208],"properties,":[209],"has":[212],"stimulated":[213],"significant":[214],"effort":[215],"develop":[217],"methods":[218],"sample":[220],"them.":[221]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}