{"id":"https://openalex.org/W7148989500","doi":"https://doi.org/10.48550/arxiv.2604.01263","title":"Near-Optimal Parallel Approximate Counting via Sampling","display_name":"Near-Optimal Parallel Approximate Counting via Sampling","publication_year":2026,"publication_date":"2026-04-01","ids":{"openalex":"https://openalex.org/W7148989500","doi":"https://doi.org/10.48550/arxiv.2604.01263"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.01263","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01263","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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.2604.01263","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5132901973","display_name":"David G. Harris","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Harris, David G.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132913613","display_name":"Vladimir Kolmogorov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kolmogorov, Vladimir","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132915729","display_name":"Hongyang Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Hongyang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132867167","display_name":"Yitong Yin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yin, Yitong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5132898390","display_name":"Yiyao Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Yiyao","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/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9086999893188477,"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.9086999893188477,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.015599999576807022,"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/T11303","display_name":"Bayesian Modeling and Causal Inference","score":0.008200000040233135,"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/counting-problem","display_name":"Counting problem","score":0.49470001459121704},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.48030000925064087},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47769999504089355},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.42010000348091125},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.40709999203681946},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4058000147342682},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4032999873161316},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.3750999867916107},{"id":"https://openalex.org/keywords/ising-model","display_name":"Ising model","score":0.34709998965263367}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6653000116348267},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5277000069618225},{"id":"https://openalex.org/C16592021","wikidata":"https://www.wikidata.org/wiki/Q5177154","display_name":"Counting problem","level":2,"score":0.49470001459121704},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.48030000925064087},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47769999504089355},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.42010000348091125},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.40709999203681946},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4058000147342682},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4032999873161316},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.3750999867916107},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36640000343322754},{"id":"https://openalex.org/C51329190","wikidata":"https://www.wikidata.org/wiki/Q1076349","display_name":"Ising model","level":2,"score":0.34709998965263367},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.33980000019073486},{"id":"https://openalex.org/C170593435","wikidata":"https://www.wikidata.org/wiki/Q4128565","display_name":"Slice sampling","level":4,"score":0.3343000113964081},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3156000077724457},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30149999260902405},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2996000051498413},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.2994999885559082},{"id":"https://openalex.org/C52740198","wikidata":"https://www.wikidata.org/wiki/Q1539564","display_name":"Importance sampling","level":3,"score":0.2870999872684479},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C187192777","wikidata":"https://www.wikidata.org/wiki/Q381699","display_name":"Rejection sampling","level":5,"score":0.26750001311302185},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2667999863624573},{"id":"https://openalex.org/C158424031","wikidata":"https://www.wikidata.org/wiki/Q1191905","display_name":"Gibbs sampling","level":3,"score":0.2646999955177307},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2614000141620636},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.25760000944137573},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2513999938964844}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.01263","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01263","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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.2604.01263","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01263","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,14,71],"computational":[1],"equivalence":[2],"between":[3,41],"approximate":[4,129],"counting":[5,20,30,130,174,181],"and":[6,99,192],"sampling":[7,22,60],"is":[8,23,32,83],"well":[9,139],"established":[10],"for":[11,67,128,183],"polynomial-time":[12],"algorithms.":[13,164,175],"most":[15],"efficient":[16],"general":[17],"reduction":[18],"from":[19,65],"to":[21,58,170,179],"achieved":[24,74],"via":[25],"simulated":[26],"annealing,":[27],"where":[28,89],"the":[29,38,114,158,188],"problem":[31],"formulated":[33],"in":[34],"terms":[35],"of":[36,47,155,162],"estimating":[37],"ratio":[39],"$Q={Z(\u03b2_{\\max})}/{Z(\u03b2_{\\min})}$":[40],"partition":[42],"functions":[43],"$Z(\u03b2)=\\sum_{x\\in":[44],"\u03a9}":[45],"\\exp(\u03b2H(x))$":[46],"Gibbs":[48],"distributions":[49],"$\u03bc_\u03b2$":[50,66],"over":[51],"$\u03a9$":[52],"with":[53,79,151],"Hamiltonian":[54],"$H$,":[55],"given":[56],"access":[57],"a":[59,124],"oracle":[61],"that":[62,143],"produces":[63],"samples":[64,150],"$\u03b2\\in":[68],"[\u03b2_{\\min},":[69],"\u03b2_{\\max}]$.":[70],"best":[72,159],"bound":[73,96],"by":[75],"known":[76,103],"annealing":[77],"algorithms":[78,104,166,182],"relative":[80],"error":[81],"$\\varepsilon$":[82],"$O(q":[84,132,145],"\\log":[85,146],"h":[86,134,147],"/":[87,135,148],"\\varepsilon^2)$,":[88],"$q,":[90],"h$":[91],"are":[92,109],"parameters":[93,116],"which":[94],"respectively":[95],"$\\ln":[97],"Q$":[98],"$H$.":[100],"However,":[101],"all":[102],"attaining":[105],"this":[106],"near-optimal":[107],"complexity":[108,161],"inherently":[110],"sequential,":[111],"or":[112],"*adaptive*:":[113],"queried":[115],"$\u03b2$":[117],"depend":[118],"on":[119],"previous":[120],"samples.":[121],"We":[122,176],"develop":[123],"simple":[125],"non-adaptive":[126],"algorithm":[127,142],"using":[131],"\\log^2":[133],"\\varepsilon^2)$":[136,149],"samples,":[137],"as":[138,140],"an":[141],"achieves":[144],"just":[152],"two":[153],"rounds":[154],"adaptivity,":[156],"matching":[157],"sample":[160],"sequential":[163],"These":[165],"naturally":[167],"give":[168],"rise":[169],"work-efficient":[171],"parallel":[172],"(RNC)":[173],"discuss":[177],"applications":[178],"RNC":[180],"several":[184],"classic":[185],"models,":[186],"including":[187],"anti-ferromagnetic":[189],"2-spin,":[190],"monomer-dimer":[191],"ferromagnetic":[193],"Ising":[194],"models.":[195]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-04T00:00:00"}